Reply to the paper The numerical instability of Bini's algorithm

DOI10.1016/0020-0190(82)90072-2zbMath0481.68038OpenAlexW2019717153MaRDI QIDQ1162356

Dario Andrea Bini

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90072-2

zbMATH Keywords

error analysisapproximate algorithmsmatrix multiplication algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of matrix norms, conditioning, scaling (65F35) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• Unnamed Item
• Stability of fast algorithms for matrix multiplication
• The numerical instability of Bini's algorithm
• Relations between exact and approximate bilinear algorithms. Applications
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Approximate Solutions for the Bilinear Form Computational Problem
• Partial and Total Matrix Multiplication
• On the Asymptotic Complexity of Matrix Multiplication