IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
From MaRDI portal
Publication:4442129
DOI10.1137/S1064827501397949zbMath1044.65027OpenAlexW2031913867MaRDI QIDQ4442129
Daniela Calvetti, James Baglama, Lothar Reichel
Publication date: 20 January 2004
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1064827501397949
eigenvectorseigenvalue computationpolynomial accelerationsingular value computationlarge sparse Hermitian matrixblock-Lanczos method
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items
On the computation of a truncated SVD of a large linear discrete ill-posed problem, An implicit filter for rational Krylov using core transformations, An implicitly restarted block Lanczos bidiagonalization method using Leja shifts, Accelerating large partial EVD/SVD calculations by filtered block Davidson methods, Restarted block Lanczos bidiagonalization methods, A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems, A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems, A new framework for implicit restarting of the Krylov-Schur algorithm, A compact heart iteration for low-rank approximations of large matrices, Krylov-Aware Stochastic Trace Estimation, The Lebesgue constants for Leja points are subexponential, A survey of subspace recycling iterative methods, A new shift strategy for the implicitly restarted refined harmonic Lanczos method, Computing the smallest singular triplets of a large matrix, Block Krylov-Schur method for large symmetric eigenvalue problems, Cucheb: a GPU implementation of the filtered Lanczos procedure, Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems, SVD based initialization: A head start for nonnegative matrix factorization, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, Augmented block Householder Arnoldi method, Deflated block Krylov subspace methods for large scale eigenvalue problems, On the Lanczos and Golub–Kahan reduction methods applied to discrete ill‐posed problems, A thick-restart Lanczos type method for Hermitian \(J\)-symmetric eigenvalue problems, On convergence of iterative projection methods for symmetric eigenvalue problems, Shifted extended global Lanczos processes for trace estimation with application to network analysis, A cross-product approach for low-rank approximations of large matrices, irbleigs, Communication in complex networks, A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices, Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems, A SEQUENTIAL SUBSPACE PROJECTION METHOD FOR LINEAR SYMMETRIC EIGENVALUE PROBLEM, Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems, 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, Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems, Computing interior eigenvalues of large sparse symmetric matrices
Uses Software
