Fast Implementation of Generalized Koebe’s Iterative Method
Let <i>G</i> be a given bounded multiply connected domain of connectivity <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>m</mi><mo>+</mo><mn>1</mn></...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-06-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/12/1920 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Let <i>G</i> be a given bounded multiply connected domain of connectivity <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>m</mi><mo>+</mo><mn>1</mn></mrow></semantics></math></inline-formula> bounded by smooth Jordan curves. Koebe’s iterative method is a classical method for computing the conformal mapping from the domain <i>G</i> onto a bounded multiply connected circular domain obtained by removing <i>m</i> disks from the unit disk. Koebe’s method has been generalized to compute the conformal mapping from the domain <i>G</i> onto a bounded multiply connected circular domain obtained by removing <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>m</mi><mo>−</mo><mn>1</mn></mrow></semantics></math></inline-formula> 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. |
|---|---|
| ISSN: | 2227-7390 |