Using Strassen's algorithm to accelerate the solution of linear systems
From MaRDI portal
Publication:547473
DOI10.1007/BF00129836zbMath1215.65049OpenAlexW1972907356MaRDI QIDQ547473
Publication date: 2 July 2011
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00129836
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Fast rectangular matrix multiplication and QR decomposition ⋮ Using Strassen's matrix multiplication in high performance solution of linear systems ⋮ Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ An approach for computing the exact stability domain for a class of LTI parameter dependent systems
Uses Software
Cites Work
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Gaussian elimination is not optimal
- Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
- Extra High Speed Matrix Multiplication on the Cray-2
- Corrigenda: “An Extended Set of FORTRAN Basic Linear Algebra Subprograms”
- Computational Complexity and Numerical Stability
- Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs
- Exploiting fast matrix multiplication within the level 3 BLAS
This page was built for publication: Using Strassen's algorithm to accelerate the solution of linear systems
