arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2108.11552math.NAcs.NAmath.OC
收藏

任意区域上Dirichlet分拆的一个有效的无条件稳定方法

An efficient unconditionally stable method for Dirichlet partitions in arbitrary domains

Dong Wang

摘要:

定义域的Dirichlet $k$ -划分是$k$成对不相交开子集的集合,使得它们的第一Laplace-Dirichlet特征值之和最小。本文通过引入区域的辅助指示函数,提出了一种新的松弛方法,并发展了一种简单有效的扩散生成方法来计算任意区域的Dirichlet $k$ -划分.该方法仅交替三个步骤:1. convolution,2.阈值化,以及3.投影该方法简单,易于实现,对初始猜测不敏感,并且可以有效地应用于任意区域,无需任何特殊的离散化。在每次迭代中,计算复杂性在计算域的离散化中是线性的。此外,我们从理论上证明了该方法的能量衰减性质。实验结果表明,该算法具有逼近精度高、效率高和无条件稳定等优点。我们将所提出的算法应用于二维和三维平面环面,三角形,正方形,五边形,六边形,圆盘,三折星,五折星,立方体,球,四面体域计算Dirichlet $k$ -分区为不同的$k$,以显示所提出的方法的有效性。与已有的计算时间相比,该方法实现了数百倍的加速.

英文摘要:

A Dirichlet $k$-partition of a domain is a collection of $k$ pairwise disjoint open subsets such that the sum of their first Laplace--Dirichlet eigenvalues is minimal. In this paper, we propose a new relaxation of the problem by introducing auxiliary indicator functions of domains and develop a simple and efficient diffusion generated method to compute Dirichlet $k$-partitions for arbitrary domains. The method only alternates three steps: 1. convolution, 2. thresholding, and 3. projection. The method is simple, easy to implement, insensitive to initial guesses and can be effectively applied to arbitrary domains without any special discretization. At each iteration, the computational complexity is linear in the discretization of the computational domain. Moreover, we theoretically prove the energy decaying property of the method. Experiments are performed to show the accuracy of approximation, efficiency and unconditional stability of the algorithm. We apply the proposed algorithms on both 2- and 3-dimensional flat tori, triangle, square, pentagon, hexagon, disk, three-fold star, five-fold star, cube, ball, and tetrahedron domains to compute Dirichlet $k$-partitions for different $k$ to show the effectiveness of the proposed method. Compared to previous work with reported computational time, the proposed method achieves hundreds of times acceleration.

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

↑