Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
From MaRDI portal
Publication:2706278
DOI10.1137/S0895479898334605zbMath0969.65030OpenAlexW1964217357WikidataQ56659519 ScholiaQ56659519MaRDI QIDQ2706278
Publication date: 19 March 2001
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479898334605
numerical experimentsLanczos methodRitz vectorspartial reorthogonalizationlarge symmetric eigenvalue problemsexplicit restart
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)
Related Items
Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem, A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity, A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices, A framework of the harmonic Arnoldi method for evaluating \(\varphi\)-functions with applications to exponential integrators, A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems, An implicitly restarted block Lanczos bidiagonalization method using Leja shifts, An invert-free Arnoldi method for computing interior eigenpairs of large matrices, A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices, Computational aspects of the stochastic finite element method, Correlations in sequences of generalized eigenproblems arising in density functional theory, Restarted block Lanczos bidiagonalization methods, An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank, A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems, RP-LGMC: rating prediction based on local and global information with matrix clustering, A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems, Preconditioning bandgap eigenvalue problems in three-dimensional photonic crystals simulations, Refined isogeometric analysis of quadratic eigenvalue problems, Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem, PairDiag: an exact diagonalization program for solving general pairing Hamiltonians, A compact heart iteration for low-rank approximations of large matrices, Limited‐memory polynomial methods for large‐scale matrix functions, Hybrid iterative refined restarted Lanczos bidiagonalization methods, A fast diagonal distance metric learning approach for large-scale datasets, Krylov-Aware Stochastic Trace Estimation, Bootstrapped block Lanczos for large-dimension eigenvalue problems, A Krylov-Schur approach to the truncated SVD, Thick-restarted joint Lanczos bidiagonalization for the GSVD, A variant of the Power-Arnoldi algorithm for computing PageRank, PairDiagSph: generalization of the exact pairing diagonalization program for spherical systems, Deflated and restarted Krylov subspace methods for Sylvester tensor equations, A discrete geometric approach to solving time independent Schrödinger equation, A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems, Strategies for spectrum slicing based on restarted Lanczos methods, The infinite Lanczos method for symmetric nonlinear eigenvalue problems, Numerical solution of linear eigenvalue problems, GMRES algorithms over 35 years, An Inexact Shift-and-Invert Arnoldi Algorithm for Large Non-Hermitian Generalised Toeplitz Eigenproblems, Quantum spin solver near saturation: \(\mathrm{QS}^3\), Computing extremal eigenvalues for three-dimensional photonic crystals with wave vectors near the Brillouin zone center, Computing the smallest singular triplets of a large matrix, Block Krylov-Schur method for large symmetric eigenvalue problems, Fast ESPRIT algorithms based on partial singular value decompositions, Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems, TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems, The \(I= 1\) pion-pion scattering amplitude and timelike pion form factor from \(N_{f}=2+1\) lattice QCD, An inexact Krylov-Schur algorithm for the unitary eigenvalue problem, On a new variant of Arnoldi method for approximation of eigenpairs, Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations, Cucheb: a GPU implementation of the filtered Lanczos procedure, Solving large-scale interior eigenvalue problems to investigate the vibrational properties of the boson peak regime in amorphous materials, Refined isogeometric analysis for generalized Hermitian eigenproblems, Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems, A block Lanczos method for the linear response eigenvalue problem, A Galerkin isogeometric method for Karhunen-Loève approximation of random fields, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, Augmented block Householder Arnoldi method, Deflated GMRES for systems with multiple shifts and multiple right-hand sides, Parallel implementation of the \texttt{MAGPACK} package for the analysis of high-nuclearity spin clusters, GMRES with adaptively deflated restarting and its performance on an electromagnetic cavity problem, Restarted block-GMRES with deflation of eigenvalues, A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices, A thick-restart Lanczos type method for Hermitian \(J\)-symmetric eigenvalue problems, Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems, The numerical rank of Krylov matrices, Restarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problems, Two-Grid and Multiple-Grid Arnoldi for Eigenvalues, Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation, On convergence of iterative projection methods for symmetric eigenvalue problems, Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm, On preconditioned eigensolvers and invert-Lanczos processes, A cross-product approach for low-rank approximations of large matrices, Application of hierarchical matrices for computing the Karhunen-Loève expansion, A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems, The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software, A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices, Feast Eigensolver for Non-Hermitian Problems, Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides, Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides, Polynomial Preconditioned Arnoldi with Stability Control, Subspace Iteration Randomization and Singular Value Problems, Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs, Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems, Computing interior eigenvalues of large sparse symmetric matrices
Uses Software
