Two-Grid and Multiple-Grid Arnoldi for Eigenvalues
From MaRDI portal
Publication:4691182
DOI10.1137/16M1062260zbMath1401.65039OpenAlexW2897956504MaRDI QIDQ4691182
Publication date: 19 October 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1062260
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing interior eigenvalues of large matrices
- A multilevel variational method for \(Au=\lambda Bu\) on composite grids
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- A Krylov--Schur Algorithm for Large Eigenproblems
- GMRES Convergence for Perturbed Coefficient Matrices, with Application to Approximate Deflation Preconditioning
- Numerical Methods for Large Eigenvalue Problems
- Deflated and Restarted Symmetric Lanczos Methods for Eigenvalues and Linear Equations with Multiple Right-Hand Sides
- Multigrid Methods for Differential Eigenproblems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- A Multigrid Tutorial, Second Edition
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- A two-grid discretization scheme for eigenvalue problems
- Inexact Krylov Subspace Methods for Linear Systems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- GMRES with Deflated Restarting
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Harmonic projection methods for large non-symmetric eigenvalue problems
- A multi-level correction scheme for eigenvalue problems
- The speed of convergence of one iterative process
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Backword error bounds for approximate Krylov subspaces
This page was built for publication: Two-Grid and Multiple-Grid Arnoldi for Eigenvalues
