Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
From MaRDI portal
Publication:4891707
Recommendations
Cited in
(12)- Hierarchical orthogonal factorization: sparse least squares problems
- Predicting fill for sparse orthogonal factorization
- A survey of direct methods for sparse linear systems
- scientific article; zbMATH DE number 712354 (Why is no real title available?)
- 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
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)