Table of Contents Author Guidelines Submit a Manuscript
Journal of Complex Analysis
Volume 2016 (2016), Article ID 4367205, 8 pages
Research Article

Approximate Conformal Mappings and Elasticity Theory

Kazan Federal University, 18 Kremlyovskaya Str., Kazan 420008, Russia

Received 4 June 2016; Revised 25 July 2016; Accepted 3 August 2016

Academic Editor: Vladislav Kravchenko

Copyright © 2016 Pyotr N. Ivanshin and Elena A. Shirokova. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Here, we present the new method of approximate conformal mapping of the unit disk to a one-connected domain with smooth boundary without auxiliary constructions and iterations. The mapping function is a Taylor polynomial. The method is applicable to elasticity problems solution.

1. Introduction

Conformal mappings play an important part in solution of elasticity theory problems if we apply to them complex variable theory. These investigations were started by Muskhelishvili [1]. Muskhelishvili considered multiple solution methods of certain plane problems in the cited monograph. In particular, he gave the solution technique for basic plane elasticity theory problems and that for the rods torsion. In order to do this, the author made an extensive use of conformal mappings from the unit disk to a given domain. The easiest solution appears in the case of the polynomial mapping.

Computer progress stimulated appearance of many numerical conformal mapping construction methods. Many of these methods were connected with the integral equation solutions. If we want to map a given simply connected domain to the disk, then we solve a linear integral equation either analytically or numerically (see, e.g., [25]). Note that if we want to map the disk to the given simply connected domain, then this problem solution turns out to be significantly harder and is traditionally reduced to nonlinear Theodorsen equation solution. The effective Wegmann method of this equation solution is based on iteration processes [6, 7].

The approximate conformal mapping of the unit disk to the given domain construction method presented here has the following advantages: it does not use any auxiliary constructions (triangulation, circle packing) or additional conformal mappings (zipper algorithm), it does not use accessory solutions of boundary value problems (conjugate function method, Wegmann method), and it even does not use iterations as Wegmann method or Fornberg method where the preimages of the given-on-the-unit circle points move along the given curve [8]. We solve the integral Fredholm equation. This equation is well known and allows us to construct the conformal mapping of the given domain onto the unit disk [9]. But we use this equation in order to find the monotone function that determines the necessary reparametrization of the given boundary. Moreover, our method provides us with the smooth solution in the form of Taylor polynomial. So it is possible to find the derivatives of the solutions. Also the method is connected with the domain boundary curve reparametrization described in [10].

The auxiliary function involved in the function inverse to the reparametrizing one can be found by integral equation solution. This solution is reduced to solution of the infinite system whose truncated form is regulated by two different polynomial coefficients calculation methods. If the system size is reasonable, then both formulas lead to close values of the desired coefficients. We present the example of nonconvex domain and construct the approximate conformal mapping of the unit disk onto this domain with the help of the boundary curve reparametrization.

The example of the unit disk mapping onto the hypotrochoid interior leads to solution of plane elasticity problems. With the help of the constructed approximate mapping functions, we analytically find the boundary shear stresses and draw the corresponding graphs.

We also give the example of one boundary value problem solution for the corresponding domain which is reduced to finite linear equation system solution according to results of Muskhelishvili [1]. The approximate spline-interpolation solution of 3D boundary value problems for bars can be reduced to solution of a number of plane boundary value problems. We consider the 3D element of the bar with the hypotrochoidal cut and its deformation under the given boundary displacements at two levels.

2. Approximate Conformal Mapping Construction by Means of the Boundary Reparametrization

The method was introduced and theoretically described in [10]. Here, we give only the scheme of the function construction.

Consider a finite simply connected domain bounded by the smooth curve and We trace the domain counterclockwise along as the parameter increases. We only deal with the cases in which the boundary representation is as follows:Note also that any smooth boundary may be approximated by a Fourier polynomial of this type.

If Fourier polynomial representation (1) of the curve possesses no summands with the negative degrees of , then the function that maps the unit disk onto the domain is immediately polynomial:

Assume now that representation (1) contains nonzero coefficients , . Then, it is possible to construct an approximate conformal mapping under reparametrization of (1) [10] leading to the coefficients , , elimination.

In order to find this reparametrization , , we first construct the inverse function

Let be the analytic function that gives the conformal mapping of onto the unit domain so that . The necessary condition for the function to be analytic in is just as in [10]:where .

