A Data Structure for Sparse QR and LU Factorizations
From MaRDI portal
A Data Structure for Sparse $QR$ and $LU$ Factorizations
Recommendations
- Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations
- scientific article; zbMATH DE number 4109938
- Data-Parallel Sparse Factorization
- Computing row and column counts for sparse \(QR\) and \(LU\) factorization
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
Cited in
(14)- Householder reflections versus Givens rotations in sparse orthogonal decomposition
- A survey of direct methods for sparse linear systems
- Sparse linear least-squares problems
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Predicting the structure of sparse orthogonal factors
- On the Complexity of Sparse QR and LU Factorization of Finite-Element Matrices
- Parallel sparse Gaussian elimination with partial pivoting
- Block computation and representation of a sparse nullspace basis of a rectangular matrix
- Fast implementation of partial Gram-Schmidt algorithm using tree data structure with sequential row pointers data structure to solve structural problems (PGS)
- Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations
- Separators and structure prediction in sparse orthogonal factorization
- scientific article; zbMATH DE number 4109938 (Why is no real title available?)
- Sparsity Analysis of the QR Factorization
- Hierarchical orthogonal factorization: sparse square matrices
This page was built for publication: A Data Structure for Sparse $QR$ and $LU$ Factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3793608)
