Polynomial Preconditioned Arnoldi with Stability Control
From MaRDI portal
Publication:5856683
DOI10.1137/19M1302430zbMath1464.65035arXiv1806.08020OpenAlexW3119186146MaRDI QIDQ5856683
Jennifer Loe, Mark Embree, Ronald B. Morgan
Publication date: 29 March 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.08020
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (4)
Coarsest-level improvements in multigrid for lattice QCD on large-scale computers ⋮ Parallel matrix-free polynomial preconditioners with application to flow simulations in discrete fracture networks ⋮ GMRES algorithms over 35 years ⋮ Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing interior eigenvalues of large matrices
- Newton interpolation at Leja points
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- Harmonic Ritz and Lehmann bounds
- Shift-invert and Cayley transforms for detection of rightmost eigenvalues of nonsymmetric matrices
- 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
- A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems
- The university of Florida sparse matrix collection
- Numerical Methods for Large Eigenvalue Problems
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- Polynomial Preconditioned GMRES and GMRES-DR
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- A Newton basis GMRES implementation
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Convergence of Restarted Krylov Subspaces to Invariant Subspaces
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Any Ritz Value Behavior Is Possible for Arnoldi and for GMRES
- Ritz Value Localization for Non-Hermitian Matrices
- The Arnoldi Eigenvalue Iteration with Exact Shifts Can Fail
- Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
This page was built for publication: Polynomial Preconditioned Arnoldi with Stability Control
