The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
From MaRDI portal
Publication:598219
DOI10.1016/j.tcs.2004.01.004zbMath1057.65020OpenAlexW1978106295MaRDI QIDQ598219
Publication date: 6 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.01.004
numerical examplesComputational complexityWinograd algorithmNumerical stabilityFast matrix multiplicationPan's aggregation methodPan's cancellation methodStrassen algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
On the arithmetic complexity of Strassen-like matrix multiplications ⋮ The bilinear complexity and practical algorithms for matrix multiplication ⋮ Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ Additive preconditioning and aggregation in matrix computations ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Two dimensional aggregation procedure: An alternative to the matrix algebraic algorithm ⋮ Fast rectangular matrix multiplication and some applications ⋮ Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization ⋮ Solving structured linear systems with large displacement rank ⋮ Optimization techniques for small matrix multiplication ⋮ Randomized preprocessing of homogeneous linear systems of equations ⋮ Improving the Numerical Stability of Fast Matrix Multiplication
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Stability of fast algorithms for matrix multiplication
- New combinations of methods for the acceleration of matrix multiplication
- On practical algorithms for accelerated matrix multiplication
- General context-free recognition in less than cubic time
- Fast rectangular matrix multiplication and applications
- GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix- matrix multiply algorithm
- Gaussian elimination is not optimal
- Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
- On the computational power of pushdown automata
- How Can We Speed Up Matrix Multiplication?
- Extra High Speed Matrix Multiplication on the Cray-2
- Basic Linear Algebra Subprograms for Fortran Usage
- Approximating Matrix Multiplication for Pattern Recognition Tasks
- Exploiting fast matrix multiplication within the level 3 BLAS
- Stability of block algorithms with fast level-3 BLAS
- Automated empirical optimizations of software and the ATLAS project
This page was built for publication: The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
