Fast implementation of generalized Koebe’s iterative method
Authors
Advisors
Issue Date
Type
Keywords
Citation
Abstract
Let G be a given bounded multiply connected domain of connectivity (Formula presented.) bounded by smooth Jordan curves. Koebe’s iterative method is a classical method for computing the conformal mapping from the domain G onto a bounded multiply connected circular domain obtained by removing m disks from the unit disk. Koebe’s method has been generalized to compute the conformal mapping from the domain G onto a bounded multiply connected circular domain obtained by removing (Formula presented.) disks from a circular ring. A fast numerical implementation of the generalized Koebe’s iterative method is presented in this paper. The proposed method is based on using the boundary integral equation with the generalized Neumann kernel. Several numerical examples are presented to demonstrate the accuracy and efficiency of the proposed method. © 2025 by the authors.

