Strict lower bounds with separation of sources of error in non-overlapping domain decomposition methods - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal for Numerical Methods in Engineering Année : 2016

Strict lower bounds with separation of sources of error in non-overlapping domain decomposition methods

Résumé

This article deals with the computation of guaranteed lower bounds of the error in the framework of finite element (FE) and domain decomposition (DD) methods. In addition to a fully parallel computation, the proposed lower bounds separate the algebraic error (due to the use of a DD iterative solver) from the discretization error (due to the FE), which enables the steering of the iterative solver by the discretization error. These lower bounds are also used to improve the goal-oriented error estimation in a substructured context. Assessments on 2D static linear mechanic problems illustrate the relevance of the separation of sources of error and the lower bounds' independence from the substructuring. We also steer the iterative solver by an objective of precision on a quantity of interest. This strategy consists in a sequence of solvings and takes advantage of adaptive remeshing and recycling of search directions.
Fichier principal
Vignette du fichier
nme_VR.pdf (390.4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01332674 , version 1 (16-06-2016)

Licence

Paternité

Identifiants

Citer

Valentine Rey, Pierre Gosselet, Christian Rey. Strict lower bounds with separation of sources of error in non-overlapping domain decomposition methods. International Journal for Numerical Methods in Engineering, 2016, ⟨10.1002/nme.5244⟩. ⟨hal-01332674⟩
378 Consultations
77 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More