Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the new coupled complex boundary method in shape optimization framework for solving stationary free boundary problems

Published 25 May 2022 in math.OC | (2205.12620v5)

Abstract: We expose here a novel application of the so-called coupled complex boundary method -- first put forward by Cheng et al. (2014) to deal with inverse source problems -- in the framework of shape optimization for solving the exterior Bernoulli problem, a prototypical model of stationary free boundary problems. The idea of the method is to transform the overdetermined problem to a complex boundary value problem with a complex Robin boundary condition coupling the Dirichlet and Neumann boundary conditions on the free boundary. Then, we optimize the cost function constructed by the imaginary part of the solution in the whole domain in order to identify the free boundary. We also prove the existence of the shape derivative of the complex state with respect to the domain. Afterwards, we compute the shape gradient of the cost functional, and characterize its shape Hessian at the optimal domain under a strong, and then a mild regularity assumption on the domain. We then examine the instability of the proposed method by proving the compactness of the latter expression. Also, we devise an iterative algorithm based on a Sobolev gradient scheme via finite element method to solve the minimization problem. Finally, we illustrate the applicability of the method through several numerical examples, both in two and three spatial dimensions.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.