IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
From MaRDI portal
Recommendations
Cited in
(45)- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
- irbleigs
- An implicit filter for rational Krylov using core transformations
- A new shift strategy for the implicitly restarted refined harmonic Lanczos method
- Cucheb: a GPU implementation of the filtered Lanczos procedure
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- Projective block Lanczos algorithm for dense, Hermitian eigensystems
- A thick-restart Lanczos type method for Hermitian \(J\)-symmetric eigenvalue problems
- Shifted extended global Lanczos processes for trace estimation with application to network analysis
- Communication in complex networks
- A method for computing a few eigenpairs of large generalized eigenvalue problems
- The implicitly restarted multi-symplectic block-Lanczos method for large-scale Hermitian quaternion matrix eigenvalue problem and applications
- Computing interior eigenvalues of large sparse symmetric matrices
- Computing the smallest singular triplets of a large matrix
- A cross-product approach for low-rank approximations of large matrices
- On the computation of a truncated SVD of a large linear discrete ill-posed problem
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- SVD based initialization: A head start for nonnegative matrix factorization
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- The Lebesgue constants for Leja points are subexponential
- A sequential subspace projection method for linear symmetric eigenvalue problem
- Feasible Barzilai-Borwein-like methods for extreme symmetric eigenvalue problems
- A new framework for implicit restarting of the Krylov-Schur algorithm.
- Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
- Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix
- A Golub-Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices
- Algorithm 827
- On the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems.
- A compact heart iteration for low-rank approximations of large matrices
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- Krylov-Aware Stochastic Trace Estimation
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- A survey of subspace recycling iterative methods
- Eigenvalues of quaternion tensors: properties, algorithms and applications
- Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
- EigenWave: an optimal O(N) method for computing eigenvalues and eigenvectors by time-filtering the wave equation
- On convergence of iterative projection methods for symmetric eigenvalue problems
- An implicitly restarted joint bidiagonalization algorithm for large GSVD computations
- Restarted block Lanczos bidiagonalization methods
- Block Krylov-Schur method for large symmetric eigenvalue problems
- Augmented block Householder Arnoldi method
- Deflated block Krylov subspace methods for large scale eigenvalue problems
This page was built for publication: IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4442129)
