Two new algorithms for matrix multiplication and vector convolution

DOI10.1080/00207169708804549zbMath0865.68054OpenAlexW2018642318MaRDI QIDQ3123351

Changjun Jiang, Zhehui Wu

Publication date: 6 March 1997

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

matrix multiplicationvector convolution

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• New combinations of methods for the acceleration of matrix multiplication
• Fast Fourier transform and convolution algorithms
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Lower bounds of the complexity of linear algebras
• Gaussian elimination is not optimal
• New Fast Algorithms for Matrix Operations
• Complex Convolutions via Fermat Number Transforms

This page was built for publication: Two new algorithms for matrix multiplication and vector convolution