The design of MA48
- 1 June 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 22 (2) , 187-226
- https://doi.org/10.1145/229473.229476
Abstract
We describe the design of a new code for the direct solution of sparse unsymmetric linear systems of equations. The new code utilizes a novel restructuring of the symbolic and numerical phases, which increases speed and saves storage without sacrifice of numerical stability. Other features include switching to full-matrix processing in all phases of the computation enabling the use of all three levels of BLAS, treatment of rectangular or rank-deficient matrices, partial factorization, and integrated facilities for iterative refinement and error estimation.Keywords
This publication has 20 references indexed in Scilit:
- Exploiting Structural Symmetry in a Sparse Partial Pivoting CodeSIAM Journal on Scientific Computing, 1993
- A set of level 3 basic linear algebra subprogramsACM Transactions on Mathematical Software, 1990
- Solving Sparse Linear Systems with Sparse Backward ErrorSIAM Journal on Matrix Analysis and Applications, 1989
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programsACM Transactions on Mathematical Software, 1988
- On Algorithms for Obtaining a Maximum TransversalACM Transactions on Mathematical Software, 1981
- Algorithm 575: Permutations for a Zero-Free Diagonal [F1]ACM Transactions on Mathematical Software, 1981
- Some Design Features of a Sparse Matrix CodeACM Transactions on Mathematical Software, 1979
- An Implementation of Tarjan's Algorithm for the Block Triangularization of a MatrixACM Transactions on Mathematical Software, 1978
- Algorithm 529: Permutations To Block Triangular Form [F1]ACM Transactions on Mathematical Software, 1978