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.035zbMATH Open1125.65032OpenAlexW2018070356MaRDI QIDQ2372934FDOQ2372934
Authors: Gang Wu 
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
Recommendations
- A variant on harmonic Arnoldi method
- The harmonic Arnoldi method for solving the interior multiple eigenproblems
- Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
algorithmsnumerical examplesharmonic Arnoldi methodharmonic Ritz vectorsblock Arnoldi processinterior eigenproblemsmodified harmonic Ritz vectors
Cites Work
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- Title not available (Why is that?)
- Matrix algorithms. Vol. 2: Eigensystems
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- 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
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Restarted block-GMRES with deflation of eigenvalues
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- Sparse matrix test problems
- 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
- Title not available (Why is that?)
- A Large, Sparse, and Indefinite Generalized Eigenvalue Problem from Fluid Mechanics
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- Title not available (Why is that?)
- 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
Cited In (11)
- Generalisation of a quadrilateral duality theorem
- Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
- An invert-free Arnoldi method for computing interior eigenpairs of large matrices
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- On a new variant of Arnoldi method for approximation of eigenpairs
- A new restarting method in the harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix
- Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
- A new computational harmonic projection algorithm for large unsymmetric generalized eigenproblems
- A new shift scheme for the harmonic Arnoldi method
- The harmonic Arnoldi method for solving the interior multiple eigenproblems
- Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem
Uses Software
This page was built for publication: A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372934)
