DeepAI AI Chat
Log In Sign Up

Complete topological asymptotic expansion for L_2 and H^1 tracking-type cost functionals in dimension two and three

11/16/2021
by   Phillip Baumann, et al.
0

In this paper, we study the topological asymptotic expansion of a topology optimisation problem that is constrained by the Poisson equation with the design/shape variable entering through the right hand side. Using an averaged adjoint approach, we give explicit formulas for topological derivatives of arbitrary order for both an L_2 and H^1 tracking-type cost function in both dimension two and three and thereby derive the complete asymptotic expansion. As the asymptotic behaviour of the fundamental solution of the Laplacian differs in dimension two and three, also the derivation of the topological expansion significantly differs in dimension two and three. The complete expansion for the H^1 cost functional directly follows from the analysis of the variation of the state equation. However, the proof of the asymptotics of the L_2 tracking-type cost functional is significantly more involved and, surprisingly, the asymptotic behaviour of the bi-harmonic equation plays a crucial role in our proof.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/07/2022

Asymptotic expansion of an estimator for the Hurst coefficient

Asymptotic expansion is presented for an estimator of the Hurst coeffici...
10/15/2020

On Non Asymptotic Expansion of the MME in the Case of Poisson Observations

The problem of parameter estimation by observations of inhomogeneous Poi...
09/16/2022

Error bounds for the asymptotic expansion of the partition function

Asymptotic study on the partition function p(n) began with the work of H...
12/22/2022

Computing error bounds for asymptotic expansions of regular P-recursive sequences

Over the last several decades, improvements in the fields of analytic co...
12/31/2020

Asymptotic expansion of a variation with anticipative weights

Asymptotic expansion of a variation with anticipative weights is derived...
06/26/2019

The impatient collector

In the coupon collector problem with n items, the collector needs a rand...