Geodesic
Domain decomposition algorithms for first-order system least squares methods
Electronic transactions on numerical analysis, Tome 8 (1999), pp. 1-14.

Voir la notice de l'article provenant de la source Electronic Library of Mathematics

Summary: First-order system least squares methods have been recently proposed and analyzed for second order elliptic equations and systems. They produce symmetric and positive definite discrete systems by using standard finite element spaces which are not required to satisfy the inf-sup condition. In this paper, several domain decomposition algorithms for these first-order least squares methods are studied. Some representative overlapping and substructuring algorithms are considered in their additive and multiplicative variants. The theoretical and numerical results obtained show that the classical convergence bounds (on the iteration operator) for standard Galerkin discretizations are also valid for least squares methods. Therefore, domain decomposition algorithms provide parallel and scalable preconditioners also for least squares discretizations.
Classification : 65N30, 65N55
Keywords: domain decomposition, first-order system least squares 
@article{ETNA_1999__8__a10,
     author = {Pavarino, Luca F.},
     title = {Domain decomposition algorithms for first-order system least squares methods},
     journal = {Electronic transactions on numerical analysis},
     pages = {1--14},
     publisher = {mathdoc},
     volume = {8},
     year = {1999},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ETNA_1999__8__a10/}
}
TY  - JOUR
AU  - Pavarino, Luca F.
TI  - Domain decomposition algorithms for first-order system least squares methods
JO  - Electronic transactions on numerical analysis
PY  - 1999
SP  - 1
EP  - 14
VL  - 8
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ETNA_1999__8__a10/
LA  - en
ID  - ETNA_1999__8__a10
ER  - 
%0 Journal Article
%A Pavarino, Luca F.
%T Domain decomposition algorithms for first-order system least squares methods
%J Electronic transactions on numerical analysis
%D 1999
%P 1-14
%V 8
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ETNA_1999__8__a10/
%G en
%F ETNA_1999__8__a10
Pavarino, Luca F. Domain decomposition algorithms for first-order system least squares methods. Electronic transactions on numerical analysis, Tome 8 (1999), pp. 1-14. http://geodesic.mathdoc.fr/item/ETNA_1999__8__a10/