A Jacobi--Davidson type SVD method
From MaRDI portal
Recommendations
Cited in
(40)- A Jacobi-Davidson type method for the generalized singular value problem
- Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix.
- Majorization bounds for SVD
- GCV for Tikhonov regularization by partial SVD
- Accuracy of singular vectors obtained by projection-based SVD methods
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- A model reduction approach for inverse problems with operator valued data
- An efficient, memory-saving approach for the Loewner framework
- Computing several eigenvalues of nonlinear eigenvalue problems by selection
- On the convergence of Krylov methods with low-rank truncations
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Grassmann algorithms for low rank approximation of matrices with missing values
- Probabilistic upper bounds for the matrix two-norm
- A Jacobi-Davidson type method for the product eigenvalue problem
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem
- Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
- A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair
- Block power method for SVD decomposition
- A DEIM induced CUR factorization
- On approximate reduction of multi-port resistor networks
- Low-rank solution of unsteady diffusion equations with stochastic coefficients
- Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
- Probabilistic bounds for the matrix condition number with extended Lanczos bidiagonalization
- New Fast and Accurate Jacobi SVD Algorithm. I
- The Jacobi-Davidson method
- Projected Tikhonov regularization of large-scale discrete ill-posed problems
- A Krylov-Schur approach to the truncated SVD
- Low-rank incremental methods for computing dominant singular subspaces
- Jacobi-Davidson method on low-rank matrix manifolds
- 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
- PRIMME\_SVDS: a high-performance preconditioned SVD solver for accurate large-scale computations
- A smallest singular value method for nonlinear eigenvalue problems
- An Augmented Matrix-Based CJ-FEAST SVDsolver for Computing a Partial Singular Value Decomposition with the Singular Values in a Given Interval
- Randomized block residual steepest descent method with k-means clustering for large sparse linear systems
- Refined and refined harmonic Jacobi-Davidson methods for computing several GSVD components of a large regular matrix pair
- Harmonic, refined and refined harmonic skew-symmetric Lanczos bidiagonalization methods for computing several extreme eigenpairs of a large skew-symmetric matrix
- Restarted block Lanczos bidiagonalization methods
This page was built for publication: A Jacobi--Davidson type SVD method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2780543)
