Predicting fill for sparse orthogonal factorization

DOI10.1145/5925.5932zbMath0635.65036OpenAlexW2141025928MaRDI QIDQ3774826

John R. Gilbert, Anders Edenbrandt, Thomas F. Coleman

Publication date: 1986

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6418

zbMATH Keywords

matchingsparse matricesbipartite graphsleast squaresblock triangular formorthogonal factorizationGivens rotationsfill

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Orthogonalization in numerical linear algebra (65F25)

Related Items (15)

Separators and structure prediction in sparse orthogonal factorization ⋮ A direct method for sparse least squares problems with lower and upper bounds ⋮ Matrix enlarging methods and their application ⋮ Patterns that preserve sparsity in orthogonal factorization ⋮ On the row merge tree for sparse LU factorization with partial pivoting ⋮ Newton flows for elliptic functions. II: Structural stability: classification and representation ⋮ The Null Space Problem II. Algorithms ⋮ Accuracy of preconditioned CG-type methods for least squares problems. ⋮ Matrix stretching for sparse least squares problems ⋮ Unnamed Item ⋮ A survey of direct methods for sparse linear systems ⋮ On the classification of plane graphs representing structurally stable rational Newton flows ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Predicting the structure of sparse orthogonal factors ⋮ DAESA—A Matlab Tool for Structural Analysis of Differential-Algebraic Equations

This page was built for publication: Predicting fill for sparse orthogonal factorization