Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
DOI10.1080/00207160.2010.489639zbMATH Open1298.65066OpenAlexW1979333447MaRDI QIDQ2995496FDOQ2995496
Authors: Hong-Xiu Zhong, Gang Wu 
Publication date: 21 April 2011
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2010.489639
Recommendations
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem
- The harmonic Arnoldi method for solving the interior multiple eigenproblems
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)
Cites Work
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Templates for the Solution of Algebraic Eigenvalue Problems
- Matrix algorithms. Vol. 2: Eigensystems
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Harmonic projection methods for large non-symmetric eigenvalue problems
- Computing interior eigenvalues of large matrices
- Numerical methods for large eigenvalue problems
- GMRES with Deflated Restarting
- Matrix Krylov subspace methods for linear systems with multiple right-hand sides
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- On Pre-Conditioning of Matrices
- A Power–Arnoldi algorithm for computing PageRank
- Title not available (Why is that?)
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Balancing a matrix for calculation of eigenvalues and eigenvectors
- Restarted weighted full orthogonalization method for shifted linear systems
- Weighted FOM and GMRES for solving nonsymmetric linear systems
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- A note on weighted FOM and GMRES for solving nonsymmetric linear systems
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- Sparse matrix test problems
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
- Balancing sparse matrices for computing eigenvalues
Cited In (7)
- Generalisation of a quadrilateral duality theorem
- Deflated and restarted Krylov subspace methods for Sylvester tensor equations
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- Some observations on weighted GMRES
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
- Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem
- Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations
Uses Software
This page was built for publication: Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995496)
