Stability of fast algorithms for matrix multiplication

DOI10.1007/BF01395989zbMath0431.65024OpenAlexW2011461657MaRDI QIDQ1138347

Grazia Lotti, Dario Andrea Bini

Publication date: 1980

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132690

zbMATH Keywords

stabilityfast algorithmsrecursive partitioningmatrix multiplicationrounding error propagation

Mathematics Subject Classification ID

Roundoff error (65G50) Algorithms in computer science (68W99)

Related Items

Fast rectangular matrix multiplication and QR decomposition, Solvers for $\mathcal{O} (N)$ Electronic Structure in the Strong Scaling Limit, The aggregation and cancellation techniques as a practical tool for faster matrix multiplication, The bilinear complexity and practical algorithms for matrix multiplication, Fast matrix multiplication is stable, Unnamed Item, Numerical stability and tensor nuclear norm, Fast matrix multiplication and its algebraic neighbourhood, Reply to the paper The numerical instability of Bini's algorithm, On practical algorithms for accelerated matrix multiplication, Fast linear algebra is stable, Improving the Numerical Stability of Fast Matrix Multiplication

Cites Work

• Unnamed Item
• Unnamed Item
• On the optimal evaluation of a set of bilinear forms
• Remarks on the complexity of roundoff analysis
• Gaussian elimination is not optimal
• Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
• Computational Complexity and Numerical Stability
• An $O(n^2 )$ Method for Solving Constant Coefficient Boundary Value Problems in Two Dimensions