Comparisons of Gaussian elimination algorithms on a Cray Y-MP
From MaRDI portal
Publication:1194508
DOI10.1016/0024-3795(92)90018-6zbMath0756.65039OpenAlexW2059419459MaRDI QIDQ1194508
Publication date: 27 September 1992
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(92)90018-6
Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)
Related Items (2)
Using Strassen's matrix multiplication in high performance solution of linear systems ⋮ High performance solution of partial differential equations discretized using a Chebyshev spectral collocation method
Uses Software
Cites Work
- Gaussian elimination is not optimal
- Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
- Parallel Algorithms for Dense Linear Algebra Computations
- An extended set of FORTRAN basic linear algebra subprograms
- Basic Linear Algebra Subprograms for Fortran Usage
- A set of level 3 basic linear algebra subprograms
- Exploiting fast matrix multiplication within the level 3 BLAS
- Unnamed Item
This page was built for publication: Comparisons of Gaussian elimination algorithms on a Cray Y-MP
