Fast estimation of discretization error for FE problems solved by domain decomposition
arXiv:1208.6385 · doi:10.1016/j.cma.2010.07.002
Abstract
This paper presents a strategy for a posteriori error estimation for substructured problems solved by non-overlapping domain decomposition methods. We focus on global estimates of the discretization error obtained through the error in constitutive relation for linear mechanical problems. Our method allows to compute error estimate in a fully parallel way for both primal (BDD) and dual (FETI) approaches of non-overlapping domain decomposition whatever the state (converged or not) of the associated iterative solver. Results obtained on an academic problem show that the strategy we propose is efficient in the sense that correct estimation is obtained with fully parallel computations; they also indicate that the estimation of the discretization error reaches sufficient precision in very few iterations of the domain decomposition solver, which enables to consider highly effective adaptive computational strategies.
References in corpus (2)
Cited by in corpus (7)
- A strict error bound with separated contributions of the discretization and of the iterative solver in non-overlapping domain decomposition methods
- A new impedance accounting for short and long range effects in mixed substructured formulations of nonlinear problems
- Substructured formulations of nonlinear structure problems - influence of the interface condition
- An enhanced method with local energy minimization for the robust a posteriori construction of equilibrated stress fields in finite element analyses
- Study of the strong prolongation equation for the construction of statically admissible stress fields: implementation and optimization
- Strict lower bounds with separation of sources of error in non-overlapping domain decomposition methods
- Strict bounding of quantities of interest in computations based on domain decomposition