A refined harmonic Lanczos bidiagonalization for computing smallest singular triplets
From MaRDI portal
Recommendations
- A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- An implicitly restarted Lanczos bidiagonalization method with refined vector
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
Cited in
(8)- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- An implicitly restarted Lanczos bidiagonalization method with refined vector
- A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
- A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- Two refined Lanczos algorithms for computing the largest/smallest singular values and associated singular vectors of a large matrix
This page was built for publication: A refined harmonic Lanczos bidiagonalization for computing smallest singular triplets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5318576)