The open archive for STFC research publications

Full Record Details

Persistent URL http://purl.org/net/epubs/work/53475
Record Status Checked
Record Id 53475
Abstract We address the question of convergence of practical adaptive inite element solvers for symmetric elliptic problems, in the case where the resulting linear systems on each level of the algorithm are solved approximately. In particular, we show that if a particular smallness criterion (involving residuals of the linear solver and the a-posteriori bounds used in the adaptive finite element algorithm) is satisfied, then the adaptive algorithm satisfies a contraction property between two consecutive levels of refinement. This generalises the current convergence analyses of adaptive algorithms for elliptic problems whereby the resulting linear systems are assumed to be solved exactly. Moreover, based on known and new results for the estimation of the residual of the conjugate gradient method, we show that the smallness criterion gives rise to a practical stopping criterion for the iterations of the linear solver, which guarantees that the (inexact) adaptive algorithm converges. A series of numerical experiments highlights the practicality of the theoretical developments.
Organisation CSE-NAG , STFC , SCI-COMP
Keywords stopping criteria , Adaptative finite-element method , Engineering , Conjugate gradient method
Related record(s):
Language English (EN)
Type Details URI(s) Local file(s) Year
Journal Article SIAM J Sci Comput (2013). iAFEM6final.pdf 2013
Journal Article SIAM J. SCI. COMPUT. doi:10.1137/120867421 2013
Showing record 1 of 1
Science and Technology Facilities Council Switchboard: 01793 442000