A generalized envelope method for sparse factorization by rows

DOI10.1145/103147.103159zbMath0900.65064OpenAlexW2036555554MaRDI QIDQ4371739

Joseph W. H. Liu

Publication date: 9 February 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1991-17/

zbMATH Keywords

sparse matricesenvelope methodsparse and very large systemselimlnation treefactorization by rows

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization ⋮ Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations ⋮ Sparse matrix representations in a functional language ⋮ A sparse proximal implementation of the LP dual active set algorithm ⋮ Dual multilevel optimization ⋮ A survey of direct methods for sparse linear systems

Uses Software

• MA27
• YSMP