Bounding the Subspaces from Rank Revealing Two-Sided Orthogonal Decompositions

DOI10.1137/S0895479893246005zbMath0831.65044MaRDI QIDQ4842562

James R. Bunch, Ricardo D. Fierro

Publication date: 18 February 1996

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmsnumerical examplessingular value decompositionnumerical rangeerror boundsnumerical rank\(ULV\) decomposition\(URV\) decompositionnumerical nullspacerank revealing two-sided orthogonal decompositions

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Eigenvalues, singular values, and eigenvectors (15A18) Orthogonalization in numerical linear algebra (65F25)

Related Items (10)

An algorithm and stability theory for downdating the ULV decomposition ⋮ Subspaces Analysis for Random Projection UTV Framework ⋮ A note on the scaled total least squares problem ⋮ Singular Value Decomposition Approximation via Kronecker Summations for Imaging Applications ⋮ Modifiable low-rank approximation to a matrix ⋮ Computational kinematics for robotic manipulators: Jacobian problems ⋮ RankRev: a Matlab package for computing the numerical rank and updating/downdating ⋮ An efficient algorithm for rank and subspace tracking ⋮ Automatic stopping rule for iterative methods in discrete ill-posed problems ⋮ An efficient rank detection procedure for modifying the ULV decomposition

This page was built for publication: Bounding the Subspaces from Rank Revealing Two-Sided Orthogonal Decompositions