An equilibrated fluxes approach to the certified descent algorithm for shape optimization using conforming finite element and discontinuous Galerkin discretizations

From MaRDI portal
Publication:1747641

DOI10.1007/S10915-017-0545-1zbMATH Open1388.49046arXiv1611.03391OpenAlexW3106307320MaRDI QIDQ1747641FDOQ1747641


Authors: Matteo Giacomini Edit this on Wikidata


Publication date: 26 April 2018

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Abstract: The certified descent algorithm (CDA) is a gradient-based method for shape optimization which certifies that the direction computed using the shape gradient is a genuine descent direction for the objective functional under analysis. It relies on the computation of an upper bound of the error introduced by the finite element approximation of the shape gradient. In this paper, we present a goal-oriented error estimator which depends solely on local quantities and is fully-computable. By means of the equilibrated fluxes approach, we construct a unified strategy valid for both conforming finite element approximations and discontinuous Galerkin discretizations. The new variant of the CDA is tested on the inverse identification problem of electrical impedance tomography: both its ability to identify a genuine descent direction at each iteration and its reliable stopping criterion are confirmed.


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




Recommendations




Cites Work


Cited In (6)

Uses Software





This page was built for publication: An equilibrated fluxes approach to the certified descent algorithm for shape optimization using conforming finite element and discontinuous Galerkin discretizations

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