Predicting the structure of sparse orthogonal factors

DOI10.1016/0024-3795(93)90121-4MaRDI QIDQ1318224zbMATH OpenOpenAlexFDO

Authors Alex Pothen

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

zbMATH Keywords

efficient algorithmsQR factorizationHouseholder arraypredicting the structure of sparse orthogonal factors

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Factorization of matrices (15A23)

Recommendations

• Separators and structure prediction in sparse orthogonal factorization
• Some Results on Structure Prediction in Sparse $QR$ Factorization
• scientific article; zbMATH DE number 554767
• On the Use of Structural Zeros in Orthogonal Factorization
• Predicting fill for sparse orthogonal factorization

Cites work

• scientific article; zbMATH DE number 3149610 (Why is no real title available?)
• scientific article; zbMATH DE number 3420184 (Why is no real title available?)
• 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
• Matching theory
• Predicting Structure in Sparse Matrix Computations
• Predicting fill for sparse orthogonal factorization
• 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

(8)

• Predicting fill for sparse orthogonal factorization
• A survey of direct methods for sparse linear systems
• On the diameter of tree associahedra
• A General Orthogonalization Technique with Applications to Time Series Analysis and Signal Processing
• Approximation algorithms in combinatorial scientific computing
• Predicting the structure of sparse orthogonal factors
• Patterns that preserve sparsity in orthogonal factorization
• Separators and structure prediction in sparse orthogonal factorization

Describes a project that uses

Uses Software

• MA28
• symrcm

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)