American Institute of Mathematical Sciences

Advanced
  • Previous Article
    Balanced truncation model reduction of a nonlinear cable-mass PDE system with interior damping
  • DCDS-B Home
  • This Issue
  • Next Article
    Superconvergence of the semi-discrete local discontinuous Galerkin method for nonlinear KdV-type problems
January  2019, 24(1): 55-82. doi: 10.3934/dcdsb.2018100

A Comparison of some numerical conformal mapping methods for simply and multiply connected domains

Mohamed Badreddine , Thomas K. DeLillo , and  Saman Sahraei

Department of Mathematics, Statistics, and Physics, Wichita State University, Wichita, KS 67260-0033, USA

* Corresponding author: T. K. DeLillo

Received  January 2017 Revised  December 2017 Published  January 2019 Early access  March 2018

This paper compares some methods for computing conformal maps from simply and multiply connected domains bounded by circles to target domains bounded by smooth curves and curves with corners. We discuss the use of explicit preliminary maps, including the osculation method of Grassmann, to first conformally map the target domain to a more nearly circular domain. The Fourier series method due to Fornberg and its generalization to multiply connected domains are then applied to compute the maps to the nearly circular domains. The final map is represented as a composition of the Fourier/Laurent series with the inverted explicit preliminary maps. A method for systematically removing corners with power maps is also implemented and composed with the Fornberg maps. The use of explict maps has been suggested often in the past, but has rarely been carefully studied, especially for the multiply connected case. Using Fourier series to represent conformal maps from domains bounded by circles to more general domains has certain computational advantages, such as the use of fast methods. However, if the target domain has elongated sections or corners, the mapping problems can suffer from severe ill-conditioning or loss of accuracy. The purpose of this paper is to illustrate some of these practical possibilites and limitations.

Keywords: Numerical conformal mapping, multiply connected domains, Fornberg's method, Grassmann's method, osculation methods, potential flow.
Mathematics Subject Classification: Primary: 30C30, 65E05.
Citation: Mohamed Badreddine, Thomas K. DeLillo, Saman Sahraei. A Comparison of some numerical conformal mapping methods for simply and multiply connected domains. Discrete & Continuous Dynamical Systems - B, 2019, 24 (1) : 55-82. doi: 10.3934/dcdsb.2018100
References:
[1]

L. Ahlfors, Complex Analysis, third edition, McGraw-Hill, New York, 1979.  Google Scholar

[2]

M. Badreddine, Comparison of Some Numerical Conformal Mapping Methods for Simply and Multiply Connected Domains, Ph. D dissertation, Wichita State University, 2016. Google Scholar

[3]

N. Benchama, T. DeLillo, T. Hrycak and L. Wang, A simplified Fornberg-like method for the conformal mapping of multiply connected regions-comparisons and crowding, J. Comput. Appl. Math., 209 (2007), 1-21.  doi: 10.1016/j.cam.2006.10.030.  Google Scholar

[4]

T. K. DeLillo, A Comparison of Some Numerical Conformal Mapping Methods, PhD dissertation, Courant Institute, NYU, 1985.  Google Scholar

[5]

T. K. DeLillo, On the use of numerical conformal mapping methods in solving boundary value problems for the Laplace equation, in Advances in Computer Methods for Partial Differential Equations-Ⅶ, eds. R. Vichnevetsky, D. Knight, and G. Richter, Seventh IMACS Symposium Proceedings, Rutgers University, (1992), 190-194. Google Scholar

[6]

T. K. DeLillo, Comparisons of some numerical conformal mapping methods, in Proceedings of the 14th IMACS World Congress on Computation and Applied Mathematics, Vol. 1, ed. W. F. Ames, Georgia Institute of Technology, Atlanta, Georgia, (1994), 115-118. Google Scholar

[7]

T. DeLillo, The accuracy of numerical conformal mapping methods: A survey of examples and results, SIAM J. Numer. Anal., 31 (1994), 788-812.  doi: 10.1137/0731043.  Google Scholar

[8]

T. DeLillo, Tutorial on Fourier series methods for numerical conformal mapping of smooth domains, 2014, http://www.math.wichita.edu/~delillo/TD_tutorial.pdf Google Scholar

[9]

T. DeLillo and A. Elcrat, A comparison of some numerical conformal mapping methods for exterior regions, SIAM J. Sci. Stat. Comput., 12 (1991), 399-422.  doi: 10.1137/0912022.  Google Scholar

[10]

T. K. DeLillo and A. R. Elcrat, Numerical conformal mapping methods for exterior regions with corners, J. Comput. Phys., 108 (1993), 199-208.  doi: 10.1006/jcph.1993.1175.  Google Scholar

[11]

T. K. DeLillo, A. R. Elcrat and J. A. Pfaltzgraff, Numerical conformal mapping methods based on Faber series, J. Comput. Appl. Math., 83 (1997), 205-236.  doi: 10.1016/S0377-0427(97)00099-X.  Google Scholar

[12]

T. K. DeLillo and E. H. Kropf, A Fornberg-like method for the numerical conformal mapping of bounded multiply connected domains, submitted for publication. Google Scholar

[13]

T. DeLillo and J. Pfaltzgraff, Numerical conformal mapping methods for simply and doubly connected regions, SIAM J. Sci. Comput., 19 (1998), 155-171.  doi: 10.1137/S1064827596303545.  Google Scholar

