Low-rank revealing \(UTV\) decompositions

DOI10.1023/A:1019254318361zbMath0887.65043MaRDI QIDQ1370338

Per Christian Hansen, Ricardo D. Fierro

Publication date: 11 December 1997

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

numerical examplessingular value decompositionorthogonalizationcomparisonslow-rank matrix\(ULV\) algorithmslow-rank revealing \(UTV\) decomposition

Mathematics Subject Classification ID

Orthogonalization in numerical linear algebra (65F25)

Related Items (13)

Subspace-based noise reduction for speech signals via diagonal and triangular matrix decompositions: survey and analysis ⋮ Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation ⋮ Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection ⋮ Gram-Schmidt orthogonalization: 100 years and more ⋮ Subspaces Analysis for Random Projection UTV Framework ⋮ An efficient randomized QLP algorithm for approximating the singular value decomposition ⋮ Fast QR factorization of Cauchy-like matrices ⋮ RankRev: a Matlab package for computing the numerical rank and updating/downdating ⋮ Block classical Gram–Schmidt-based block updating in low-rank matrix approximation ⋮ UTV ⋮ A total least squares method for Toeplitz systems of equations ⋮ UTV Expansin pack: Special-purpose rank-revealing algorithms ⋮ Subspace Iteration Randomization and Singular Value Problems

This page was built for publication: Low-rank revealing \(UTV\) decompositions