Correction of ‘ J. Laderman, V. Pan, X.–H. Sha, On practical Algorithms for Accelerated Matrix Multiplication, Linear Algebra and its Applications. Vol. 162-164 (1992) pp. 557-588 ’

DOI10.1080/03081087.2024.2391807MaRDI QIDQ6997191zbMATH OpenFDO

Authors Jerzy Stefan Respondek

Publication date 14 April 2025

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081087.2024.2391807

Mathematics Subject Classification ID

Numerical linear algebra (65F99) Complexity and performance of numerical algorithms (65Y20)

Cites work

• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Gaussian elimination is not optimal
• scientific article; zbMATH DE number 7788370 (Why is no real title available?)
• Matrix multiplication via arithmetic progressions
• Multiplying matrices faster than coppersmith-winograd
• On practical algorithms for accelerated matrix multiplication
• Partial and Total Matrix Multiplication
• Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
• Powers of tensors and fast matrix multiplication
• Relations between exact and approximate bilinear algorithms. Applications
• The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
• Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation

This page was built for publication: Correction of ‘ J. Laderman, V. Pan, X.–H. Sha, On practical Algorithms for Accelerated Matrix Multiplication, Linear Algebra and its Applications. Vol. 162-164 (1992) pp. 557-588 ’

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6997191)