[14]

T. A. Driscoll and L. N. Trefethen, Schwarz-Christoffel Mapping, Cambridge, 2002.  Google Scholar

[15]

B. Fornberg, A numerical method for conformal mappings, SIAM J. Sci. Stat. Comput, 1 (1980), 386-400.  doi: 10.1137/0901027.  Google Scholar

[16]

D. Gaier, Konstruktive Methoden der Konformen Abbildung, Springer, Berlin, 1964.  Google Scholar

[17]

E. Grassmann, Numerical experiments with a method of successive approximation for conformal mapping, ZAMP, 30 (1979), 873-884.  doi: 10.1007/BF01590486.  Google Scholar

[18]

M. H. Gutknecht, Numerical experiments on solving Theodorsen's intergral equation for conformal maps with the fast Fourier transfomr and various nonlinear iterative methods, SIAM J. Sci. Stat. Comput., 4 (1983), 1-30.  doi: 10.1137/0904001.  Google Scholar

[19]

H. Hakula, T. Quach and A. Rasila, Conjugate function method for numerical conformal mappings, J. Comput. Appl. Math., 237 (2013), 340-353.  doi: 10.1016/j.cam.2012.06.003.  Google Scholar

[20]

H. Hakula, A. Rasila and M. Vuorinen, Conformal modulus on domains with strong singularities and cusps, arXiv: 1501.06765. Google Scholar

[21]

N. D. Halsey, Potential flow analysis of multielement airfoils using conformal mapping, AIAA J., 17 (1979), 1281-1288.  doi: 10.2514/3.61308.  Google Scholar

[22]

J. Heinhold and R. Albrecht, Zur Praxis der konformen Abbildung, Rend. Circ. Mat. Palermo Ser. 2, 3 (1954), 130-148.  doi: 10.1007/BF02849374.  Google Scholar

[23]

P. Henrici, A general theory of osculation algorithms for conformal maps, J. Linear Alg. Appl., 52/53 (1983), 361-382.  doi: 10.1016/0024-3795(83)80024-X.  Google Scholar

[24]

P. Henrici, Applied and Computational Complex Analysis, John Wiley & Sons, Inc., New York, 1988.  Google Scholar

[25]

H.-P. Hoidn, Osculation methods for the conformal mapping of doubly connected regions, ZAMP, 33 (1982), 640-652.   Google Scholar

[26]

W. D. Hoskins and P. R. King, Periodic cubic spline interpolation using parametric splines, The Computer Journal, 15 (1972), 282-283.   Google Scholar

[27]

R. M. James, A general class of exact airfoil solutions, AIAA J., 9 (1972), 574-580.  doi: 10.2514/3.59038.  Google Scholar

[28]

W. Koppenfels and F. Stallmann, Praxis Der Konformen Abbildung, Springer, Berlin, 1959.  Google Scholar

[29]

L. Landweber and T. Miloh, Elimination of corners in the mapping of a closed curve, J. Engrg. Math., 6 (1972), 369-375.  doi: 10.1007/BF01535197.  Google Scholar

[30]

R. S. Lehman, Development of the mapping function at an analytic corner, Pacific J. Math., 7 (1957), 1437-1449.  doi: 10.2140/pjm.1957.7.1437.  Google Scholar

[31]

H. Lewy, Developments at the confluence of anaytic boundary conditions, Univ. of California Publ. in Math., 1 (1950), 247-280.   Google Scholar

[32]

D. E. Marshall, Conformal welding for finitely connected regions, Comput. Methods Funct. Theory, 11 (2011), 655-669.   Google Scholar

[33]

J. H. Mathews and R. W. Howell, Complex Analysis for Mathematics and Engineering, Sixth edition, Jones and bartlett, W, C. Brown, 2010. http://mathfaculty.fullerton.edu/mathews/complex.html Google Scholar

[34]

D. I. Meiron, S. A. Orszag and M. Israeli, Applications of numerical conformal mapping, J. Comput. Phys., 40 (1981), 345-360.  doi: 10.1016/0021-9991(81)90215-1.  Google Scholar

[35]

R. Menikoff and C. Zemach, Methods for numerical conformal mapping, J. Comput. Phys., 36 (1980), 366-410.  doi: 10.1016/0021-9991(80)90166-7.  Google Scholar

[36]

M. Nasser, Fast computation of the circular map, Comput. Methods Funct. Theory, 15 (2015), 187-223.  doi: 10.1007/s40315-014-0098-3.  Google Scholar

[37]

M. Nasser, T. Sakajo, A. Murid and L. K. Wei, A fast computational method for potential flows in multiply connected coastal domains, Japan J. Indust. Appl. Math., 32 (2015), 205-236.  doi: 10.1007/s13160-015-0168-6.  Google Scholar

[38]

S. T. O'Donnell and V. Rokhlin, A fast algorithm for the numerical evaluation of conformal mappings, SIAM J. Sci. Statist. Comput., 10 (1989), 475-487.  doi: 10.1137/0910031.  Google Scholar

[39]

N. Papamichael and N. Stylianopoulos, Numerical Conformal Mapping - Domain Decomposition and the Mapping of Quadrilaterals, World Scientific, Singapore, 2010.  Google Scholar

[40]

