On the Use of Structural Zeros in Orthogonal Factorization

DOI10.1137/0911034zbMATH Open0696.65022OpenAlexW2035779306MaRDI QIDQ3474201FDOQ3474201

Authors: Jesse L. Barlow 

Publication date: 1990

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0911034

Recommendations

• THE QZ ORTHOGONAL DECOMPOSITION METHOD
• Perturbation Analyses for the QR Factorization
• Structure-Preserving and Rank-Revealing QR-Factorizations
• Sensitivity analyses for factorizations of sparse or structured matrices
• Error Analysis of the Quasi-Gram--Schmidt Algorithm

zbMATH Keywords

least squaressparsityorthogonal factorizationQR-decompositionrounding errorsstructural zerossymbolic factorizationnumerical nonzeros

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)

Cited In (2)

• Predicting the structure of sparse orthogonal factors
• A sparse counterpart of Reichel and Gragg's package QRUP

Uses Software

• SPARSPAK

This page was built for publication: On the Use of Structural Zeros in Orthogonal Factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474201)