arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.12008math.NAcs.NAmath.AP
收藏

无网格数值方法用于拉普拉斯算子带势函数的狄利克雷本征对

Mesh-free numerical method for Dirichlet eigenpairs of the Laplacian with potential

“Simion Stoilow” Mathematical Institute of the Romanian Academy(罗马尼亚科学院西奥尼·斯托伊洛瓦数学研究所)

Dragoş Manea

AI总结:

本文提出一种无网格方法用于计算带径向势函数的拉普拉斯算子的狄利克雷本征对,通过极坐标转换和傅里叶展开,结合有限元法求解常微分方程,实现高效数值近似。

摘要:

本文关注于在简单连通的$C^2$有界域$Ω\subset \mathbb{R}^2$上算子$-Δ+ V$的$L^2$狄利克雷本征对的数值近似,其中$V$是一个径向势函数。我们提出了一种受拉普拉斯算子(即$V=0$)的特定解方法启发的无网格方法。将此方法扩展到一般的$C^1$径向势函数存在挑战,因为缺乏类似于贝塞尔函数的显式基函数。为克服这一困难,我们考虑在包含$Ω$的球体上解方程$-Δu + V u = λu$,对于一组形成所求特征值区间细分割的$λ$值,不施加边界条件。通过将问题转换为极坐标并应用关于角变量的傅里叶展开,我们得到一组解耦的常微分方程。这些方程通过一维有限元法进行数值求解,得到一组解方程$-Δu + V u = λu$的基函数,这些基函数在球体上解方程且与域$Ω$无关。然后通过在$\partial Ω$上最小化基函数的边界值,并识别那些计算得到的最小值足够小的$λ$值来近似狄利克雷特征值。所提出的方法相比标准有限元方法具有更高的内存效率。

英文摘要:

This paper is concerned with the numerical approximation of the $L^2$ Dirichlet eigenpairs of the operator $-Δ+ V$ on a simply connected $C^2$ bounded domain $Ω\subset \mathbb{R}^2$ containing the origin, where $V$ is a radial potential. We propose a mesh-free method inspired by the Method of Particular Solutions for the Laplacian (i.e. $V=0$). Extending this approach to general $C^1$ radial potentials is challenging due to the lack of explicit basis functions analogous to Bessel functions. To overcome this difficulty, we consider the equation $-Δu + V u = λu$ on a ball containing $Ω$, without imposing boundary conditions, for a collection of values $λ$ forming a fine discretisation of the interval in which eigenvalues are sought. By rewriting the problem in polar coordinates and applying a Fourier expansion with respect to the angular variable, we obtain a decoupled system of ordinary differential equations. These equations are solved numerically using a one-dimensional Finite Element Method, yielding a family of basis functions that are solutions of the equation $-Δu + V u = λu$ on the ball and are independent of the domain $Ω$. Dirichlet eigenvalues of $-Δ+ V$ are then approximated by minimising the boundary values on $\partial Ω$ among linear combinations of the basis functions and identifying those values of $λ$ for which the computed minimum is sufficiently small. The proposed method is highly memory-efficient compared to the standard Finite Element approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