Fast computation of the circular map

From MaRDI portal
Publication:2355285

DOI10.1007/S40315-014-0098-3zbMATH Open1318.30013arXiv1403.5380OpenAlexW3104090663MaRDI QIDQ2355285FDOQ2355285


Authors: M. M. S. Nasser Edit this on Wikidata


Publication date: 22 July 2015

Published in: Computational Methods and Function Theory (Search for Journal in Brave)

Abstract: This paper presents a new numerical implementation of Koebe's iterative method for computing the circular map of bounded and unbounded multiply connected regions of connectivity m. The computational cost of the method is O(mnlnn) where n is the number of nodes in the discretization of each boundary component. The accuracy and efficiency of the presented method are demonstrated by several numerical examples. These examples include regions with high connectivity, regions whose boundaries are closer together, and regions with piecewise smooth boundaries.


Full work available at URL: https://arxiv.org/abs/1403.5380




Recommendations




Cites Work


Cited In (12)

Uses Software





This page was built for publication: Fast computation of the circular map

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355285)