Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
From MaRDI portal
Publication:4509831
DOI10.1137/S1064827597327309zbMath0962.65038OpenAlexW2017895259MaRDI QIDQ4509831
Publication date: 19 October 2000
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1064827597327309
algorithmnumerical examplessingular value decompositionerror analysisLanczos bidiagonalizationlarge non-square matrix \(A\)low-rank approximation of matrices
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items
The joint bidiagonalization process with partial reorthogonalization, Structured low rank approximation, The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision, Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation, Randomized approaches to accelerate MCMC algorithms for Bayesian inverse problems, An implicitly restarted block Lanczos bidiagonalization method using Leja shifts, The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data, Partition of unity interpolation using stable kernel-based techniques, Restarted block Lanczos bidiagonalization methods, On the low-rank approximation arising in the generalized Karhunen-Loeve transform, An augmented LSQR method, Harmonic multi-symplectic Lanczos algorithm for quaternion singular triplets, hm-toolbox: MATLAB Software for HODLR and HSS Matrices, A Krylov-Schur approach to the truncated SVD, Thick-restarted joint Lanczos bidiagonalization for the GSVD, Recompression of Hadamard Products of Tensors in Tucker Format, Locating coalescing singular values of large two-parameter matrices, Literature survey on low rank approximation of matrices, The minimal-norm Gauss-Newton method and some of its regularized variants, A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices, Matrices with Hierarchical Low-Rank Structures, Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction, Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces, Fast ESPRIT algorithms based on partial singular value decompositions, Analysis of directed networks via partial singular value decomposition and Gauss quadrature, A new stable bidiagonal reduction algorithm, Lanczos method for large-scale quaternion singular value decomposition, An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets, Low rank approximation of the symmetric positive semidefinite matrix, Low-rank approximation algorithms for matrix completion with random sampling, Matrix-free Krylov iteration for implicit convolution of numerically low-rank data, Low rank update of singular values, Unfoldings and the rank-one approximation of the tensor, On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations, A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices, Fast Solvers for Two-Dimensional Fractional Diffusion Equations Using Rank Structured Matrices, Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization, Matrix completion via minimizing an approximate rank, Efficient Marginalization-Based MCMC Methods for Hierarchical Bayesian Inverse Problems, Efficient Algorithms for Eigensystem Realization Using Randomized SVD, Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems, Stable Computation of Generalized Matrix Functions via Polynomial Interpolation, A Block Bidiagonalization Method for Fixed-Accuracy Low-Rank Matrix Approximation, Updating approximate principal components with applications to template tracking
Uses Software
