Multifrontal Computation with the Orthogonal Factors of Sparse Matrices

DOI10.1137/S0895479893259509zbMath0855.65035MaRDI QIDQ4891707

Szu-Min Lu, Jesse L. Barlow

Publication date: 3 February 1997

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

numerical resultssparse matrixlinear least squares problemQR factorizationHouseholder factorizationHarwell-Boeing problemsmultifrontal-based method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (6)

A stable primal-dual approach for linear programming under nondegeneracy assumptions ⋮ Separators and structure prediction in sparse orthogonal factorization ⋮ An efficient algorithm for sparse null space basis problem using ABS methods ⋮ Block computation and representation of a sparse nullspace basis of a rectangular matrix ⋮ Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic ⋮ A survey of direct methods for sparse linear systems

This page was built for publication: Multifrontal Computation with the Orthogonal Factors of Sparse Matrices