Bounds on singular values revealed by QR factorizations

DOI10.1023/A:1022395308695zbMath0944.65042OpenAlexW1551417731MaRDI QIDQ1963915

Ching-Tsuan Pan, Ping Tak Peter Tang

Publication date: 24 September 2000

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022395308695

zbMATH Keywords

numerical experimentssingular valuesQR factorizationsrank-revealingcyclic pivoting

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Inequalities involving eigenvalues and eigenvectors (15A42)

Related Items (12)

Strong rank revealing LU factorizations ⋮ Optimal column subset selection for image classification by genetic algorithms ⋮ Column subset selection problem is UG-hard ⋮ Gram-Schmidt orthogonalization: 100 years and more ⋮ Exponential inapproximability of selecting a maximum volume sub-matrix ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ Column subset selection is NP-complete ⋮ Linear-time CUR approximation of BEM matrices ⋮ ALORA: affine low-rank approximations ⋮ Column subset selection via sparse approximation of SVD ⋮ On selecting a maximum volume sub-matrix of a matrix and related problems ⋮ On the existence and computation of rank-revealing LU factorizations

This page was built for publication: Bounds on singular values revealed by QR factorizations