A strict error bound with separated contributions of the discretization and of the iterative solver in non-overlapping domain decomposition methods

From MaRDI portal
Publication:460858

DOI10.1016/J.CMA.2013.12.001zbMATH Open1296.65167arXiv1312.4505OpenAlexW1970091858MaRDI QIDQ460858FDOQ460858


Authors: Valentine Rey, Christian Rey, Pierre Gosselet Edit this on Wikidata


Publication date: 9 October 2014

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Abstract: This paper deals with the estimation of the distance between the solution of a static linear mechanic problem and its approximation by the finite element method solved with a non-overlapping domain decomposition method (FETI or BDD). We propose a new strict upper bound of the error which separates the contribution of the iterative solver and the contribution of the discretization. Numerical assessments show that the bound is sharp and enables us to define an objective stopping criterion for the iterative solver


Full work available at URL: https://arxiv.org/abs/1312.4505




Recommendations




Cites Work


Cited In (19)





This page was built for publication: A strict error bound with separated contributions of the discretization and of the iterative solver in non-overlapping domain decomposition methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460858)