Equivalent operator preconditioning for elliptic problems

The numerical solution of linear elliptic partial differential equations most often involves a finite element or finite difference discretization. To preserve sparsity, the arising system is normally solved using an iterative solution method, commonly a preconditioned conjugate gradient method. Prec...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Numerical algorithms 2009-03, Vol.50 (3), p.297-380
Hauptverfasser: Axelsson, O., Karátson, J.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The numerical solution of linear elliptic partial differential equations most often involves a finite element or finite difference discretization. To preserve sparsity, the arising system is normally solved using an iterative solution method, commonly a preconditioned conjugate gradient method. Preconditioning is a crucial part of such a solution process. In order to enable the solution of very large-scale systems, it is desirable that the total computational cost will be of optimal order, i.e. proportional to the degrees of freedom of the approximation used, which also induces mesh independent convergence of the iteration. This paper surveys the equivalent operator approach, which has proven to provide an efficient general framework to construct such preconditioners. Hereby one first approximates the given differential operator by some simpler differential operator, and then chooses as preconditioner the discretization of this operator for the same mesh. In this survey we give a uniform presentation of this approach, including theoretical foundation and several practically important applications for both symmetric and nonsymmetric equations and systems, and some nonlinear examples in the context of Newton linearization.
ISSN:1017-1398
1572-9265
1572-9265
DOI:10.1007/s11075-008-9233-4