Using Strassen's matrix multiplication in high performance solution of linear systems

DOI10.1016/0898-1221(95)00216-2zbMath0874.65015OpenAlexW2036614506MaRDI QIDQ1361273

Marcin Paprzycki, Cliff Cyphers

Publication date: 16 November 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(95)00216-2

zbMATH Keywords

Strassen's algorithmperformance characteristicsdense and structured blocked linear system solversStrassen's matrix multiplication

Mathematics Subject Classification ID

Related Items (1)

An efficient preprocessor for solving systems of linear equations

Uses Software

• LAPACK
• COLROW
• ARCELO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using Strassen's algorithm to accelerate the solution of linear systems
• Parallel solution of almost block diagonal systems on the CRAY Y-MP using level 3 BLAS
• Comparisons of Gaussian elimination algorithms on a Cray Y-MP
• The numerical solution of laminar flow in a re-entrant tube geometry by a Chebyshev spectral element collocation method
• Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures
• High performance solution of partial differential equations discretized using a Chebyshev spectral collocation method
• Gaussian elimination is not optimal
• FORTRAN Packages for Solving Certain Almost Block Diagonal Linear Systems by Modified Alternate Row and Column Elimination
• Exploiting fast matrix multiplication within the level 3 BLAS

This page was built for publication: Using Strassen's matrix multiplication in high performance solution of linear systems