Header

UZH-Logo

Maintenance Infos

Revisiting the crowding phenomenon in Schwarz-Christoffel mapping


Banjai, L (2008). Revisiting the crowding phenomenon in Schwarz-Christoffel mapping. SIAM Journal on Scientific Computing (SISC), 30(2):618-636.

Abstract

We address the problem of conformally mapping the unit disk to polygons with elongations. The elongations cause the derivative of the conformal map to be exponentially large in some regions. This crowding phenomenon creates difficulties in standard numerical methods for the computation of the conformal map. We make use of the Schwarz-Christoffel representation of the mapping and show that a simple change to the existing algorithms introduced by Trefethen [SIAM J. Sci. Statist. Comput., 1 (1980), pp. 82-102] makes it feasible to accurately compute conformal maps to polygons even in the presence of extreme crowding. For an efficient algorithm it is essential that a good initial guess for the parameters of the Schwarz-Christoffel map be available. A uniformly close initial guess can be obtained from the cross-ratios of certain quadrilaterals, as introduced in the CRDT algorithm of Driscoll and Vavasis [SIAM J. Sci. Comput., 19 (1998), pp. 1783-1803]. We present numerical experiments and compare our algorithms with the CRDT which has been particularly designed to combat crowding.

Abstract

We address the problem of conformally mapping the unit disk to polygons with elongations. The elongations cause the derivative of the conformal map to be exponentially large in some regions. This crowding phenomenon creates difficulties in standard numerical methods for the computation of the conformal map. We make use of the Schwarz-Christoffel representation of the mapping and show that a simple change to the existing algorithms introduced by Trefethen [SIAM J. Sci. Statist. Comput., 1 (1980), pp. 82-102] makes it feasible to accurately compute conformal maps to polygons even in the presence of extreme crowding. For an efficient algorithm it is essential that a good initial guess for the parameters of the Schwarz-Christoffel map be available. A uniformly close initial guess can be obtained from the cross-ratios of certain quadrilaterals, as introduced in the CRDT algorithm of Driscoll and Vavasis [SIAM J. Sci. Comput., 19 (1998), pp. 1783-1803]. We present numerical experiments and compare our algorithms with the CRDT which has been particularly designed to combat crowding.

Statistics

Citations

4 citations in Web of Science®
4 citations in Scopus®
Google Scholar™

Altmetrics

Downloads

58 downloads since deposited on 08 Nov 2009
8 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Language:English
Date:2008
Deposited On:08 Nov 2009 23:20
Last Modified:06 Dec 2017 20:37
Publisher:Society for Industrial and Applied Mathematics (SIAM)
ISSN:1064-8275
Additional Information:Copyright © 2008, Society for Industrial and Applied Mathematics
Publisher DOI:https://doi.org/10.1137/060677392

Download

Download PDF  'Revisiting the crowding phenomenon in Schwarz-Christoffel mapping'.
Preview
Filetype: PDF
Size: 1MB
View at publisher