Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product

DOI10.1109/TC.1981.1675694zbMath0464.68047OpenAlexW1974407206MaRDI QIDQ3916021

Nai-Kuan Tsao

Publication date: 1981

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1981.1675694

zbMATH Keywords

floating-point arithmeticdata complexityStrassen's algorithmWinograd's algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items

Error complexity analysis of two algorithms for computing powers of arbitrary Hessenberg matrices, The equivalence of decimation in time and decimation in frequency in FFT computations, The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic, On the accuracy of solving triangular systems in parallel. II