B. Endtmayer

B. Endtmayer, U. Langer, T. Wick

In this work, we further develop multigoal-oriented a posteriori error estimation with two objectives in mind. First, we formulate goal-oriented mesh adaptivity for multiple functionals of interest for nonlinear problems in which both the Partial Differential Equation (PDE) and the goal functionals may be nonlinear. Our method is based on a posteriori error estimates in which the adjoint problem is used and a partition-of-unity is employed for the error localization that allows us to formulate the error estimator in the weak form.We provide a careful derivation of the primal and adjoint parts of the error estimator. The second objective is concerned with balancing the nonlinear iteration error with the discretization error yielding adaptive stopping rules for Newton's method. Our techniques are substantiated with several numerical examples including scalar PDEs and PDE systems, geometric singularities, and both nonlinear PDEs and nonlinear goal functionals. In these tests, up to six goal functionals are simultaneously controlled.

A. Cesarano, B. Endtmayer, P. Gangl

First order shape optimization methods, in general, require a large number of iterations until they reach a locally optimal design. While higher order methods can significantly reduce the number of iterations, they exhibit only local convergence properties, necessitating a sufficiently close initial guess. In this work, we present an unregularized shape-Newton method and combine shape optimization with homotopy (or continuation) methods in order to allow for the use of higher order methods even if the initial design is far from a solution. The idea of homotopy methods is to continuously connect the problem of interest with a simpler problem and to follow the corresponding solution path by a predictor-corrector scheme. We use a shape-Newton method as a corrector and arbitrary order shape derivatives for the predictor. Moreover, we apply homotopy methods also to the case of multi-objective shape optimization to efficiently obtain well-distributed points on a Pareto front. Finally, our results are substantiated with a set of numerical experiments.