Three domain decomposition methods for saddle point problems are introduced and compared. The first two are block-diagonal and block-triangular preconditioners with diagonal blocks approximated by an overlapping Schwarz technique with positive definite local and coarse problems. The third is an overlapping Schwarz preconditioner based on indefinite local and coarse problems. Numerical experiments show that while all three methods are numerically scalable, the last method is almost always the most efficient.
A comparison of overlapping Schwarz methods and block preconditioners for saddle point problems / A. Klawonn, L.F. Pavarino. - In: NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS. - ISSN 1070-5325. - 7:1(2000), pp. 1-25. [10.1002/(SICI)1099-1506(200001/02)7:1<1::AID-NLA183>3.3.CO;2-A]
A comparison of overlapping Schwarz methods and block preconditioners for saddle point problems
L.F. PavarinoUltimo
2000
Abstract
Three domain decomposition methods for saddle point problems are introduced and compared. The first two are block-diagonal and block-triangular preconditioners with diagonal blocks approximated by an overlapping Schwarz technique with positive definite local and coarse problems. The third is an overlapping Schwarz preconditioner based on indefinite local and coarse problems. Numerical experiments show that while all three methods are numerically scalable, the last method is almost always the most efficient.File | Dimensione | Formato | |
---|---|---|---|
(SICI)1099-1506(200001_02)7_1_1__AID-NLA183_3.0.CO;2-J.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
213.54 kB
Formato
Adobe PDF
|
213.54 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.