Approximating the conformal maps of elongated quadrilaterals by domain decomposition
The authors are well known for their earlier contributions concerning the domain decomposition method (DDM) for the computational of conformal modules of `long and slim' quadrilaterals. In the meantime Laugesen (1994) has given theorems about the DDM computation of the full conformal mapping of certain quadrilaterals \(\Omega\) onto the corresponding rectangles \(R\). Here the authors extend these results to more general quadrilaterals \(\Omega\), not necessary polygonal. Thereby the given domain \(\Omega\) is chopped up in a small number \(m\) of simple pieces \(\Omega_j\), and the wanted conformal map \(f:\Omega\to R\) is approximated by \(m\) conformal maps \(f_j\) so that in effect \(f\) is approximated by a piecewise conformal map. The resulting approximation is therefore slightly discontinuous across the boundaries \(\partial \Omega_j\). Extensive and very precise error estimates are given. Three numerical examples show an impressive improvement over existimating methods (SC, SC Toolbox of Driscoll), in particular by a reduction of computing time by a factor \({1\over 20}\). In addition, these methods are restricted to polygonal domains. Always special care is given to error estimates, so that in all examples the error of approximation of the modules and of the whole conformal maps is of the order \(10^{-8}\).
scientific article; zbMATH DE number 1687552