R. M. Porter, An accelerated osculation method and its application to numerical conformal mapping, Complex Variables, 48 (2003), 569-582.  doi: 10.1080/0278107031000110892.  Google Scholar

[41]

W. J. Prosnak, Computation of Fluid Motions in Multiply Connected Domains, G. Braun, Karlsruhe, 1987.  Google Scholar

[42]

W. J. Prosnak, Conformal representation of arbitrary multiconnected airfoils, Bull. Acad. Pol. Sci., 25 (1977), 25-36 (591-602).   Google Scholar

[43]

R. Wegmann, On Fornberg's numerical method for conformal mapping, SIAM J. Numer. Anal., 23 (1986), 1199-1213.  doi: 10.1137/0723081.  Google Scholar

[44]

——, Methods for numerical conformal mapping, in Handbook of Complex Analysis, Geometric Function Theory, Vol. 2, (ed. R. Kuehnau), Elsevier, Amsterdam, (2005), 351-477. Google Scholar

[45]

B. R. Williams, An exact test case for the plane potential flow about two adjacent lifting airfoils, RAE Technical Report No. 3717, London (1973). Google Scholar

show all references

References:
[1]

L. Ahlfors, Complex Analysis, third edition, McGraw-Hill, New York, 1979.  Google Scholar

[2]

M. Badreddine, Comparison of Some Numerical Conformal Mapping Methods for Simply and Multiply Connected Domains, Ph. D dissertation, Wichita State University, 2016. Google Scholar

[3]

N. Benchama, T. DeLillo, T. Hrycak and L. Wang, A simplified Fornberg-like method for the conformal mapping of multiply connected regions-comparisons and crowding, J. Comput. Appl. Math., 209 (2007), 1-21.  doi: 10.1016/j.cam.2006.10.030.  Google Scholar

[4]

T. K. DeLillo, A Comparison of Some Numerical Conformal Mapping Methods, PhD dissertation, Courant Institute, NYU, 1985.  Google Scholar

[5]

T. K. DeLillo, On the use of numerical conformal mapping methods in solving boundary value problems for the Laplace equation, in Advances in Computer Methods for Partial Differential Equations-Ⅶ, eds. R. Vichnevetsky, D. Knight, and G. Richter, Seventh IMACS Symposium Proceedings, Rutgers University, (1992), 190-194. Google Scholar

[6]

T. K. DeLillo, Comparisons of some numerical conformal mapping methods, in Proceedings of the 14th IMACS World Congress on Computation and Applied Mathematics, Vol. 1, ed. W. F. Ames, Georgia Institute of Technology, Atlanta, Georgia, (1994), 115-118. Google Scholar

[7]

T. DeLillo, The accuracy of numerical conformal mapping methods: A survey of examples and results, SIAM J. Numer. Anal., 31 (1994), 788-812.  doi: 10.1137/0731043.  Google Scholar

[8]

T. DeLillo, Tutorial on Fourier series methods for numerical conformal mapping of smooth domains, 2014, http://www.math.wichita.edu/~delillo/TD_tutorial.pdf Google Scholar

[9]

T. DeLillo and A. Elcrat, A comparison of some numerical conformal mapping methods for exterior regions, SIAM J. Sci. Stat. Comput., 12 (1991), 399-422.  doi: 10.1137/0912022.  Google Scholar

[10]

T. K. DeLillo and A. R. Elcrat, Numerical conformal mapping methods for exterior regions with corners, J. Comput. Phys., 108 (1993), 199-208.  doi: 10.1006/jcph.1993.1175.  Google Scholar

[11]

T. K. DeLillo, A. R. Elcrat and J. A. Pfaltzgraff, Numerical conformal mapping methods based on Faber series, J. Comput. Appl. Math., 83 (1997), 205-236.  doi: 10.1016/S0377-0427(97)00099-X.  Google Scholar

[12]

T. K. DeLillo and E. H. Kropf, A Fornberg-like method for the numerical conformal mapping of bounded multiply connected domains, submitted for publication. Google Scholar

[13]

T. DeLillo and J. Pfaltzgraff, Numerical conformal mapping methods for simply and doubly connected regions, SIAM J. Sci. Comput., 19 (1998), 155-171.  doi: 10.1137/S1064827596303545.  Google Scholar

[14]

T. A. Driscoll and L. N. Trefethen, Schwarz-Christoffel Mapping, Cambridge, 2002.  Google Scholar

[15]

B. Fornberg, A numerical method for conformal mappings, SIAM J. Sci. Stat. Comput, 1 (1980), 386-400.  doi: 10.1137/0901027.  Google Scholar

[16]

D. Gaier, Konstruktive Methoden der Konformen Abbildung, Springer, Berlin, 1964.  Google Scholar

[17]

E. Grassmann, Numerical experiments with a method of successive approximation for conformal mapping, ZAMP, 30 (1979), 873-884.  doi: 10.1007/BF01590486.  Google Scholar

[18]

M. H. Gutknecht, Numerical experiments on solving Theodorsen's intergral equation for conformal maps with the fast Fourier transfomr and various nonlinear iterative methods, SIAM J. Sci. Stat. Comput., 4 (1983), 1-30.  doi: 10.1137/0904001.  Google Scholar

[19]

