Predicting fill for sparse orthogonal factorization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 554767
- Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
- Symbolic Givens Reduction and Row-Ordering in Large Sparse Least Squares Problems
- Predicting the structure of sparse orthogonal factors
- On the row merge tree for sparse LU factorization with partial pivoting
Cited in
(17)- A survey of direct methods for sparse linear systems
- Sparse linear least-squares problems
- Accuracy of preconditioned CG-type methods for least squares problems.
- scientific article; zbMATH DE number 554767 (Why is no real title available?)
- Approximation algorithms in combinatorial scientific computing
- On the row merge tree for sparse LU factorization with partial pivoting
- A direct method for sparse least squares problems with lower and upper bounds
- Matrix stretching for sparse least squares problems
- Predicting the structure of sparse orthogonal factors
- The Null Space Problem II. Algorithms
- scientific article; zbMATH DE number 1226271 (Why is no real title available?)
- Newton flows for elliptic functions. II: Structural stability: classification and representation
- Patterns that preserve sparsity in orthogonal factorization
- Separators and structure prediction in sparse orthogonal factorization
- On the classification of plane graphs representing structurally stable rational Newton flows
- Matrix enlarging methods and their application
- DAESA -- a Matlab tool for structural analysis of differential-algebraic equations: theory
This page was built for publication: Predicting fill for sparse orthogonal factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3774826)
