Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
From MaRDI portal
Recommendations
- Extended Lanczos bidiagonalization algorithm for low rank approximation and its applications
- An implicitly restarted bidiagonal Lanczos method for large-scale singular value problems
- Fast low rank approximations of matrices and tensors
- A block bidiagonalization method for fixed-accuracy low-rank matrix approximation
- A Schur Method for Low-Rank Matrix Approximation
Cited in
(58)- The joint bidiagonalization process with partial reorthogonalization
- Thick-restarted joint Lanczos bidiagonalization for the GSVD
- Randomized approaches to accelerate MCMC algorithms for Bayesian inverse problems
- Partition of unity interpolation using stable kernel-based techniques
- The minimal-norm Gauss-Newton method and some of its regularized variants
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature
- Fast solvers for two-dimensional fractional diffusion equations using rank structured matrices
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- A block bidiagonalization method for fixed-accuracy low-rank matrix approximation
- A Krylov-Schur approach to the truncated SVD
- Refined and refined harmonic Jacobi-Davidson methods for computing several GSVD components of a large regular matrix pair
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- Locating coalescing singular values of large two-parameter matrices
- Updating approximate principal components with applications to template tracking
- Low rank approximation. Algorithms, implementation, applications
- Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation
- A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
- A compact heart iteration for low-rank approximations of large matrices
- Approximating the leading singular triplets of a large matrix function
- Extended Lanczos bidiagonalization algorithm for low rank approximation and its applications
- Low rank update of singular values
- Matrix completion via minimizing an approximate rank
- Unfoldings and the rank-one approximation of the tensor
- Matrix-free Krylov iteration for implicit convolution of numerically low-rank data
- The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
- Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
- A new stable bidiagonal reduction algorithm
- Low-rank approximation algorithms for matrix completion with random sampling
- Enlarged GKB and RSVD for KP approximations illustrated for mixed precision _1 image restoration
- Lanczos bidiagonalization: a fast start for nonnegative matrix factorization
- Low rank approximation of the symmetric positive semidefinite matrix
- On inner iterations of Jacobi-Davidson type methods for large SVD computations
- A cross-product approach for low-rank approximations of large matrices
- Structured low rank approximation
- Lanczos method for large-scale quaternion singular value decomposition
- Fast ESPRIT algorithms based on partial singular value decompositions
- Optimal approximation of a large matrix by a sum of projected linear mappings on prescribed subspaces
- Recompression of Hadamard Products of Tensors in Tucker Format
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- New estimates for the recursive low-rank truncation of block-structured matrices
- Restarted block Lanczos bidiagonalization methods
- A Lanczos bidiagonalization algorithm for Hankel matrices
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Literature survey on low rank approximation of matrices
- Harmonic multi-symplectic Lanczos algorithm for quaternion singular triplets
- Wavelet-based resolvent analysis of non-stationary flows
- Efficient algorithms for eigensystem realization using randomized SVD
- On the low-rank approximation arising in the generalized Karhunen-Loeve transform
- An augmented LSQR method
- Backward error analysis of the Lanczos bidiagonalization with reorthogonalization
- A Golub-Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices
- Generalizing the SVD of a matrix under nonstandard inner product and its applications to linear ill-posed problems
- Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
- Efficient Marginalization-Based MCMC Methods for Hierarchical Bayesian Inverse Problems
- Matrices with hierarchical low-rank structures
- Hm-toolbox: MATLAB software for HODLR and HSS matrices
This page was built for publication: Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509831)
