Computing rank-revealing QR factorizations of dense matrices
DOI10.1145/290200.287637zbMath0932.65033OpenAlexW2007266146WikidataQ113310190 ScholiaQ113310190MaRDI QIDQ4256912
Christian H. Bischof, Gregorio Quintana-Ortí
Publication date: 23 September 1999
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/290200.287637
performancealgorithmsnumerical examplesdense matricescondition estimationpivoting strategyblock algorithmGivens updatingrank-revealing factorizations
Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (27)
Uses Software
This page was built for publication: Computing rank-revealing QR factorizations of dense matrices