Summary
Non commutative fast algorithms to compute 2×2 matrix product are classified with regard to stability. An analysis of the rounding error propagation is presented for then×n matrix multiplication algorithms obtained by recursive partitioning.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bank, R.E., Rose, D.J.: AnO(n2) method for solving constant coefficient boundary value problems in two dimensions. SIAM J. Numer. Anal.12, 529–540 (1975)
Borodin, A., Munro, I.: Computational complexity of algebraic and numeric problems. New York: 1975 Elsevier
Brent, R.P.: Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity. Numer. Math.16, 145–156 (1970)
Brent, R.P.: Algorithms for matrix multiplication. Report STAN-CS-70-157, Stanford University (1970)
Brockett, R.W., Dobkin, D.: On the optimal evaluation of a set of bilinear forms. Linear Algebra and Appl.19, 207–235 (1978)
Forsythe, G., Moler, C.: Computer solution of linear algebraic systems. Englewood Cliffs, N.J.: Prentice Hall (1967)
Miller, W.: Remark on the complexity of roundoff analysis. Computing12, 149–161 (1974)
Miller, W.: Computational complexity and numerical stability. SIAM J. Comput.4, 97–107 (1975)
Strassen, V.: Gaussian elimination is not optimal. Numer. Math.13, 354–356 (1969)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bini, D., Lotti, G. Stability of fast algorithms for matrix multiplication. Numer. Math. 36, 63–72 (1980). https://doi.org/10.1007/BF01395989
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01395989