An interpolating polynomial method for numerical conformal mapping
The author demonstrates the convergence of an algorithm for approximating a normalized conformal mapping \(f=f(z)\) of the unit disk onto a simply connected domain \(D\) with \(0\in D\). It was shown by \textit{R. Wegmann} [J. Comput. Appl. Math. 23, No. 3, 323-352 (1988; Zbl 0644.30004)] that for \(\partial D\) sufficiently smooth and for \(N\) sufficiently large, there is a unique (suitably normalized) polynomial of degree \(N+1\) close to \(f\) which maps the \(2N\)th roots of unity to points of \(\partial D\). Let \(f_N=f_N(z)\) be a polynomial of degree at most \(N\) with \(f_N\approx f\) for a sufficiently large \(N\), where the polynomial \(f_N\), is not uniquely characterized. A suitable polynomial \(f_N\), fixing the origin satisfies \(f_N[\exp(2j\pi i/N)]\in\partial D\), \(j=0,1, \dots, N-1\) and \(f_N\{\exp [(2k-1)\pi i/N]\}\) should be close to \(\partial D\) for \(k=1,2,\dots,N\). The aim of this paper is to approximate such a polynomial \(f_N\) in the following way. Choose distinct points \(w_0,w_1, \dots, w_{N-1}\in \partial D\), set \(\vec w=(w_0,w_1 \dots,w_{N-1})\) and define a polynomial \(P_{\vec w}=P_{\vec w}(z)\) of degree at most \(N\) with \(P_{\vec w}(0)= 0\) and \(P_{\vec w}[\exp(2j \pi i/N)]=w_j\), \(j=0,1, \dots,N-1\). Improve \(\vec w\) in such a manner that the images of the remaining \(2N\)th roots of unity under \(P_{\vec w}\), lie on \(\partial D\) as well. The convergence of this sequence \(\vec w^{(n)}\) seems to be linear as the author shows at four examples. By using the fast Fourier transform (FFT) the iterations for improving \(P_{\vec w}\), become effective with respect to the number of arithmetic operations.
- Discrete Riemann-Hilbert problems, interpolation of simply closed curves, and numerical conformal mapping
- An application of polynomials with smallest deviation from zero with connections to the conformal mapping problem
- Representation of conformal maps by rational functions
- Conformal mapping by the method of alternating projections
- On Polynomial Approximation in the Complex Plane with Application to Conformal Mapping
- Discrete Riemann-Hilbert problems, interpolation of simply closed curves, and numerical conformal mapping
- A fast conformal mapping algorithm with no FFT
- Representation of conformal maps by rational functions
- QCMC: quasi-conformal parameterizations for multiply-connected domains
- Polynomials and lemniscates of indefiniteness
- On Polynomial Approximation in the Complex Plane with Application to Conformal Mapping
- Computing extremal Teichmüller map of multiply-connected domains via Beltrami holomorphic flow
- Convergence of an iterative algorithm for Teichmüller maps via harmonic energy optimization
This page was built for publication: An interpolating polynomial method for numerical conformal mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2780564)
