Report

A multipole method for Schwarz-Christoffel mapping of polygons with thousands of sides

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(N^3) 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 × 10^5.

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Banjai, L., & Trefethen, L. (2002). A multipole method for Schwarz-Christoffel mapping of polygons with thousands of sides. Unspecified.

MLA Style

Banjai, L., and L. Trefethen. A Multipole Method for Schwarz-Christoffel Mapping of Polygons with Thousands of Sides. Unspecified, 2002.

Chicago Style

Banjai, L, and L Trefethen. 2002. “A Multipole Method for Schwarz-Christoffel Mapping of Polygons with Thousands of Sides.” Unspecified.
Share
Print

Access Document

Files:: NA-02-14.pdf

(Preview, pdf, 1.7MB, Terms of use)

Authors

+ Banjai, L More by this author

Role:: Author

+ Trefethen, L More by this author

Role:: Author

Publisher:: Unspecified
Publication date:: 2002-07-01

UUID:: uuid:e0fbd9e3-fd76-4447-b839-0df31a5309e4
Local pid:: oai:eprints.maths.ox.ac.uk:1214
Deposit date:: 2011-05-20

Terms of use

Copyright date:: 2002

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP