Bounding the Subspaces from Rank Revealing Two-Sided Orthogonal Decompositions
From MaRDI portal
Recommendations
Cited in
(13)- An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition
- An efficient rank detection procedure for modifying the ULV decomposition
- An algorithm and stability theory for downdating the ULV decomposition
- A note on the scaled total least squares problem
- An efficient algorithm for rank and subspace tracking
- The application of rank revealing two-sided orthogonal decompositions
- Modifiable low-rank approximation to a matrix
- Singular value decomposition approximation via Kronecker summations for imaging applications
- scientific article; zbMATH DE number 782071 (Why is no real title available?)
- Computational kinematics for robotic manipulators: Jacobian problems
- Subspaces analysis for random projection UTV framework
- RankRev: a Matlab package for computing the numerical rank and updating/downdating
- Automatic stopping rule for iterative methods in discrete ill-posed problems
This page was built for publication: Bounding the Subspaces from Rank Revealing Two-Sided Orthogonal Decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4842562)