Asset Details
Do you wish to reserve the book?
Fast Implementation of Generalized Koebe’s Iterative Method
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Fast Implementation of Generalized Koebe’s Iterative Method
Do you wish to request the book?
Fast Implementation of Generalized Koebe’s Iterative Method
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Fast Implementation of Generalized Koebe’s Iterative Method
2025
Overview
Let G be a given bounded multiply connected domain of connectivity m+1 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 m−1 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.
Publisher
MDPI AG