H. Hakula, T. Quach and A. Rasila, Conjugate function method for numerical conformal mappings, J. Comput. Appl. Math., 237 (2013), 340-353.  doi: 10.1016/j.cam.2012.06.003.  Google Scholar

[20]

H. Hakula, A. Rasila and M. Vuorinen, Conformal modulus on domains with strong singularities and cusps, arXiv: 1501.06765. Google Scholar

[21]

N. D. Halsey, Potential flow analysis of multielement airfoils using conformal mapping, AIAA J., 17 (1979), 1281-1288.  doi: 10.2514/3.61308.  Google Scholar

[22]

J. Heinhold and R. Albrecht, Zur Praxis der konformen Abbildung, Rend. Circ. Mat. Palermo Ser. 2, 3 (1954), 130-148.  doi: 10.1007/BF02849374.  Google Scholar

[23]

P. Henrici, A general theory of osculation algorithms for conformal maps, J. Linear Alg. Appl., 52/53 (1983), 361-382.  doi: 10.1016/0024-3795(83)80024-X.  Google Scholar

[24]

P. Henrici, Applied and Computational Complex Analysis, John Wiley & Sons, Inc., New York, 1988.  Google Scholar

[25]

H.-P. Hoidn, Osculation methods for the conformal mapping of doubly connected regions, ZAMP, 33 (1982), 640-652.   Google Scholar

[26]

W. D. Hoskins and P. R. King, Periodic cubic spline interpolation using parametric splines, The Computer Journal, 15 (1972), 282-283.   Google Scholar

[27]

R. M. James, A general class of exact airfoil solutions, AIAA J., 9 (1972), 574-580.  doi: 10.2514/3.59038.  Google Scholar

[28]

W. Koppenfels and F. Stallmann, Praxis Der Konformen Abbildung, Springer, Berlin, 1959.  Google Scholar

[29]

L. Landweber and T. Miloh, Elimination of corners in the mapping of a closed curve, J. Engrg. Math., 6 (1972), 369-375.  doi: 10.1007/BF01535197.  Google Scholar

[30]

R. S. Lehman, Development of the mapping function at an analytic corner, Pacific J. Math., 7 (1957), 1437-1449.  doi: 10.2140/pjm.1957.7.1437.  Google Scholar

[31]

H. Lewy, Developments at the confluence of anaytic boundary conditions, Univ. of California Publ. in Math., 1 (1950), 247-280.   Google Scholar

[32]

D. E. Marshall, Conformal welding for finitely connected regions, Comput. Methods Funct. Theory, 11 (2011), 655-669.   Google Scholar

[33]

J. H. Mathews and R. W. Howell, Complex Analysis for Mathematics and Engineering, Sixth edition, Jones and bartlett, W, C. Brown, 2010. http://mathfaculty.fullerton.edu/mathews/complex.html Google Scholar

[34]

D. I. Meiron, S. A. Orszag and M. Israeli, Applications of numerical conformal mapping, J. Comput. Phys., 40 (1981), 345-360.  doi: 10.1016/0021-9991(81)90215-1.  Google Scholar

[35]

R. Menikoff and C. Zemach, Methods for numerical conformal mapping, J. Comput. Phys., 36 (1980), 366-410.  doi: 10.1016/0021-9991(80)90166-7.  Google Scholar

[36]

M. Nasser, Fast computation of the circular map, Comput. Methods Funct. Theory, 15 (2015), 187-223.  doi: 10.1007/s40315-014-0098-3.  Google Scholar

[37]

M. Nasser, T. Sakajo, A. Murid and L. K. Wei, A fast computational method for potential flows in multiply connected coastal domains, Japan J. Indust. Appl. Math., 32 (2015), 205-236.  doi: 10.1007/s13160-015-0168-6.  Google Scholar

[38]

S. T. O'Donnell and V. Rokhlin, A fast algorithm for the numerical evaluation of conformal mappings, SIAM J. Sci. Statist. Comput., 10 (1989), 475-487.  doi: 10.1137/0910031.  Google Scholar

[39]

N. Papamichael and N. Stylianopoulos, Numerical Conformal Mapping - Domain Decomposition and the Mapping of Quadrilaterals, World Scientific, Singapore, 2010.  Google Scholar

[40]

R. M. Porter, An accelerated osculation method and its application to numerical conformal mapping, Complex Variables, 48 (2003), 569-582.  doi: 10.1080/0278107031000110892.  Google Scholar

[41]

W. J. Prosnak, Computation of Fluid Motions in Multiply Connected Domains, G. Braun, Karlsruhe, 1987.  Google Scholar

[42]

W. J. Prosnak, Conformal representation of arbitrary multiconnected airfoils, Bull. Acad. Pol. Sci., 25 (1977), 25-36 (591-602).   Google Scholar

[43]

R. Wegmann, On Fornberg's numerical method for conformal mapping, SIAM J. Numer. Anal., 23 (1986), 1199-1213.  doi: 10.1137/0723081.  Google Scholar

[44]

——, Methods for numerical conformal mapping, in Handbook of Complex Analysis, Geometric Function Theory, Vol. 2, (ed. R. Kuehnau), Elsevier, Amsterdam, (2005), 351-477. Google Scholar

[45]

B. R. Williams, An exact test case for the plane potential flow about two adjacent lifting airfoils, RAE Technical Report No. 3717, London (1973). Google Scholar

