Stability of fast algorithms for matrix multiplication
- 1 March 1980
- journal article
- Published by Springer Nature in Numerische Mathematik
- Vol. 36 (1) , 63-72
- https://doi.org/10.1007/bf01395989
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the optimal evaluation of a set of bilinear formsLinear Algebra and its Applications, 1978
- An $O(n^2 )$ Method for Solving Constant Coefficient Boundary Value Problems in Two DimensionsSIAM Journal on Numerical Analysis, 1975
- Computational Complexity and Numerical StabilitySIAM Journal on Computing, 1975
- Remarks on the complexity of roundoff analysisComputing, 1974
- Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identityNumerische Mathematik, 1970
- ALGORITHMS FOR MATRIX MULTIPLICATIONPublished by Defense Technical Information Center (DTIC) ,1970
- Gaussian elimination is not optimalNumerische Mathematik, 1969