Adaptive Domain Decomposition method for Saddle Point problem in Matrix Form - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

Adaptive Domain Decomposition method for Saddle Point problem in Matrix Form

Résumé

We introduce an adaptive domain decomposition (DD) method for solving saddle point problems defined as a block two by two matrix. The algorithm does not require any knowledge of the constrained space. We assume that all sub matrices are sparse and that the diagonal blocks are the sum of positive semi definite matrices. The latter assumption enables the design of adaptive coarse space for DD methods.
Fichier principal
Vignette du fichier
schurcomplement.pdf (340.38 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02343808 , version 1 (04-11-2019)
hal-02343808 , version 2 (14-11-2019)
hal-02343808 , version 3 (19-03-2020)
hal-02343808 , version 4 (26-04-2021)
hal-02343808 , version 5 (21-12-2021)
hal-02343808 , version 6 (16-11-2022)

Identifiants

Citer

Frédéric Nataf, Pierre-Henri Tournier. Adaptive Domain Decomposition method for Saddle Point problem in Matrix Form. 2019. ⟨hal-02343808v3⟩
287 Consultations
323 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More