Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
From MaRDI portal
Publication:4891707
DOI10.1137/S0895479893259509zbMath0855.65035MaRDI QIDQ4891707
Publication date: 3 February 1997
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
numerical results; sparse matrix; linear least squares problem; QR factorization; Householder factorization; Harwell-Boeing problems; multifrontal-based method
65F50: Computational methods for sparse matrices
15A23: Factorization of matrices
65F20: Numerical solutions to overdetermined systems, pseudoinverses
Related Items
A stable primal-dual approach for linear programming under nondegeneracy assumptions, Block computation and representation of a sparse nullspace basis of a rectangular matrix, Separators and structure prediction in sparse orthogonal factorization, An efficient algorithm for sparse null space basis problem using ABS methods, Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic