Affiliation:
1. Rutherford Appletion Lab., Oxon, England, UK
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Applied Mathematics,Software
Reference28 articles.
1. ANDERSON E. BAI Z. BISCHOF C. DEMMEL J. DONGARRA J. Du CROZ J. GREENBAUM A. HAMMARLING S. McKENNEY A. OSTROUCHOV S. AND SORENSEN D. 1992. LAPACK Users' Guide. SLAM Philadelphia Pa. ANDERSON E. BAI Z. BISCHOF C. DEMMEL J. DONGARRA J. Du CROZ J. GREENBAUM A. HAMMARLING S. McKENNEY A. OSTROUCHOV S. AND SORENSEN D. 1992. LAPACK Users' Guide. SLAM Philadelphia Pa.
2. Solving Sparse Linear Systems with Sparse Backward Error
3. A set of level 3 basic linear algebra subprograms
4. Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programs
5. DUFF I. S. 1977. MA28--A set of Fortran subroutines for sparse unsymmetric linear equations. Rep. AERE R8730 HMSO London. DUFF I. S. 1977. MA28--A set of Fortran subroutines for sparse unsymmetric linear equations. Rep. AERE R8730 HMSO London.
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献