A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
From MaRDI portal
Publication:2372934
DOI10.1016/j.cam.2006.05.035zbMath1125.65032OpenAlexW2018070356MaRDI QIDQ2372934
Publication date: 17 July 2007
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2006.05.035
algorithmsnumerical examplesharmonic Arnoldi methodharmonic Ritz vectorsblock Arnoldi processinterior eigenproblemsmodified harmonic Ritz vectors
Related Items
A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems ⋮ A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix ⋮ Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems ⋮ On a new variant of Arnoldi method for approximation of eigenpairs ⋮ Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem ⋮ Generalisation of a quadrilateral duality theorem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restarted block-GMRES with deflation of eigenvalues
- Computing interior eigenvalues of large matrices
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
- Implementation of a variable block Davidson method with deflation for solving large sparse eigenproblems
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- An adaptive Richardson iteration method for indefinite linear systems
- A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Matrix Algorithms
- Sparse matrix test problems
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- 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 Large, Sparse, and Indefinite Generalized Eigenvalue Problem from Fluid Mechanics
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Harmonic projection methods for large non-symmetric eigenvalue problems
This page was built for publication: A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
