Jump to Content
Your Recent History
View Cart
Logged Out Log In
SIAM J. Sci. Comput. 33, pp. 279-302 (24 pages)
On Moduli of Rings and Quadrilaterals: Algorithms and Experiments
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookModuli of rings and quadrilaterals are frequently applied in geometric function theory; see, e.g., the handbook by Kühnau [Handbook of Complex Analysis: Geometric Function Theory, Vols. 1 and 2, North–Holland, Amsterdam, 2005]. Yet their exact values are known only in a few special cases. Previously, the class of planar domains with polygonal boundary has been studied by many authors from the point of view of numerical computation. We present here a new $hp$-FEM algorithm for the computation of moduli of rings and quadrilaterals and compare its accuracy and performance with previously known methods such as the Schwarz–Christoffel Toolbox of Driscoll and Trefethen. We also demonstrate that the $hp$-FEM algorithm applies to the case of nonpolygonal boundary and report results with concrete error bounds.
© 2011 Society for Industrial and Applied Mathematics
RELATED DATABASES
To view database links for this article,
you need to log in.
KEYWORDS
PUBLICATION DATA
ARTICLE DATA
History
Received July 01, 2009
Accepted November 01, 2010
Published online February 22, 2011
Accepted November 01, 2010
Published online February 22, 2011
Digital Object Identifier
For access to fully linked references, you need to log in.
For access to citing articles, you need to log in.
ALL SIAM Content
Scitation
Google Scholar