arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.7359math.CV
收藏

通过纯线性系统求解Beltrami方程的数值解

Numerical solution of the Beltrami equation via a purely linear system

R. Michael Porter, Hirokazu Shimauchi

AI总结:

本文提出了一种在平面圆盘上通过纯线性系统求解Beltrami方程的有效算法,利用三角剖分和分段线性映射,通过稀疏超定方程组的标准最小二乘法求解,无需奇异积分或迭代过程。

摘要:

本文提出了一种在平面圆盘上求解Beltrami方程df/dz = mu (df/dzbar)的有效算法。圆盘以简单方式进行三角剖分,f由分段线性映射逼近;三角形顶点的像由超定线性方程组定义。(通过对称构造消除了某些看似非线性的边界条件。)该线性系统是稀疏的,其解通过标准最小二乘法获得,因此该算法不涉及奇异积分的计算,也不需要任何迭代过程来获得f的单个逼近。提供了数值示例,包括Fuchsian群的Teichmüller空间中的变形。

英文摘要:

An effective algorithm is presented for solving the Beltrami equation df/dz = mu (df/dzbar) in a planar disk. The disk is triangulated in a simple way and f is approximated by piecewise linear mappings; the images of the vertices of the triangles are defined by an overdetermined system of linear equations. (Certain apparently nonlinear conditions on the boundary are eliminated by means of a symmetry construction.) The linear system is sparse and its solution is obtained by standard least-squares, so the algorithm involves no evaluation of singular integrals nor any iterative procedure for obtaining a single approximation of f. Numerical examples are provided, including a deformation in a Teichmüller space of a Fuchsian group.

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

↑