An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
From MaRDI portal
Publication:2376857
DOI10.1007/s10543-012-0409-xzbMath1269.65038OpenAlexW1988776183MaRDI QIDQ2376857
Publication date: 26 June 2013
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-012-0409-x
numerical examplesiterative methodLeja pointspartial singular value decompositionlarge-scale computationextreme singular valueimplicitly restarted block Lanczos bidiagonalizationinterior singular value
Related Items (21)
Adaptive cross approximation for ill-posed problems ⋮ On the computation of a truncated SVD of a large linear discrete ill-posed problem ⋮ A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices ⋮ An implicit filter for rational Krylov using core transformations ⋮ Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem ⋮ An augmented LSQR method ⋮ Inverse subspace problems with applications ⋮ A new framework for implicit restarting of the Krylov-Schur algorithm ⋮ A compact heart iteration for low-rank approximations of large matrices ⋮ GCV for Tikhonov regularization by partial SVD ⋮ Hybrid iterative refined restarted Lanczos bidiagonalization methods ⋮ A survey of subspace recycling iterative methods ⋮ The minimal-norm Gauss-Newton method and some of its regularized variants ⋮ Computing the smallest singular triplets of a large matrix ⋮ Fast computation of convolution operations via low-rank approximation ⋮ Analysis of directed networks via partial singular value decomposition and Gauss quadrature ⋮ On the Lanczos and Golub–Kahan reduction methods applied to discrete ill‐posed problems ⋮ A cross-product approach for low-rank approximations of large matrices ⋮ A DEIM Induced CUR Factorization ⋮ PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations ⋮ On computing the minimum singular value of a tensor sum
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Krylov-Schur approach to the truncated SVD
- A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
- Restarted block Lanczos bidiagonalization methods
- Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling
- Fast Leja points
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- An implicit shift bidiagonalization algorithm for ill-posed systems
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Partial singular value decomposition algorithm
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- A Jacobi--Davidson Type SVD Method
- The university of Florida sparse matrix collection
- A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
- Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- A set of level 3 basic linear algebra subprograms
- ARPACK Users' Guide
- IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Dealing with linear dependence during the iterations of the restarted block Lanczos methods
This page was built for publication: An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
