Computing the smallest singular triplets of a large matrix
From MaRDI portal
Recommendations
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method
- 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 vector
Cites work
- A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
- A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
- A restarted Krylov method with inexact inversions
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- A tuned preconditioner for inexact inverse iteration applied to Hermitian eigenvalue problems
- Adaptive projection subspace dimension for the thick-restart Lanczos method
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Computation of Smallest Eigenvalues using Spectral Schur Complements
- Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Convergence Analysis of Iterative Solvers in Inexact Rayleigh Quotient Iteration
- Fast inexact implicitly restarted Arnoldi method for generalized eigenvalue problems with spectral transformation
- Fast inexact subspace iteration for generalized eigenvalue problems with spectral transformation
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1138094 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Inexact inverse iteration for generalized eigenvalue problems
- Inexact inverse iteration for symmetric matrices
- Inexact inverse subspace iteration for generalized eigenvalue problems
- Inexact Krylov Subspace Methods for Linear Systems
- Inexact Newton Methods
- Inexact Rayleigh quotient-type methods for eigenvalue computations
- Inner and Outer Iterations for the Chebyshev Algorithm
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- Iterative Krylov Methods for Large Linear Systems
- Iterative Solution Methods
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
- Matrix algorithms. Vol. 2: Eigensystems
- Matrix Analysis
- Matrix theory. Basic results and techniques
- Numerical Linear Algebra for High-Performance Computers
- Numerical methods for large eigenvalue problems
- On extremum properties of orthogonal quotients matrices
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Parallel iterative methods for sparse linear systems
- PRIMME: preconditioned iterative multimethod eigensolver -- methods and software description
- PRIMME\_SVDS: a high-performance preconditioned SVD solver for accurate large-scale computations
- Rayleigh quotient iteration and simplified Jacobi-Davidson method with preconditioned iterative solves
- Restarted block Lanczos bidiagonalization methods
- Shift-invert Arnoldi's method with preconditioned iterative solves
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- The effects of inexact solvers in algorithms for symmetric eigenvalue problems
- The Matrix Eigenvalue Problem
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
Cited in
(12)- An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
- Computing interior eigenvalues of large sparse symmetric matrices
- Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method
- On the tripling algorithm for large-scale nonlinear matrix equations with low rank structure
- Approximating dominant singular triplets of large sparse matrices via modified moments
- Irr: An algorithm for computing the smallest singular value of large scale matrices
- A restarted Krylov method with inexact inversions
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
- A Golub-Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices
- A compact heart iteration for low-rank approximations of large matrices
- Lanczos algorithm explained in statistics
- Approximating the leading singular triplets of a large matrix function
Describes a project that uses
Uses Software
This page was built for publication: Computing the smallest singular triplets of a large matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2211056)
