Using Strassen's algorithm to accelerate the solution of linear systems
From MaRDI portal
Recommendations
- Using Strassen's matrix multiplication in high performance solution of linear systems
- Publication:5751850
- Extra High Speed Matrix Multiplication on the Cray-2
- Exploiting fast matrix multiplication within the level 3 BLAS
- Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures
Cites work
- scientific article; zbMATH DE number 3942890 (Why is no real title available?)
- Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs
- Computational Complexity and Numerical Stability
- Corrigenda: “An Extended Set of FORTRAN Basic Linear Algebra Subprograms”
- Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
- Exploiting fast matrix multiplication within the level 3 BLAS
- Extra High Speed Matrix Multiplication on the Cray-2
- Gaussian elimination is not optimal
- Matrix multiplication via arithmetic progressions
Cited in
(9)- Extra High Speed Matrix Multiplication on the Cray-2
- Strassen's algorithm reloaded on GPUs
- Strassen's algorithm on coarse grained multicomputers
- scientific article; zbMATH DE number 4186997 (Why is no real title available?)
- Fast rectangular matrix multiplication and QR decomposition
- Using Strassen's matrix multiplication in high performance solution of linear systems
- Accelerating Linear System Solutions Using Randomization Techniques
- An approach for computing the exact stability domain for a class of LTI parameter dependent systems
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
This page was built for publication: Using Strassen's algorithm to accelerate the solution of linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547473)
