A refined subspace iteration algorithm for large sparse eigenproblems
From MaRDI portal
Publication:1964385
DOI10.1016/S0168-9274(99)00008-2zbMath0939.65057OpenAlexW2030827135MaRDI QIDQ1964385
Publication date: 19 June 2000
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-9274(99)00008-2
numerical exampleseigenvalueseigenvectorspower methodlarge sparse matricessubspace iterationrefined algorithms
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items
A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems ⋮ A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems ⋮ On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems ⋮ A new shift strategy for the implicitly restarted refined harmonic Lanczos method ⋮ On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems ⋮ A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems. ⋮ Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems ⋮ A refined Jacobi-Davidson method and its correction equation ⋮ The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors ⋮ Residuals of refined projection methods for large matrix eigenproblems ⋮ Using cross-product matrices to compute the SVD ⋮ On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems ⋮ Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems ⋮ An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems ⋮ Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm ⋮ The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices ⋮ A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm ⋮ A Hessenberg-type algorithm for computing PageRank problems
Uses Software
