Predicting the structure of sparse orthogonal factors
From MaRDI portal
Recommendations
Cites work
- A Data Structure for Sparse QR and LU Factorizations
- Algorithmic Aspects of Vertex Elimination on Directed Graphs
- Combinatorial matrix theory
- Computing the block triangular form of a sparse matrix
- Connectivity and Reducibility of Graphs
- Coverings of Bipartite Graphs
- scientific article; zbMATH DE number 3149610 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- Matching theory
- Predicting fill for sparse orthogonal factorization
- Predicting Structure in Sparse Matrix Computations
- Predicting the structure of sparse orthogonal factors
- Remarks on implementation of O ( n 1/2 τ) assignment algorithms
- Solution of sparse linear least squares problems using Givens rotations
- Some Results on Sparse Matrices
- Sparse Matrices in MATLAB: Design and Implementation
- Sparsity Analysis of the QR Factorization
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- Term Rank of the Direct Product of Matrices
- Two Algorithms for Bipartite Graphs
Cited in
(10)- Predicting the structure of sparse orthogonal factors
- Separators and structure prediction in sparse orthogonal factorization
- Patterns that preserve sparsity in orthogonal factorization
- On the diameter of tree associahedra
- A General Orthogonalization Technique with Applications to Time Series Analysis and Signal Processing
- Predicting fill for sparse orthogonal factorization
- Some Results on Structure Prediction in Sparse QR Factorization
- Approximation algorithms in combinatorial scientific computing
- A survey of direct methods for sparse linear systems
- Sparse linear least-squares problems
This page was built for publication: Predicting the structure of sparse orthogonal factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318224)