The behavior of the QR-factorization algorithm with column pivoting

DOI10.1016/S0893-9659(97)00098-0zbMath0886.65025OpenAlexW1978627407MaRDI QIDQ1375836

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 selectionpivoting strategycolumn pivotingQR-factorization

Mathematics Subject Classification ID

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

Cites Work

• Rang revealing QR factorizations
• Inertia characteristics of self-adjoint matrix polynomials
• Rank and null space calculations using matrix decomposition without column interchanges
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• Unnamed Item
• Unnamed Item

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