We consider the factor in the expression of in order to separate the improper VP integral in the last integral equation. Finally, the function is the solution of the Fredholm integral equation of the second kind:where are continuous operators.

Note thatHere are the equation roots inside the unit disk, and are the roots of the same equation outside this disk.

Equation (4) is uniquely resolvable if we set the value , for example. Indeed, this equation is the necessary condition for the function with boundary value to be analytic in .

Lemma 1. Let the numbers and a constant exist so that and the function possess the bounded second derivative: . Then, the approximate solution of the uniquely resolvable Fredholm integral equation of the second kindwhere is periodic and is periodic with respect to both variables, can be reduced to solution of a finite linear system with error estimated by . Here, is the finite linear system rank.

Proof. We search for the solution in the form of Fourier series and present the kernel in the form of double Fourier series. Note that the restrictions on the kernel of integral equation and on the function yield the following estimates of the kernel Fourier coefficients, , and of Fourier coefficient . We denote by the vector of the function Fourier coefficients and by the vector of the function Fourier coefficients. Now the integral equation reduces to the infinite linear system which can be presented as follows: Here, is an matrix, is an matrix, is an matrix, is an matrix, and and are the identity matrices of relative sizes. Each of the vectors and has coordinates; the vectors and have the infinite number of coordinates. The Fourier coefficients of the smooth functions tend to zero as their numbers tend to infinity, so the coefficients of the matrices , and together with the coordinates of decrease rapidly as . Therefore, the matrix norm of and the vector norm of tend to zero as .
Let us prove that there exists the number such that the matrix operator is invertible since the limit for integral operator is compact and the operator is invertible due to the lemma assumption. Note that we do not distinguish a finite dimensional vector and the Fourier polynomial with the corresponding finite coefficient set in our proof. Recall first that, due to chapter VI, paragraph 1 of [11], as . Assume that there exists such that the spectrum of contains . Then, there exists an infinite sequence such that and . Let us prove that then there should exist at least one limit point for the sequence . Since the operator is compact, there exist both a subsequence and an element so that , . Then, = + + , . Thus, = , . Hence, , . Note that since , , the element is nondegenerate. Let us show now that the relation holds true. Indeed, we have = + + + + , . Hence, the spectrum of contains , a contradiction with one of the assumptions.
We now take the number so that and the matrix possesses the inverse one. Now we have the relation Obviously, one can choose the value of so large that , where is arbitrary small. Now we estimate the norm of the difference between the solution and the solution of the truncated system : Consider the first summand on the right-hand side of the last inequality. This is the summand that is determined by the operator approximation. The vector norm of can be estimated by D. Jackson’s inequality by . The second summand (due to the series tail) also behaves no better than . So the error is .

We search for the integral equation solution in the form of the Fourier series: The approximate solution then is the finite sum here, the number can be found from conditions that will be described later.

Now the approximate solution of the integral equation reduces to solution of the linear equation system here

The vectors on the right-hand side of the system consist of elements

The block matrices of size consist of elements here, is the Kronecker delta function.

The numbers and are fixed. So the standard Jenkins-Traub algorithm provides us with the given polynomial roots in calculation. Moreover, we can find this integral if we consider the Fourier decomposition of the function . Really, if then according to the Hilbert formula

So there is a way to omit the polynomial roots calculation.

The constructed function must be monotone increasing. We construct the function inverse to it—the necessary reparametrization —with the help of FORTRAN spline function apparatus. According to Chapter 3 of [12], the algorithm computational complexity is . Assume now that we use -digit base floating point arithmetic. Then, formula (3.5.2) of [12] gives us the calculation estimate: Here, is the computed solution.

This reparametrization allows us to construct the function , , realizing the approximate conformal mapping on the given domain as a partial sum of the Taylor series: here,

Existence of two different coefficient and forms for the mapping function allows us to control the precision of the function calculation by choosing the size of the block matrices and the number of Fourier polynomial coefficients for this function .

We can also find the function , , by solving the integral equation with respect to its derivative:where

Now the coefficients of the desired polynomial must be calculated via the formulas

This way of the mapping function construction does not demand the inverse function . So it is better than the initial one when we use differentiation technics.

2.1. Examples of a Conformal Mapping to Nonconvex Domains

() We apply the conformal mapping construction method to the domain with the boundary parametrized as