Figure 1.  The composition $f = g^{-1}\circ h$ of Fornberg map $h$ using $N = 256$ Fourier points from unit disk to the near circle $g(\Gamma)$ (left), where $\Gamma$ is the inverted ellipse with $\alpha = 0.2$ (right), produced with composition of 10 Grassmann maps $g = g_{10}\circ \cdots g_2\circ g_1$.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 24.  Fornberg is composed with corner smoothing maps to the exterior of $m = 3$ rectangles with $N = 128$ and $Ns = 50$ points per side.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 2.  Fornberg maps to inverted ellipses with $\alpha = 0.8, 0.4, 0.2, 0.1$ and $N = 64,128,256,256$, resp..
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 3.  Errors for Fornberg maps to inverted ellipse with analytic boundary.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 11.  Errors for Grassmann maps to inverted ellipse $Ns = 2000$.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 13.  Inverted ellipse $\alpha = 0.2$ with $igm = 10$ and $Ns = 400$: distribution of $N = 256$ Fourier points.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 12.  Errors for 10 Grassmann maps to inverted ellipse with $\alpha = 0.2$ and various numbers of splines points $Ns$ demonstrating that errors can be made smaller by increasing both $N$ and $Ns$. Note for fixed $Ns$ the minimum achievable error is fixed for a given domain.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 4.  Ill-conditioned map: $\alpha = 0.3$ ellipse using $N = 2048$ with standard initial guess. $Ns = 2000$ spline points were used, but an analytic parametrization yields similar results. 11 Newton iteration gives an error in the successive iterates of 0 to machine precision. With $N = 1024$, small oscillations can be seen near $\pm 1$. Results with two crescent maps are slightly worse.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 15.  Ill-conditioned map: $\alpha = 0.2$ ellipse using $N = 32,768$ with standard initial guess. $Ns = 4000$ spline points were used, but analytic parametrization yields similar results. 6 Newton iteration gives error in successive iterates of $1.0\cdot 10^{-4}$. Note the poor resolution near $\pm 1$.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 16.  The map to an ellipse with $\alpha = 0.2$ is computed by the Fornberg map to near circle composed with 2 inverted crescent maps, $N = 32,768$. $Ns = 4000$ spline knots were used.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 5.  Fornberg map to a curve with defined by $Ns = 100$ spline points using $N = 256$.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 6.  One crescent map applied to an ellipse with $\alpha = 0.75$. The 'X's on the left figure mark the centers of the unit and tangent circles.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 7.  One crescent map applied to an inverted ellipse with $\alpha = 0.52$.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 8.  Steps for one Koebe map applied to an inverted ellipse with $\alpha = 0.48$. Note that the circle tangent to the boundary at the point nearest the origin does not intersect the unit circle, so that the crescent map cannot be applied. The square root is taken at the origin slightly off of the boundary curve, so that the curve remains smooth.
Figure Options

Download full-size image

Download as PowerPoint slide

Table 3.">Figure 9.  Iterations 1, 3, and 6 of Grassmann maps applied to an inverted ellipse with $\alpha = 0.2$; see Table 3.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 10.  Inverted ellipse $\alpha = 0.2$ with $igm = 10$ and $Ns = 400$.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 14.  Fornberg map for ellipse $\alpha = 0.6, N = 256$ with two preliminary crescent maps to near circle.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 17.  The steps for smoothing a corner: The domain is placed slightly inside of the unit disk and each corner is successively rotated to the negative real axis and mapped to the origin with a Möbius map of the disk taking the corner to the origin. The corner is smoothed with a power map, and the origin is mapped back to the negative real axis.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 18.  Inverses of corner smoothing maps composed with Fornberg's map for a square.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 19.  Sequence of maps from the unit disk to smoothed domain to a square $N = 1024$ for Fornberg's method and $Ns = 200$ points per side.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 20.  Sequence of maps from the unit disk to a smoothed domain to a polygon with $N = 1024$ for Fornberg's method.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 21.  Sequence of maps from the unit disk to a smoothed domain to a crescent with $N = 256$ for Fornberg's method. The exact map to the crescent is known The error using Fornberg's method is between $10^{-4}$ to about $1.5\cdot 10^{-2}$ near the prevertices and changes very little with increased $N$ and $Ns$.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 22.  Fornberg composed with Grassmann maps for exterior of $m = 4$ curves -3 inverted ellipses and an ellipse with $N = 128, igm = 8, Ns = 200$. The Fornberg map directly to the domain did not converge.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 23.  This domain is the same as the domain above, except that the thin ellipse and inverted ellipse are changed from $\alpha = 0.2$ to $\alpha = 0.4.$ Both the Fornberg map directly to the domain and composed with preliminary Grassmann maps converged for this case with $N = 128, Ns = 200, igm = 0$ or $8$.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 26.  Joukowski map and $k^{-1}\circ h$.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 28.  Streamlines for potential flow over two cosine airfoils with using the Karman-Trefftz transformation $k, k^{-1}\circ h$, composed with the extension of Fornberg's method for connectivity 2 and $N = 128$. Circulation is computed so that the Kutta condition is satisfied at the trailing edges.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 25.  Joukowski airfoil smoothed by Karman-Trefftz map.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 27.  Error for Joukowski map and $k^{-1}\circ h$.
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 29.  The map from the interior of the unit disk (left) with two circular holes to the interior of a diamond (right) with two elliptical holes by smoothing corners on the diamond and using $N = 256$ Fourier points for the map to the smooth region (middle).
Figure Options

