Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
DOI10.1137/S0895479893259509zbMATH Open0855.65035MaRDI QIDQ4891707FDOQ4891707
Authors: 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)
Recommendations
numerical resultssparse matrixQR factorizationlinear least squares problemHouseholder factorizationHarwell-Boeing problemsmultifrontal-based method
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Cited In (12)
- A survey of direct methods for sparse linear systems
- Predicting fill for sparse orthogonal factorization
- Title not available (Why is that?)
- Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
- Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic
- Block computation and representation of a sparse nullspace basis of a rectangular matrix
- 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
- Hierarchical orthogonal factorization: sparse square matrices
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- Hierarchical orthogonal factorization: sparse least squares problems
This page was built for publication: Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4891707)
