Variable additive preconditioning procedures

DOI10.1007/S006070050016MaRDI QIDQ1293472zbMATH OpenOpenAlexFDO

Authors Michael Jung, Sergei V. Nepomnyaschikh

Publication date 2 March 2000

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s006070050016

zbMATH Keywords

additive Schwarz methodsalgorithmsconjugate gradient methodsdomain decompositionfinite elementsiterative methodslarge scale linear problemsoptimal scaling factorsPoisson equationpreconditioned operators

Mathematics Subject Classification ID

Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Review text

The authors propose four new (conjugate) gradient-like algorithms, in order to solve large scale linear problems with a symmetric positive definite matrix. Their common features are that all of them are based on additive symmetric positive definite preconditioners and that the parameter coefficients in the linear combination producing the inverse of the preconditioner vary at each iteration. This variation is determined by solving a minimization problem. For all the algorithms it is proved that they converge at least as fast as the Richardson iterative method with the corresponding additive preconditioner with optimal scaling factors. The algorithms are numerically tested with the Poisson equation and with a magnetic field problem, using finite element discretizations. The results are compared with those obtained by applying the preconditioned conjugate gradient (PCG) method. For all the methods, the additive preconditioners are produced by a non-overlapping domain decomposition. From the comparison it follows that two of the algorithms have a similar computational cost to that of PCG, when PCG is applied with optimal factors, excluding the cost of obtainig them. If standard factors are used in the PCG method, then those two methods produce uniformly better results than PCG, for grids with the number of nodes varying from the few hundreds to the hundreds of thousands. An open problem regarding a low cost implementation of an optimization problem is stated, whose satisfactory solution would increase the interest that the present algorithms deserve.

Recommendations

• The preconditioned variational methods for solving large linear systems
• A Multipreconditioned Conjugate Gradient Algorithm
• scientific article; zbMATH DE number 3992788
• An adaptive multipreconditioned conjugate gradient algorithm
• scientific article; zbMATH DE number 4172249

Cited in

(6)

• A domain decomposition preconditioner for \(p\)-FEM discretizations of two-dimensional elliptic problems
• Integration of \(hp\)-adaptivity and a two-grid solver for elliptic problems
• Optimal scaling parameters for sparse grid discretizations.
• scientific article; zbMATH DE number 440634 (Why is no real title available?)
• scientific article; zbMATH DE number 3992788 (Why is no real title available?)
• An adaptive multipreconditioned conjugate gradient algorithm

This page was built for publication: Variable additive preconditioning procedures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293472)