Download full-size image

Download as PowerPoint slide

Table 4.  The calculated error of the Koebe-like corner-removing method compared with the exact map to the square given by SC Toolbox for several values of $N$ for the Fornberg map.
N Error
64 .1497
128 .0697
256 .0246
512 .007
1024 .0019
Table Options

Download as excel

N Error
64 .1497
128 .0697
256 .0246
512 .007
1024 .0019
Table 1.  Convergence of successive iteration errors at the Fourier points for the map to an inverted ellipse with $\alpha = 0.2$ and $N = 128$. Note that the discrete problem is solved to machine precision but the truncation error is limited by $N$.
Iteration $\Vert S^{k+1}-S^k\Vert_{\infty}$ $\Vert f_{computed} - f_{exact}\Vert_{\infty}$
1 6.0e-01 6.6e-01
2 3.3e-01 3.3e-01
3 7.0e-02 6.9e-02
4 2.6e-03 2.6e-03
5 4.0e-06 4.9e-06
6 4.2e-11 1.2e-06
7 0.0e+00 1.2e-06
8 0.0e+00 1.2e-06
Table Options

Download as excel

Iteration $\Vert S^{k+1}-S^k\Vert_{\infty}$ $\Vert f_{computed} - f_{exact}\Vert_{\infty}$
1 6.0e-01 6.6e-01
2 3.3e-01 3.3e-01
3 7.0e-02 6.9e-02
4 2.6e-03 2.6e-03
5 4.0e-06 4.9e-06
6 4.2e-11 1.2e-06
7 0.0e+00 1.2e-06
8 0.0e+00 1.2e-06
Table 5.  Convergence of successive Newton-iteration errors $\Vert S^{i+1}-S^i\Vert_{\infty}$ at the Fourier points for the Fourier series map to the the near-circular region of connectivity $m = 4$ in Figure 22 for $N = 128,256$. Note that the convergence rate is nearly independent of $N$. (The number of conjugate gradient iterations to solve the inner linear systems was fixed at 30.)
Newton iterations $N=128$ $N=256$
1 1.6e+00 3.3e+00
2 7.5e-01 1.5e-00
3 1.3e-02 2.5e-02
4 5.5e-04 1.5e-03
5 5.6e-06 5.7e-06
6 3.7e-08 1.5e-08
7 3.4e-10 2.6e-11
8 2.2e-12 1.0e-13
9 3.1e-14 5.6e-14
10 1.8e-14 2.7e-14
Table Options

Download as excel

Newton iterations $N=128$ $N=256$
1 1.6e+00 3.3e+00
2 7.5e-01 1.5e-00
3 1.3e-02 2.5e-02
4 5.5e-04 1.5e-03
5 5.6e-06 5.7e-06
6 3.7e-08 1.5e-08
7 3.4e-10 2.6e-11
8 2.2e-12 1.0e-13
9 3.1e-14 5.6e-14
10 1.8e-14 2.7e-14
Table 2.  Comparison of errors and approximate timings in seconds on a laptop using MATLAB for cubic spline and trigonometric interpolation for the inverted ellipse with $igm = 10$ preliminary Grassmann maps and 10 Newton iterations for Fornberg's method. Interpolation is needed to provide a good initial guess for the trig interpolation parameter.
trig interp spline interp
$\alpha$ Ns N error time error time
0.4 2000 256 1.2e-04 0.37 1.2e-04 0.06
2000 512 5.5e-06 0.89 5.5e-06 0.07
2000 1024 2.3e-08 1.26 1.5e-07 0.07
2000 2048 1.3e-09 2.59 2.3e-07 0.08
2000 4096 1.3e-09 4.69 2.3e-07 0.11
4096 4096 6.9e-14 10.09 9.4e-09 0.13
0.2 2000 256 1.0e-04 0.43 1.0e-04 0.07
2000 512 2.0e-06 0.84 1.7e-06 0.08
2000 1024 1.5e-06 1.25 6.0e-07 0.08
2000 2048 1.3e-06 2.55 5.7e-07 0.09
2000 4096 1.2e-06 4.48 5.7e-07 0.12
4096 4096 3.4e-09 12.60 3.4e-08 0.16
0.1 2000 256 2.4e-03 0.39 2.5e-03 0.07
2000 512 2.3e-04 0.74 2.3e-04 0.08
2000 1024 7.2e-05 1.49 4.4e-06 0.08
2000 2048 7.9e-05 2.77 1.3e-06 0.09
2000 4096 6.6e-05 5.46 1.3e-06 0.15
4096 4096 7.9e-06 10.13 3.6e-07 0.16
Table Options

Download as excel