The corresponding domain is not convex and even not starlike with respect to the origin. The image of the unit disk and the images of the curves and are presented in Figure 1. Here, we construct the function as a polynomial of degree . The constructed arrays and consist of .435195, 0.217, 0.0445382, −0.0644157, −0.122302, −0.136071, −0.108288, −0.0509652, 0.0114895, 0.0536582, 0.0630275, 0.0446863, 0.0148454, −0.0102395, −0.0220771, −0.0210932, −0.0128945, −0.0035683, 0.00312581, 0.00613953, 0.00613603, 0.00435355, 0.00194512, −0.000234746, −0.00165981, −0.00213913, −0.00179842, −0.000986218, −0.0001117, and 0.000514721 and −0.121471, −0.246766, −0.242473, −0.18307, −0.104088, −0.0205432, 0.0508998, 0.0906061, 0.0887171, 0.053735, 0.0077085, −0.0271662, −0.0397708, −0.0324245, −0.0154014, 0.000768445, 0.0101997, 0.0122604, 0.00942934, 0.00477677, 0.000505807, −0.00232866, −0.00350766, −0.00328453, −0.00215714, −0.000716349, 0.0005076, 0.00118776, 0.00126574, and 0.000905516, respectively.

Figure 1: Nonconvex domain and the image of the regular polar net.

The boundary point crowding in the example equals to .

() Consider the approximation of the curve given by equation . The curve is similar to the curves considered in [8].

Again we construct the function as a polynomial of degree . The array then consists only of odd elements , . The array elements simply vanish. The boundary point crowding in the example in Figure 2 equals to . The approximation to the initial curve is . Note that in this case we need a resulting polynomial of degree ; here, is the greatest possible boundary point crowding. Also this example shows us that there is no strong connection between and the border point crowding. The number determines the precision with which we construct either the monotone function or its derivative that we need for reparametrization.

Figure 2: The curve and the image of the regular polar net.

The following section gives the example of the approximate conformal mapping applicable to the plane elasticity theory.

3. The Example of Conformal Mapping onto the Interior of the Hypotrochoid Close to the Hexagon with the Smoothened Angles

Consider the complex parametric hypotrochoid equation:

We fix ; item (a) of Figure 3 shows this hypotrochoid.

Figure 3: The mappings of the unit disk onto the hypotrochoidal interior: (a) hypotrochoid, (b) map of the unit disk, and (c) map of the unit disk.

Now we construct the mapping of the unit disc onto this hypotrochoid interior applying the procedure described above. We solve (4) and find the polynomial mapping function. The mapping of the unit circle relatively well visually approximates the boundary curve of the hypotrochoid even for 19 first coefficients (): The corresponding domain is given by item (b) of Figure 3.

Item (c) of Figure 3 demonstrates the map of the unit disk by the polynomial of the 97th degree and the polar coordinate net transform under the mapping.

We also find the smooth solution after solving (24) and corresponding reparametrization of the given hypotrochoid. We name this polynomial function the smooth mapping.

3.1. Solution of the Torsion Problem for the Bar with the Hypotrochoidal Section

We examine the boundary shear stresses for the twisted bar with the hypotrochoidal interior as the cross section. We base the solution of the torsion problem on relation (13) of [1], Chapter 7: the value of the shear stress is proportional to the expression where is the polynomial mapping of the unit disk onto the hypotrochoid interior and is the analytic in the unit disk function with the boundary condition

The contour values of the tangent shear stress , , were found for the functions of the preceding section: for the mapping , for the mapping , and for the smooth mapping. Figure 4 shows the graphs of the function for these mappings.

Figure 4: Shear stresses found for different functions: (a) for , (b) for , and (c) for smooth mapping.

Each of the graphs shows that the minimal possible stress values happen in the points that correspond to the “hexagon vertices” and the maximal values are in the edges centers.

3.2. Solution of the Second Basic Elasticity Problem

We consider the second plane boundary value problem for a domain that is the image of the unit disk under the conformal mapping . Due to results of [1], we can reduce the problem to finding the analytic in the unit disk functions and , , via the boundary condition ([1, Chapter 2, formula ()])here, , , is the given function, is the number depending on Lamé coefficients, , and . The functions and are analytic in and are called the complex potentials of the plane elasticity theory [1]. The basic equation system for the polynomial mapping function was constructed in [1].

We solved this problem for the hypotrochoid interior in the case of , . Figure 5 shows us the displacements of points of the concentric curves being the images of .

Figure 5: Hypotrochoid interior section and concentric inner circles displacements.
3.3. Spline-Interpolation Solution of the 3D Second Basic Elasticity Problem

