The numerical instability of Bini's algorithm

DOI10.1016/0020-0190(81)90068-5zbMath0452.68043OpenAlexW1988468494MaRDI QIDQ1148669

Nai-Kuan Tsao

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90068-5

zbMATH Keywords

error analysismatrix multiplication algorithm

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Algorithms in computer science (68W99)

Related Items (2)

Reply to the paper The numerical instability of Bini's algorithm ⋮ The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic

Cites Work

• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Unnamed Item

This page was built for publication: The numerical instability of Bini's algorithm