trig interp spline interp
$\alpha$ Ns N error time error time
0.4 2000 256 1.2e-04 0.37 1.2e-04 0.06
2000 512 5.5e-06 0.89 5.5e-06 0.07
2000 1024 2.3e-08 1.26 1.5e-07 0.07
2000 2048 1.3e-09 2.59 2.3e-07 0.08
2000 4096 1.3e-09 4.69 2.3e-07 0.11
4096 4096 6.9e-14 10.09 9.4e-09 0.13
0.2 2000 256 1.0e-04 0.43 1.0e-04 0.07
2000 512 2.0e-06 0.84 1.7e-06 0.08
2000 1024 1.5e-06 1.25 6.0e-07 0.08
2000 2048 1.3e-06 2.55 5.7e-07 0.09
2000 4096 1.2e-06 4.48 5.7e-07 0.12
4096 4096 3.4e-09 12.60 3.4e-08 0.16
0.1 2000 256 2.4e-03 0.39 2.5e-03 0.07
2000 512 2.3e-04 0.74 2.3e-04 0.08
2000 1024 7.2e-05 1.49 4.4e-06 0.08
2000 2048 7.9e-05 2.77 1.3e-06 0.09
2000 4096 6.6e-05 5.46 1.3e-06 0.15
4096 4096 7.9e-06 10.13 3.6e-07 0.16
Table 3.  Convergence of the Grassmann maps (ig) for inverted ellipses, $\alpha = 0.8, 0.4, 0.2, 0.1$, ig = c = circle (crescent)map, ig = k = Koebe map. Note the fast initial convergence, but slow asymptotic convergence. Here $Ns = 400$ and $\gamma = 0.9$.
ig $\alpha$ ig $\alpha$ ig $\alpha$ ig $\alpha$
0 .800 0 .400 0 .200 0 .100
c .804 k .416 k .239 k .150
c .950 k .571 k .449 k .361
c .594 k .464 k .388
c .770 k .535 k .484
c .775 c .563 c .528
c .912 c .717 c .704
c .912 c .725 c .713
c .961 c .885 c .917
c .962 c .886 c .918
c .968 c .957 c .960
Table Options

Download as excel

ig $\alpha$ ig $\alpha$ ig $\alpha$ ig $\alpha$
0 .800 0 .400 0 .200 0 .100
c .804 k .416 k .239 k .150
c .950 k .571 k .449 k .361
c .594 k .464 k .388
c .770 k .535 k .484
c .775 c .563 c .528
c .912 c .717 c .704
c .912 c .725 c .713
c .961 c .885 c .917
c .962 c .886 c .918
c .968 c .957 c .960
Table 6.  Some typical sample timings for map to regions in Figure 22 with $m = 4$. The number of Newton iterations are fixed at 10 and the number of conjugate gradient iterations are fixed at 30. For $m = 2$, we map to the exterior of the upper and right inverted ellipses in Figure 22. We use $igm = 8$ Grassmann maps, but times are similar with no preliminary maps. The dominant operation count is the $O((mN)^2)$ matrix-vector multiplication for solving the conjugate gradient solution for the inner linear systems for the Fornberg map.
Ns N time (m=4) time (m=2)
200 128 1.45 0.77
200 256 3.65 1.64
200 512 15.92 3.36
400 128 1.71 0.73
400 256 3.54 1.11
400 512 15.66 3.28
800 128 1.56 0.81
800 256 3.62 1.16
800 512 15.73 3.30
Table Options

Download as excel

Ns N time (m=4) time (m=2)
200 128 1.45 0.77
200 256 3.65 1.64
200 512 15.92 3.36
400 128 1.71 0.73
400 256 3.54 1.11
400 512 15.66 3.28
800 128 1.56 0.81
800 256 3.62 1.16
800 512 15.73 3.30
Table 7.  Convergence of successive Newton-iteration errors $\Vert S^{i+1}-S^i\Vert_{\infty}$ at the Fourier points for the Fourier series map to the the near-circular regions for examples with corners in Figures 24, 26, and 28.
Newton iterations 3 rectangles
$N=128, Ns=201$		 Joukowski airfoil
$N=256, Ns=101$		 Two cosine airfoils
$N=128, Ns=101$
1 2.3e+01 1.0e+00 3.4e+00
2 2.3e+01 3.0e-01 3.0e-01
3 3.1e+00 2.3e-02 3.0e-03
4 1.0e+00 1.2e-04 1.6e-05
5 5.2e-01 2.1e-09 3.4e-08
6 6.4e-02 5.4e-10 1.1e-10
7 6.9e-03 5.4e-10 3.3e-13
8 1.2e-04 5.4e-10 1.7e-15
9 1.9e-06 5.4e-10 4.1e-15
10 4.0e-08 5.4e-10 9.7e-15
11 6.2e-10
12 1.3e-11
13 1.8e-13
14 1.6e-14
Table Options

Download as excel

Newton iterations 3 rectangles
$N=128, Ns=201$		 Joukowski airfoil
$N=256, Ns=101$		 Two cosine airfoils
$N=128, Ns=101$
1 2.3e+01 1.0e+00 3.4e+00
2 2.3e+01 3.0e-01 3.0e-01
3 3.1e+00 2.3e-02 3.0e-03
4 1.0e+00 1.2e-04 1.6e-05
5 5.2e-01 2.1e-09 3.4e-08
6 6.4e-02 5.4e-10 1.1e-10
7 6.9e-03 5.4e-10 3.3e-13
8 1.2e-04 5.4e-10 1.7e-15
9 1.9e-06 5.4e-10 4.1e-15
10 4.0e-08 5.4e-10 9.7e-15
11 6.2e-10
12 1.3e-11
13 1.8e-13
14 1.6e-14
[1]

Eduardo Lara, Rodolfo Rodríguez, Pablo Venegas. Spectral approximation of the curl operator in multiply connected domains. Discrete & Continuous Dynamical Systems - S, 2016, 9 (1) : 235-253. doi: 10.3934/dcdss.2016.9.235
[2]

Marion Darbas, Jérémy Heleine, Stephanie Lohrengel. Numerical resolution by the quasi-reversibility method of a data completion problem for Maxwell's equations. Inverse Problems & Imaging, 2020, 14 (6) : 1107-1133. doi: 10.3934/ipi.2020056
[3]

Piotr Bizoń, Dominika Hunik-Kostyra, Dmitry Pelinovsky. Stationary states of the cubic conformal flow on $ \mathbb{S}^3 $. Discrete & Continuous Dynamical Systems, 2020, 40 (1) : 1-32. doi: 10.3934/dcds.2020001
[4]

Matthias Eller. A remark on Littman's method of boundary controllability. Evolution Equations & Control Theory, 2013, 2 (4) : 621-630. doi: 10.3934/eect.2013.2.621
[5]

Christopher M. Kellett. Classical converse theorems in Lyapunov's second method. Discrete & Continuous Dynamical Systems - B, 2015, 20 (8) : 2333-2360. doi: 10.3934/dcdsb.2015.20.2333
[6]

Mikhail Dokuchaev, Guanglu Zhou, Song Wang. A modification of Galerkin's method for option pricing. Journal of Industrial & Management Optimization, 2021  doi: 10.3934/jimo.2021077
[7]

Lars Grüne, Peter E. Kloeden, Stefan Siegmund, Fabian R. Wirth. Lyapunov's second method for nonautonomous differential equations. Discrete & Continuous Dynamical Systems, 2007, 18 (2&3) : 375-403. doi: 10.3934/dcds.2007.18.375
[8]

Darya V. Verveyko, Andrey Yu. Verisokin. Application of He's method to the modified Rayleigh equation. Conference Publications, 2011, 2011 (Special) : 1423-1431. doi: 10.3934/proc.2011.2011.1423
[9]

Christopher Bose, Rua Murray. The exact rate of approximation in Ulam's method. Discrete & Continuous Dynamical Systems, 2001, 7 (1) : 219-235. doi: 10.3934/dcds.2001.7.219
[10]

Bernd Hofmann, Barbara Kaltenbacher, Elena Resmerita. Lavrentiev's regularization method in Hilbert spaces revisited. Inverse Problems & Imaging, 2016, 10 (3) : 741-764. doi: 10.3934/ipi.2016019
[11]

Rua Murray. Ulam's method for some non-uniformly expanding maps. Discrete & Continuous Dynamical Systems, 2010, 26 (3) : 1007-1018. doi: 10.3934/dcds.2010.26.1007
[12]

David Blázquez-Sanz, Juan J. Morales-Ruiz. Lie's reduction method and differential Galois theory in the complex analytic context. Discrete & Continuous Dynamical Systems, 2012, 32 (2) : 353-379. doi: 10.3934/dcds.2012.32.353
[13]

Jiangxing Wang. Convergence analysis of an accurate and efficient method for nonlinear Maxwell's equations. Discrete & Continuous Dynamical Systems - B, 2021, 26 (5) : 2429-2440. doi: 10.3934/dcdsb.2020185
[14]

R. Baier, M. Dellnitz, M. Hessel-von Molo, S. Sertl, I. G. Kevrekidis. The computation of convex invariant sets via Newton's method. Journal of Computational Dynamics, 2014, 1 (1) : 39-69. doi: 10.3934/jcd.2014.1.39
[15]

Jutta Bikowski, Jennifer L. Mueller. 2D EIT reconstructions using Calderon's method. Inverse Problems & Imaging, 2008, 2 (1) : 43-61. doi: 10.3934/ipi.2008.2.43
[16]

Liqun Qi, Zheng yan, Hongxia Yin. Semismooth reformulation and Newton's method for the security region problem of power systems. Journal of Industrial & Management Optimization, 2008, 4 (1) : 143-153. doi: 10.3934/jimo.2008.4.143
[17]

Hao Wang, Wei Yang, Yunqing Huang. An adaptive edge finite element method for the Maxwell's equations in metamaterials. Electronic Research Archive, 2020, 28 (2) : 961-976. doi: 10.3934/era.2020051
[18]

Paweł Góra, Abraham Boyarsky. Stochastic perturbations and Ulam's method for W-shaped maps. Discrete & Continuous Dynamical Systems, 2013, 33 (5) : 1937-1944. doi: 10.3934/dcds.2013.33.1937
[19]

Yongsheng Song. Stein’s method for the law of large numbers under sublinear expectations. Probability, Uncertainty and Quantitative Risk, 2021, 6 (3) : 199-212. doi: 10.3934/puqr.2021010
[20]

Robert Denk, Leonid Volevich. A new class of parabolic problems connected with Newton's polygon. Conference Publications, 2007, 2007 (Special) : 294-303. doi: 10.3934/proc.2007.2007.294

2020 Impact Factor: 1.327

Tools

Metrics

  • PDF downloads (272)
  • HTML views (852)
  • Cited by (0)

Other articles
by authors

[Back to Top]

Copyright © 2022 American Institute of Mathematical Sciences | Privacy Policy