Consider now the 3D second basic elasticity theory problem for a bar parallel to -axis in the space with coordinates . We say that the spline-interpolation solution of this problem is the approximate solution which satisfies the elasticity equations and the boundary displacements at the finite number of levels , , and approximates the displacements at the end faces of the bar. Assume that we construct a linear spline following [13]. Then, the solution is constructed for each element in the linear form on components of the displacement vector—the functions and . In order to find the functions , , , we apply the boundary conditions on the levels and . Then, the function is a biharmonic function that meets equation coinciding with (32) and the function is simply harmonic. The corresponding analytic functions can be restored via the boundary conditions. The functions and can also be restored via the respective conditions on their boundary values.

We construct as an example the element where is the hypotrochoid interior. We assume that and meet the same boundary condition as in the case of the plane example on the level , and vanish on the boundary of at the level , and the third coordinate displacement also vanishes on the boundaries at both levels. Then, the function is the same as that in the example of plane problem and . The other components of displacement vector can be calculated in terms of the variable , . The displacements of the element upper (a) and lower (b) end faces are given by Figure 6.

Figure 6: Top and bottom section deformations.

Spline degree increase allows us not only to glue the adjacent element splines over the boundary of the common section but also to approximate these splines values over this common section in space.

The spline-interpolation solution is particularly effective in comparison with the FEM for the bodies with singular boundary points, for example, cones [14].

4. Conclusion

The conformal mapping method suggested in the paper is computationally efficient (of computational complexity) and does not need any iterations. It provides us with the polynomial mapping function. This approximate conformal mapping method simplification for an arbitrary simply connected domain with smooth boundary makes it possible to apply the conformal mapping for many problems of elasticity. These problems reduce then to solution of linear equation systems.

Competing Interests

The authors declare that they have no competing interests.


The work was partly supported by the Russian Government Program of Competitive Growth of Kazan Federal University.


  1. N. I. Muskhelishvili, Some Basic Problems of the Mathematical Theory of Elasticity, Nauka, Moscow, Russia, 1966.
  2. B. C. Li and S. Syngellakis, “Numerical conformal mapping based on the generalised conjugation operator,” Mathematics of Computation, vol. 67, no. 222, pp. 619–639, 1998. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. G. T. Symm, “An integral equation method in conformal mapping,” Numerische Mathematik, vol. 9, pp. 250–258, 1966. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. T. K. DeLillo, “The accuracy of numerical conformal mapping methods: a survey of examples and results,” SIAM Journal on Numerical Analysis, vol. 31, no. 3, pp. 788–812, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. D. M. Hough and N. Papamichael, “An integral equation method for the numerical conformal mapping of interior, exterior and doubly-connected domains,” Numerische Mathematik, vol. 41, no. 3, pp. 287–307, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. R. Wegmann, A. H. M. Murid, and M. M. S. Nasser, “The Riemann-Hilbert problem and the generalized Neumann kernel,” Journal of Computational and Applied Mathematics, vol. 182, no. 2, pp. 388–415, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. R. Wegmann, “An iterative method for conformal mapping,” Journal of Computational and Applied Mathematics, vol. 14, no. 1-2, pp. 7–18, 1986. View at Publisher · View at Google Scholar · View at MathSciNet
  8. B. Fornberg, “A numerical method for conformal mappings,” SIAM Journal on Scientific and Statistical Computing, vol. 1, no. 3, pp. 386–400, 1980. View at Publisher · View at Google Scholar · View at MathSciNet
  9. S. E. Warschawski, “On conformal mapping of variable regions,” National Bureau of Standards Publications (NBS), vol. 18, pp. 175–187, 1952. View at Google Scholar
  10. E. A. Shirokova, “On approximate conformal mapping of the unit disk on an simply connected domain,” Russia Mathematics (Iz VUZ), vol. 58, no. 3, pp. 47–56, 2014. View at Google Scholar
  11. L. A. Lyusternik and V. I. Sobolev, “The elements of functional analysis,” Gosudarstv. Izdat. Tehn.-Teor. Lit., Moscow-Leningrad, 1951.
  12. G. H. Golub and C. F. Van Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, Md, USA, 1996.
  13. E. A. Shirokova, Spline-Interpolation Solution of One Elasticity Theory Problem, Bentham Science, Oak Park, Ill, USA, 2011.
  14. P. N. Ivanshin, L. R. Sekaeva, and E. A. Shirokova, “On the approximate solutions of the second basic elasticity theory problem,” Lobachevskii Journal of Mathematics, vol. 31, no. 4, pp. 376–388, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus