Stokes-Brinkmann方程建模的反问题的非迭代重建方法
A non-iterative reconstruction method for an inverse problem modeled by a Stokes-Brinkmann equations
AI总结:
针对二维有界域内流体浸没障碍物的重建问题,提出将Stokes-Brinkmann方程建模的反问题转化为拓扑优化问题,基于惩罚技术计算拓扑梯度并通过水平集曲线重建障碍物,验证了方法有效性。
摘要:
本文研究二维情况下有界域$Ω$内流体中浸没障碍物$Ø$的重建问题。假设流体运动由Stokes-Brinkmann方程控制,通过内部测量采用最小二乘法定位障碍物。核心思路是将重建问题重写为拓扑优化问题,证明了该优化问题的存在性与稳定性。为确定障碍物及其大致位置,引入拓扑梯度概念,基于惩罚技术以直接方式计算拓扑梯度,未使用文献中的截断方法,通过拓扑梯度的水平集曲线重建未知障碍物,最后通过数值例子验证了方法的有效性。
英文摘要:
This article is concerned with the reconstruction of obstacle $Ø$ immersed in a fluid flowing in a bounded domain $Ω$ in the two dimensional case. We assume that the fluid motion is governed by the Stokes-Brinkmann equations. We make an internal measurement and then have a least-square approach to locate the obstacle. The idea is to rewrite the reconstruction problem as a topology optimization problem. The existence and the stability of the optimization problem are demonstrated. We use here the concept of the topological gradient in order to determine the obstacle and it's rough location. The topological gradient is computed using a straightforward way based on a penalization technique without the truncation method used in the literature. The unknown obstacle is reconstructed using a level-set curve of the topological gradient. Finally, we make some numerical examples exploring the efficiency of the method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。