An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- 1 April 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 6 (2), 390-409
- https://doi.org/10.1137/0906028
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Solution of Sparse Underdetermined Systems of Linear EquationsSIAM Journal on Scientific and Statistical Computing, 1984
- The Multifrontal Solution of Unsymmetric Sets of Linear EquationsSIAM Journal on Scientific and Statistical Computing, 1984
- The Multifrontal Solution of Indefinite Sparse Symmetric LinearACM Transactions on Mathematical Software, 1983
- A Comparison of Some Methods for Solving Sparse Linear Least-Squares ProblemsSIAM Journal on Scientific and Statistical Computing, 1983
- Some Extensions of an Algorithm for Sparse Linear Least Squares ProblemsSIAM Journal on Scientific and Statistical Computing, 1982
- Algorithm 575: Permutations for a Zero-Free Diagonal [F1]ACM Transactions on Mathematical Software, 1981
- Solution of sparse linear least squares problems using givens rotationsLinear Algebra and its Applications, 1980
- Some Design Features of a Sparse Matrix CodeACM Transactions on Mathematical Software, 1979
- Algorithm 533: NSPIV, a Fortran subroutine for sparse Gaussian elimination with partial pivoting [F4]ACM Transactions on Mathematical Software, 1978
- An Implementation of Tarjan's Algorithm for the Block Triangularization of a MatrixACM Transactions on Mathematical Software, 1978