Efficient Polynomial Preconditioning for the Conjugate Gradient Method

DOI10.1137/0911051zbMath0707.65014OpenAlexW2031060827MaRDI QIDQ3489352

No author found.

Publication date: 1990

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

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

zbMATH Keywords

polynomial preconditionersnumerical experimentsfinite elementconjugate gradient methodfinite differenceparallel computersLaplace's equationSSOR preconditioning

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Parallel numerical computation (65Y05) Finite difference methods for boundary value problems involving PDEs (65N06) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items

Dealing with pressure: FEM solution strategies for the pressure in the time-dependent Navier-Stokes equations ⋮ A domain-decomposition message-passing approach to transient viscous incompressible flow using explicit time integration ⋮ Proxy-GMRES: Preconditioning via GMRES in Polynomial Space