Polynomial Preconditioned GMRES and GMRES-DR
From MaRDI portal
Publication:3447459
DOI10.1137/140968276zbMath1325.65047OpenAlexW2208779871MaRDI QIDQ3447459
Quan Liu, Ronald B. Morgan, Walter Wilcox
Publication date: 30 October 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140968276
Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Related Items
GMRES convergence bounds for eigenvalue problems, Parallel matrix-free polynomial preconditioners with application to flow simulations in discrete fracture networks, Disconnected loop subtraction methods in lattice QCD, GMRES algorithms over 35 years, On the convergence of Krylov methods with low-rank truncations, Preconditioning the Helmholtz equation with the shifted Laplacian and Faber polynomials, Polynomial Preconditioned Arnoldi with Stability Control, On the Optimality of Shifted Laplacian in a Class of Polynomial Preconditioners for the Helmholtz Equation
Cites Work
- Unnamed Item
- Unnamed Item
- On the generation of Krylov subspace bases
- Finite-element-wise domain decomposition iterative solvers with polynomial preconditioning
- An iterative method for the Helmholtz equation
- Yet another polynomial preconditioner for the conjugate gradient algorithm
- Computing interior eigenvalues of large matrices
- On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices
- An optimum iterative method for solving any linear system with a square matrix
- A stable Richardson iteration method for complex linear systems
- Approximating the inverse of a matrix for use in iterative algorithms on vector processors
- Restarted GMRES preconditioned by deflation
- Spectral deflation in Krylov solvers: a theory of coordinate space based methods
- Numerical Methods for Large Eigenvalue Problems
- IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
- Recycling Krylov Subspaces for Sequences of Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
- A Comparison of Adaptive Chebyshev and Least Squares Polynomial Preconditioning for Hermitian Positive Definite Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation
- Adaptively Preconditioned GMRES Algorithms
- A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems
- A Newton basis GMRES implementation
- GMRES with Deflated Restarting
- Eigenvalue translation based preconditioners for the GMRES(k) method
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- A Restarted GMRES Method Augmented with Eigenvectors
- An Iterative Least-Square Method Suitable for Solving Large Sparse Matrices
- A Novel Multigrid Based Preconditioner For Heterogeneous Helmholtz Problems
- Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
