Minimax Polynomial Preconditioning for Hermitian Linear Systems

DOI10.1137/0612059zbMath0735.65027OpenAlexW1990373616MaRDI QIDQ3980618

Steven F. Ashby

Publication date: 26 June 1992

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0612059

zbMATH Keywords

condition numberextreme eigenvaluespolynomial preconditioningoptimum parametersadaptive proceduresHermitian indefinite linear systemsHermitian positive definite linear systemsoptimum preconditionertranslated Chebyshev polynomials

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

A numerical study of optimized sparse preconditioners ⋮ The degree of approximation by polynomials on some disjoint intervals in the complex plane ⋮ Preconditioning complex symmetric linear systems ⋮ On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method ⋮ Finite-element-wise domain decomposition iterative solvers with polynomial preconditioning ⋮ A strategy for detecting extreme eigenvalues bounding gaps in the discrete spectrum of self-adjoint operators ⋮ Approximation of \(1/x\) by polynomials on \([-1, -a \cup [a, 1]\)] ⋮ Approximation on disjoint intervals and its applicability to matrix preconditioning ⋮ Proxy-GMRES: Preconditioning via GMRES in Polynomial Space ⋮ A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems