共形容量的约束最大化
Constrained maximization of conformal capacity
AI总结:
本文研究单位圆盘内固定数量双曲圆盘/线段族的共形容量约束最大化问题,验证了分散现象,并通过快速边界积分方程法与高阶有限元法求解对应拉普拉斯方程Dirichlet问题以计算容量。
摘要:
我们研究由单位圆盘内互不相交的双曲圆盘组成的圆盘族,这些双曲圆盘半径固定、圆心未固定。我们探讨在两种圆心约束下,最大化具有固定圆盘数量的圆盘族共形容量的问题:第一种约束为圆心与原点的距离不超过$R \in(0,1)$;第二种约束为圆心位于单位圆盘某条直径的子线段$[-R,R]$上。我们还研究了用双曲线段替代双曲圆盘的同类圆盘族结构。计算实验表明存在一种分散现象:在这些约束下,圆盘/线段会尽可能靠近单位圆周,同时彼此间尽可能远离。容量的计算可归结为拉普拉斯方程的Dirichlet问题,我们采用两种方法求解:快速边界积分方程法和高阶有限元法。
英文摘要:
We consider constellations of disks which are unions of disjoint hyperbolic disks in the unit disk with fixed radii and unfixed centers. We study the problem of maximizing the conformal capacity of a constellation with a fixed number of disks under constraints on the centers in two cases. In the first case the constraint is that the centers are at most at distance $R \in(0,1)$ from the origin and in the second case it is required that the centers are on the subsegment $[-R,R]$ of a diameter of the unit disk. We study also similar types of constellations with hyperbolic segments instead of the hyperbolic disks. Our computational experiments suggest that a dispersion phenomenon occurs: the disks/segments go as close to the unit circle as possible under these constraints and stay as far as possible from each other. The computation of capacity reduces to the Dirichlet problem for the Laplace equation which we solve using two methods: a fast boundary integral equation method and a high-order finite element method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。