Adaptive polynomial preconditioning for Hermitian indefinite linear systems

DOI10.1007/BF01932736zbMath0688.65024MaRDI QIDQ1263933

Thomas A. Manteuffel, Steven F. Ashby, Paul E. Saylor

Publication date: 1989

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

polynomial preconditionersnumerical experimentsefficiencyconjugate gradient methodsextreme eigenvaluesparallel architecturesHermitian indefinite linear systems

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (21)

A numerical study of optimized sparse preconditioners ⋮ A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems ⋮ A short survey on preconditioning techniques for large-scale dense complex linear systems in electromagnetics ⋮ Harmonic projection methods for large non-symmetric eigenvalue problems ⋮ Restarted GMRES preconditioned by deflation ⋮ Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation ⋮ A modified SSOR-like preconditioner for non-Hermitian positive definite matrices ⋮ Parallel ocean general circulation modeling ⋮ A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems ⋮ GMRES and the minimal polynomial ⋮ Efficient iterative solution of constrained finite element analyses ⋮ Proxy-GMRES: Preconditioning via GMRES in Polynomial Space ⋮ Generalisation of a quadrilateral duality theorem ⋮ The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices ⋮ The application of Leja points to Richardson iteration and polynomial preconditioning ⋮ On polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrices ⋮ Yet another polynomial preconditioner for the conjugate gradient algorithm ⋮ Implementation of an adaptive algorithm for Richardson's method ⋮ Computing interior eigenvalues of large matrices ⋮ On the stationary and non stationary extrapolation iterative method ⋮ Preconditioning techniques for large linear systems: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of preconditioned iterative methods for linear systems of algebraic equations
• Leapfrog variants of iterative methods for linear algebraic equations
• Approximating the inverse of a matrix for use in iterative algorithms on vector processors
• Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
• A class of iterative methods for finite element equations
• Parallel elliptic preconditioners: Fourier analysis and performance on the connection machine
• On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
• A Taxonomy for Conjugate Gradient Methods
• Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
• Polynomial Preconditioners for Conjugate Gradient Calculations
• m-Step Preconditioned Conjugate Gradient Methods
• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• Estimates of Eigenvalues for Iterative Methods
• Extremal Polynomials with Application to Richardson Iteration for Indefinite Linear Systems
• Solution of Sparse Indefinite Systems of Linear Equations
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Matrix-Free Methods for Stiff Systems of ODE’s
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Adaptive polynomial preconditioning for Hermitian indefinite linear systems