The behavior of the QR-factorization algorithm with column pivoting

DOI10.1016/S0893-9659(97)00098-0MaRDI QIDQ1375836zbMATH OpenOpenAlexFDO

Authors Hans Engler

Publication date 16 February 1998

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0893-9659(97)00098-0

zbMATH Keywords

performancesubset selectioncolumn pivotingpivoting strategyQR-factorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20)

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 46873 (Why is no real title available?)
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• Inertia characteristics of self-adjoint matrix polynomials
• Rang revealing QR factorizations
• Rank and null space calculations using matrix decomposition without column interchanges

Cited in

(1)

• The row/column pivoting strategy on multicomputers

This page was built for publication: The behavior of the QR-factorization algorithm with column pivoting

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