椭圆方程中线源的分裂方法
Splitting method for elliptic equations with line sources
AI总结:
本文研究了在3D域Ω中由1D线源Λ作为右端项的椭圆问题的数学结构和数值近似,发现解具有各向异性正则性,并提出一种分裂定理,将解分为一个捕捉奇异性的低正则性项和一个高正则性修正项,从而改进了数值方法的收敛性。
摘要:
在本文中,我们研究了在(3D)域Ω中由(1D)线源Λ作为右端项的椭圆问题的数学结构和数值近似。此类问题的分析和近似通常是非标准的,因为线源会导致解出现奇异性。我们的主要结果是一个解的分裂定理;我们证明了解可以被分解为一个显式、低正则性项,捕捉奇异性,以及一个高正则性修正项w,它是某种合适椭圆方程的解。分裂定理描述了解的数学结构;特别是,我们发现解在Λ邻域内不属于H¹,但具有平行于Λ的分段H²正则性。该分裂定理可以进一步用于提出一种数值方法,其中解通过其修正函数w来近似。这种方法有几种好处。首先,它将问题转化为一个具有3D右端项属于L²的3D椭圆问题,对于此类问题,离散化和求解器 readily available。其次,它使数值近似独立于Λ的离散化;第三,它改进了数值方法的近似性质。本文考虑了Galerkin有限元方法,并证明了奇异性减去后,可以在均匀网格上恢复最优收敛率,即不需要在每个线段周围细化网格。本文提出的数值方法因此适合于应用中包含大量线段的情况。我们通过处理一个数据集(包含约3000个线段)来说明,该数据集描述了大脑的血管系统。
英文摘要:
In this paper, we study the mathematical structure and numerical approximation of elliptic problems posed in a (3D) domain $Ω$ when the right-hand side is a (1D) line source $Λ$. The analysis and approximation of such problems is known to be non-standard as the line source causes the solution to be singular. Our main result is a splitting theorem for the solution; we show that the solution admits a split into an explicit, low regularity term capturing the singularity, and a high-regularity correction term $w$ being the solution of a suitable elliptic equation. The splitting theorem states the mathematical structure of the solution; in particular, we find that the solution has anisotropic regularity. More precisely, the solution fails to belong to $H^1$ in the neighbourhood of $Λ$, but exhibits piecewise $H^2$-regularity parallel to $Λ$. The splitting theorem can further be used to formulate a numerical method in which the solution is approximated via its correction function $w$. This approach has several benefits. Firstly, it recasts the problem as a 3D elliptic problem with a 3D right-hand side belonging to $L^2$, a problem for which the discretizations and solvers are readily available. Secondly, it makes the numerical approximation independent of the discretization of $Λ$; thirdly, it improves the approximation properties of the numerical method. We consider here the Galerkin finite element method, and show that the singularity subtraction then recovers optimal convergence rates on uniform meshes, i.e., without needing to refine the mesh around each line segment. The numerical method presented in this paper is therefore well-suited for applications involving a large number of line segments. We illustrate this by treating a dataset (consisting of $\sim 3000$ line segments) describing the vascular system of the brain.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。