Numerical Solution of the Beltrami Equation
R. Michael Porter

TL;DR
This paper introduces an efficient algorithm for solving the Beltrami equation in a planar disk, avoiding singular integral evaluations by using a ring-based approach and conformal mapping corrections.
Contribution
It presents a novel, practical algorithm that constructs piecewise linear mu-conformal mappings and corrects images without singular integral computations.
Findings
Algorithm effectively solves the Beltrami equation numerically.
No singular integrals are evaluated during the process.
Computational complexity is analyzed and demonstrated.
Abstract
An effective algorithm is presented for solving the Beltrami equation fzbar = mu fz in a planar disk. The algorithm involves no evaluation of singular integrals. The strategy, working in concentric rings, is to construct a piecewise linear mu-conformal mapping and then correct the image using a known algorithm for conformal mappings. Numerical examples are provided and the computational complexity is analyzed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic and Geometric Analysis · Mathematical functions and polynomials · Differential Equations and Boundary Problems
