Predicting the structure of sparse orthogonal factors
From MaRDI portal
Publication:1318224
DOI10.1016/0024-3795(93)90121-4zbMath0797.65014OpenAlexW2069792133MaRDI QIDQ1318224
Publication date: 27 March 1994
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(93)90121-4
QR factorizationefficient algorithmsHouseholder arraypredicting the structure of sparse orthogonal factors
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Separators and structure prediction in sparse orthogonal factorization ⋮ Patterns that preserve sparsity in orthogonal factorization ⋮ On the diameter of tree associahedra ⋮ A survey of direct methods for sparse linear systems ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Predicting the structure of sparse orthogonal factors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching theory
- Solution of sparse linear least squares problems using Givens rotations
- Predicting the structure of sparse orthogonal factors
- Sparsity Analysis of the $QR$ Factorization
- Coverings of Bipartite Graphs
- Connectivity and Reducibility of Graphs
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- Predicting fill for sparse orthogonal factorization
- A Data Structure for Sparse $QR$ and $LU$ Factorizations
- Remarks on implementation of O ( n 1/2 τ) assignment algorithms
- Sparse Matrices in MATLAB: Design and Implementation
- Algorithmic Aspects of Vertex Elimination on Directed Graphs
- Predicting Structure in Sparse Matrix Computations
- Computing the block triangular form of a sparse matrix
- Term Rank of the Direct Product of Matrices
- Some Results on Sparse Matrices
- Two Algorithms for Bipartite Graphs
This page was built for publication: Predicting the structure of sparse orthogonal factors
