Representation of conformal maps by rational functions
- 22 Downloads
The traditional view in numerical conformal mapping is that once the boundary correspondence function has been found, the map and its inverse can be evaluated by contour integrals. We propose that it is much simpler, and 10–1000 times faster, to represent the maps by rational functions computed by the AAA algorithm. To justify this claim, first we prove a theorem establishing root-exponential convergence of rational approximations near corners in a conformal map, generalizing a result of D. J. Newman in 1964. This leads to the new algorithm for approximating conformal maps of polygons. Then we turn to smooth domains and prove a sequence of four theorems establishing that in any conformal map of the unit circle onto a region with a long and slender part, there must be a singularity or loss of univalence exponentially close to the boundary, and polynomial approximations cannot be accurate unless of exponentially high degree. This motivates the application of the new algorithm to smooth domains, where it is again found to be highly effective.
Mathematics Subject Classification30C30 41A20 65E05
This paper originated in stimulating discussions with Anne Greenbaum and Trevor Caldwell about their computations with the Kerzman–Stein integral equation, and Grady Wright gave key assistance in a Chebfun implementation. The heart of the paper is Schwarz–Christoffel mapping, which is made numerically possible by Toby Driscoll’s marvelous SC Toolbox. Driscoll, and Yuji Nakatsukasa offered helpful advice along the way, and the suggestions of Dmitry Belyaev, Chris Bishop, and Tom DeLillo were crucial for developing the theorems of Sect. 4. Among other things, Belyaev caught an error in an early version of Theorems 2 and 3 and Bishop pointed us to Theorem 6.1 of  and proposed the idea of Theorem 4. Much of this article was written during an extremely enjoyable 2017–2018 sabbatical visit by the second author to the Laboratoire de l’Informatique du Parallélisme at ENS Lyon hosted by Nicolas Brisebarre, Jean-Michel Muller, and Bruno Salvy.
- 1.Ahlfors, L.: Untersuchungen zur Theorie der konformen Abbildung und der ganzen Funktionen, Dr. der Finnischen Literaturges (1930)Google Scholar
- 6.Caldwell, T., Li, K., Greenbaum, A.: Numerical conformal mapping in Chebfun, poster. In: Householder XX Symposium on Numerical Linear Algebra, Blacksburg (2017)Google Scholar
- 7.Computational Methods and Function Theory. Special Issue on Numerical Conformal Mapping, vol. 11, no. 2, pp. 375–787 (2012)Google Scholar
- 11.Driscoll, T.A., Hale, N., Trefethen, L.N. (eds.): Chebfun User’s Guide. Pafnuty Publications, Oxford (2014)Google Scholar
- 13.Ellacott, S.W.: A technique for approximate conformal mapping. In: Handscomb, D.C. (ed.) Multivariable Approximation. Academic Press, London (1978)Google Scholar
- 14.Filip, S., Javeed, A., Trefethen, L.N.: Smooth random functions, random ODEs, and Gaussian pocesses. SIAM Rev. (to appear)Google Scholar
- 32.Reichel, L.: On polynomial approximation in the complex plane with application to conformal mapping. Math. Comput. 44, 425–433 (1985). An earlier technical report version version with additional material appeared as Report TRITA-NA-8102. Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm (1981)Google Scholar