Skip to main content
Log in

Efficient Calculation of Schwarz–Christoffel Transformations for Multiply Connected Domains Using Laurent Series

  • Published:
Computational Methods and Function Theory Aims and scope Submit manuscript

Abstract

We discuss recently developed numerics for the Schwarz–Christoffel transformation for unbounded multiply connected domains. The original infinite product representation for the derivative of the mapping function is replaced by a finite factorization where the inner factors satisfy certain boundary conditions derived here. Least squares approximations based on Laurent series are used to satisfy the boundary conditions. This results in a much more efficient method than the original method based on reflections making the accurate mapping of domains of higher connectivity feasible.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21

Similar content being viewed by others

Notes

  1. “No singularity may lie closer to an integration sub-interval than one-half the length of that subinterval.” [12].

References

  1. Allgower, E.L., Georg, K.: Numerical Continuation Methods: An Introduction. Springer, New York (1990)

    Book  MATH  Google Scholar 

  2. Crowdy, D.: Schwarz–Christoffel mapping to unbounded multiply connected polygonal regions. Math. Proc. Camb. Phil. Soc. 142, 319–339 (2007)

    Google Scholar 

  3. Crowdy, D.: The Schottky–Klein prime function on the Schottky double of planar domains. Comput. Methods Funct. Theory 10, 501–517 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Crowdy, D., Marshall, J.: Computing the Schottky–Klein prime function on the Schottky double of planar domains. Comput. Methods Funct. Theory 7, 293–308 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. DeLillo, T.K.: Schwarz–Christoffel mapping of bounded, multiply connected domains. Comput. Methods Funct. Theory 6, 275–300 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. DeLillo, T.K., Driscoll, T.A., Elcrat, A.R., Pfaltzgraff, J.A.: Computation of multiply connected Schwarz–Christoffel maps for exterior domains. Comput. Methods Funct. Theory 6, 301–315 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. DeLillo, T.K., Driscoll, T.A., Elcrat, A.R., Pfaltzgraff, J.A.: Radial and circular slit maps of unbounded multiply connected circle domains. Proc. R. Soc. A. 464, 1719–1737 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. DeLillo, T.K., Elcrat, A.R., Pfaltzgraff, J.A.: Schwarz–Christoffel mapping of multiply connected domains. J. d’Anal. Math. 94, 17–47 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. DeLillo, T.K., Kropf, E.H.: Slit maps and Schwarz–Christoffel maps for multiply connected domains. Electron. Trans. Numer. Anal. 36, 195–223 (2010)

    MathSciNet  Google Scholar 

  10. DeLillo, T.K., Kropf, E.H.: Numerical computation of the Schwarz–Christoffel transformation for multiply connected domains. SIAM J. Sci. Comput. 33, 1369–1394 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Driscoll, T.: A MATLAB toolbox for Schwarz–Christoffel mapping. ACM Trans. Math. Softw. 22, 168–186 (1996)

    Article  MATH  Google Scholar 

  12. Driscoll, T., Trefethen, L.: Schwarz–Christoffel Mapping. Cambridge University Press, Cambridge (2002)

    Book  MATH  Google Scholar 

  13. Finn, M.D., Cox, S.M., Byrne, H.M.: Topological chaos in inviscid and viscous mixers. J. Fluid Mech. 493, 345–361 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. Henrici, P.: Applied and Computational Complex Analysis, vol. III. Wiley, New York (1986)

    MATH  Google Scholar 

  15. Kropf, E.: Numerical computation of Schwarz-Christoffel transformations and slit maps for multiply connected domains, PhD Dissertation, Department of Mathematics, Statistics, and Physics, Wichita State University (2012)

  16. Mityushev, V.: Schwarz–Christoffel formula for multiply connected domains. Comput. Methods Funct. Theory 12, 449–463 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  17. Trefethen, L.N.: Numerical computation of the Schwarz–Christoffel transformation. SIAM J. Stat. Comput. 33, 82–102 (1980)

    Article  MathSciNet  Google Scholar 

  18. Trefethen, L.N.: Ten digit algorithms, Report No. 05/13, Oxford University Computing Laboratory (2005)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Thomas K. DeLillo.

Additional information

Communicated by Lloyd N. Trefethen.

Dedicated to Nicolas Papamichael

Rights and permissions

Reprints and permissions

About this article

Cite this article

DeLillo, T.K., Elcrat, A.R., Kropf, E.H. et al. Efficient Calculation of Schwarz–Christoffel Transformations for Multiply Connected Domains Using Laurent Series. Comput. Methods Funct. Theory 13, 307–336 (2013). https://doi.org/10.1007/s40315-013-0023-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40315-013-0023-1

Keywords

Mathematics Subject Classification (2000)

Navigation