Least upper bound of truncation error of low-rank matrix approximation algorithm using QR decomposition with pivoting

DOI10.1007/s13160-021-00459-xzbMath1470.65073OpenAlexW3132175442MaRDI QIDQ2231598

Haruka Kawamura, Reiji Suda

Publication date: 30 September 2021

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13160-021-00459-x

zbMATH Keywords

error analysissingular valuesQR decompositionpivoting

Mathematics Subject Classification ID

Miscellaneous inequalities involving matrices (15A45) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• Unnamed Item
• Unnamed Item
• Numerical methods for solving linear least squares problems
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• Solution of linear algebraic systems with rectangular matrices
• A New Selection Operator for the Discrete Empirical Interpolation Method---Improved A Priori Error Bound and Extensions
• Numerical linear algebra in data mining
• Rank-Revealing QR Factorizations and the Singular Value Decomposition
• On Rank-Revealing Factorisations
• Literature survey on low rank approximation of matrices
• Numerical Linear Algebra
• Generalized low rank approximations of matrices

This page was built for publication: Least upper bound of truncation error of low-rank matrix approximation algorithm using QR decomposition with pivoting