A Multipole Method for Schwarz--Christoffel Mapping of Polygons with Thousands of Sides

Authors:
Lehel Banjai;L. N. Trefethen
Affiliations:
-;-
Venue:
SIAM Journal on Scientific Computing
Year:
2003

Citing 0
Cited 5

Computing eigenfunctions on the Koch Snowflake: a new grid and symmetry

Journal of Computational and Applied Mathematics
Eigenfrequencies of fractal drums

Journal of Computational and Applied Mathematics
Modified Schwarz-Christoffel mappings using approximate curve factors

Journal of Computational and Applied Mathematics
Computing eigenfunctions on the Koch Snowflake: A new grid and symmetry

Journal of Computational and Applied Mathematics
Numerical Computation of the Schwarz-Christoffel Transformation for Multiply Connected Domains

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

A method is presented for the computation of Schwarz--Christoffel maps to polygons with tens of thousands of vertices. Previously published algorithms have CPU time estimates of the order O(N3) for the computation of a conformal map of a polygon with N vertices. This has been reduced to O(N log N) by the use of the fast multipole method and Davis's method for solving the parameter problem. The method is illustrated by a number of examples, the largest of which has $N \approx 2 \times 10^5$.