IJEM International Journal of Engineering Mathematics 2314-6109 2356-7007 Hindawi Publishing Corporation 10.1155/2015/523043 523043 Research Article An Efficient Method to Find Solutions for Transcendental Equations with Several Roots Luck Rogelio 1 Zdaniuk Gregory J. 2 Cho Heejin 1 Cen Song 1 Department of Mechanical Engineering Mississippi State University P.O. Box 9552 Mississippi State, MS 39762 USA msstate.edu 2 Cofely UK Kings Yard 1 Waterden Road Queen Elizabeth Olympic Park London E15 2GP UK cofely-gdfsuez.co.uk 2015 15102015 2015 17 07 2015 06 10 2015 07 10 2015 15102015 2015 Copyright © 2015 Rogelio Luck et al. 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.

This paper presents a method for obtaining a solution for all the roots of a transcendental equation within a bounded region by finding a polynomial equation with the same roots as the transcendental equation. The proposed method is developed using Cauchy’s integral theorem for complex variables and transforms the problem of finding the roots of a transcendental equation into an equivalent problem of finding roots of a polynomial equation with exactly the same roots. The interesting result is that the coefficients of the polynomial form a vector which lies in the null space of a Hankel matrix made up of the Fourier series coefficients of the inverse of the original transcendental equation. Then the explicit solution can be readily obtained using the complex fast Fourier transform. To conclude, the authors present an example by solving for the first three eigenvalues of the 1D transient heat conduction problem.

1. Introduction

The determination of roots of transcendental functions is a problem commonly encountered in a broad spectrum of engineering applications, such as heat transfer (e.g., ), dynamics and control (e.g., ), sound and vibration (e.g., [6, 7]), and quantum mechanics (e.g., ). There exist a wide variety of numerical methods that are useful for approximating the solution to any desired degree of accuracy. General descriptions of common root finding techniques are available in most textbooks in the area of numerical analysis, for example, Chapra and Canale .

Explicit methods have also been developed to find roots of transcendental equations. Explicit solutions can provide more insight into the problem under consideration. They are also useful, for example, in the development of analytical derivatives for uncertainty analyses and sensitivity studies or for checking convergence of approximate root finding techniques . Leathers and McCormick  addressed a methodology for obtaining explicit solutions to several transcendental problems arising in heat transfer. The general approach used was based on methods of Muskhelishvili  and was developed by Burniston and Siewert . This approach “depends on formulating an appropriate Riemann problem of complex variable theory and then expressing the solution of the transcendental equation in terms of a canonical solution of that problem” . Luck and Stevens  formulated an explicit expression for a single root of any analytic transcendental function. Their method is based on Cauchy’s integral theorem and uses only basic concepts of complex integration to determine the root of a function by locating the singularity of the reciprocal of the function. It has now been found that this idea was initially proposed by Jackson [14, 15]. The current paper extends their idea presenting a method for finding several roots of transcendental equations within a bounded region by transforming the problem into an equivalent problem of finding roots of a polynomial equation with exactly the same roots. It follows that an explicit solution is readily available through the complex fast Fourier transform (cfft) when dealing with up to four roots at a time. For five or more roots the solution is implicit according to the Abel-Ruffini theorem . The implicitness of finding roots of fifth- and higher-order polynomials is not really an issue as algorithms designed for this task are readily available (McNamee , McNamee and Pan ) or larger problems can be divided into smaller problems by analyzing nonoverlapping bounded regions with four roots or less in each region.

2. Method Development

Suppose f ( x ) is a transcendental function with N roots within an interval of width 2 · R and center h such that h - R < x < h + R . Let p ( x ) be an N th-order polynomial with roots located at exactly the same locations as the roots of f ( x ) in the interval h - R < x < h + R . The ratio p ( x ) / f ( x ) is an analytic function in the interval h - R < x < h + R because the poles of 1 / f ( x ) in the interval are cancelled out by the roots of p ( x ) . The next step in the analysis is to normalize the variable of interest. Let (1) y = x - h R such that - 1 < y < 1 . Functions f ( x ) and p ( x ) can be recast as (2) f x = f R · y + h = F y , p x = p R · y + h = P y , where (3) P y = k = 0 N c k y k and N is the number of roots in the interval.

Now consider the function P ( y ) / F ( y ) in the interval - 1 < y < 1 . If the analysis is extended into the complex plane (by substituting the real variable y with the complex variable z ), integration around a circular path of radius 1 yields (4) P z F z d z = 0 which is a consequence of Cauchy’s theorem regarding the line integral of a function that is analytic on and inside of the contour defined by the closed path of integration.

Equation (4) can be used to find the coefficients c k of polynomial P ( y ) as follows: (5) P z F z d z = k = 0 N c k z k F z d z = k = 0 N c k z k F z d z = 0 .

Note that, given a positive integer r , it is also true that (6) z r P z F z d z = 0 because the function being integrated remains analytic when multiplied by z r . Following the approach presented in (5) (7) z r P z F z d z = k = 0 N c k z k + r F z d z = 0 .

Following is the procedure for obtaining coefficients c k . First, the integrals are evaluated by substituting (8) z = e j θ , d z = j e j θ d θ . Let (9) G θ = 1 F e j θ . It follows that (10) z r + k F z d z = 0 2 π G θ e j θ r + k j e j θ d θ = j 0 2 π G θ e j r + k + 1 θ d θ . Another simplification can be implemented by defining (11) G k = 0 2 π G θ e j k θ d θ . Note that G k can be interpreted as the k th complex Fourier series coefficient of G ( θ ) . Finally, substituting G k into (7) and cancelling j yield (12) k = 0 N c k G r + k + 1 = 0 .

Equation (12) is the equation used to find coefficients c 0 , c 1 , c 2 , , c N . Note that (12) is true for any positive integer value of r . This means that one can “create” as many equations as there are unknown coefficients c k . Varying r from 0 to N - 1 , the following system of equations is obtained: (13) G 1 G 2 G 3 G 4 G N + 1 G 2 G 3 G 4 G 5 G N + 2 G 3 G 4 G 5 G 6 G N + 3 G N G N + 1 G N + 2 G N + 3 G 2 N c 0 c 1 c 2 c N = 0 . Because (13) represents a system of linearly dependent equations, that is, having fewer equations than unknowns, additional equations are necessary to obtain a solution. One possible equation consists of setting c N equal to any real nonzero number, which allows moving the last column of the G matrix to the right hand side.

Equation (13) is worthy of comment. Matrix G is composed solely of Fourier series coefficients, implying that the equations do not depend on normalization factors used to compute the Fourier series coefficients. In practice, the coefficients of G are approximated through the complex fast Fourier transform (cfft). The cfft approximation is less accurate for the last column of the G matrix because this column corresponds to high-frequency terms. It follows that moving the last column of the G matrix to the right hand side of the equation results in a slightly more robust solution. Furthermore, the system of equations constitutes a Hankel matrix for which an inverse can be easily obtained . Therefore, (13) can be quickly implemented and solved for the coefficients c k . Finally, the symmetry or “structure” of (13) leads the authors to believe there is a deeper meaning to this system of equations.

3. Example

To illustrate the current method, a simple yet helpful example is described below. The solution of the unsteady heat conduction equation yields the characteristic equation or eigenfunction of the following form : (14) x tan x = Bi .

Equation (14) is a transcendental equation with an infinite number of roots called characteristic values or eigenvalues. The characteristic equation in this case is implicit. Arbitrarily assuming Bi = 1 , (14) can be rewritten as (15) x tan x - 1 = 0 . Let (16) f x = x tan x - 1 .

The plot of f ( x ) is shown on Figure 1.

Plot of f ( x ) .

The method described in the previous section is now applied to solve for the first three positive roots of (16). Figure 1 illustrates that the three roots occur in the interval 0 < x < 8 , suggesting h = 4 , R = 4 , and N = 3 . Note that one simple way of approximating coefficients G k is to discretize G ( θ ) for θ 0 , 2 π and to use the complex fast Fourier transform (cfft) readily available in many commercial mathematical software packages (e.g., MATLAB and Mathcad), rather than performing the integral of (11). With c 3 = 1 and N = 3 , (13) becomes (17) G 1 G 2 G 3 G 2 G 3 G 4 G 3 G 4 G 5 c 0 c 1 c 2 = - G 4 G 5 G 6 . Discretizing θ into 256 equidistant points, the cfft yields (18) 2.846 - 0.768 1.014 - 0.768 1.014 - 0.476 1.014 - 0.476 0.559 c 0 c 1 c 2 = 0.476 - 0.559 0.324 . Solving this system of equations gives (19) c = - 0.069 - 0.453 0.319 1 which translates into (20) P y = - 0.069 - 0.453 y + 0.319 y 2 + y 3 .

Figure 2 plots the original transcendental function F ( y ) and the polynomial P ( y ) . The plot clearly shows that the polynomial has the same roots as the original function F ( y ) ; that is, y = - 0.785 , y = - 0.144 , and y = 0.609 . The roots of a cubic polynomial can be found using the explicit algebraic expressions given by many authors, for example, Abramowitz and Stegun , Press et al. , and Weisstein . Finally, undoing the variable normalization yields x = 0.860 , x = 3.426 , and x = 6.437 as the roots of f ( x ) or eigenvalues of the original problem.

Plot of P ( y ) and F ( y ) with locations of the roots.

4. Conclusion

The current paper presents a method for finding simultaneously several roots of a transcendental equation f ( x ) within a bounded region, by transforming the problem into an equivalent problem of finding roots of a polynomial equation p ( x ) with exactly the same roots. The method requires that the ratio p ( x ) / f ( x ) be analytic in the interval under study. The concept shown here is that the correlation between the roots of a transcendental function and the Fourier series coefficients of its inverse can be expressed with a polynomial and proven with Cauchy’s integral theorem.

The advantage of the current method is the possibility of solving for several roots in one shot and is most evident when dealing with an implicit problem as shown in the previous example. In this case, an implicit problem was transformed into a simpler explicit one. The current method remains explicit when dealing with up to four roots. However, the implicitness of finding roots of higher-order polynomials is not really an issue as algorithms designed for this task are readily available or larger problems can be divided into smaller problems with four roots each by selecting appropriate intervals as illustrated in Section 3. In any case, the current method provides a relatively simple solution procedure for a group of problems encountered in many engineering applications.

Notation Bi :

Biot number

c k :

k th coefficient of the polynomial P ( y )

f :

Function of x

F :

Function of y

G :

Function of θ

G k :

k th Fourier series coefficient of function G

h :

Center of a circle in the complex plane

N :

Number of roots

p :

Polynomial, function of x

P :

Polynomial, function of y

r :

Positive integer

R :

Radius of a circle in the complex plane

x :

Independent variable

y :

Normalized variable

z :

Complex variable

θ :

Angle in the complex plane.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Phelps J. S. III Funcheon M. J. Solutions of a transcendental equation basic to the study of composite media heat transfer Journal of Computational and Applied Mathematics 1984 10 2 135 139 10.1016/0377-0427(84)90049-9 2-s2.0-0021415725 Stevens J. W. Luck R. Explicit approximations for all eigenvalues of the 1-D transient heat conduction equations Heat Transfer Engineering 1999 20 2 35 41 10.1080/014576399271565 2-s2.0-0032633793 Haji-Sheikh A. Beck J. V. An efficient method of computing eigenvalues in heat conduction Numerical Heat Transfer Part B: Fundamentals 2000 38 2 133 156 10.1080/104077900750034643 de Monte F. Multi-layer transient heat conduction using transition time scales International Journal of Thermal Sciences 2006 45 9 882 892 10.1016/j.ijthermalsci.2005.11.006 2-s2.0-33745647299 Ruan S. Wei J. On the zeros of transcendental functions with applications to stability of delay differential equations with two delays Dynamics of Continuous, Discrete and Impulsive Systems, Series A: Mathematical Analysis 2003 10 6 863 874 2-s2.0-1842465386 Aleshin N. P. Kamenskii V. S. Mogil'ner L. I. Solution of a transcendental equation encountered in diffraction problems Journal of Applied Mathematics and Mechanics 1983 47 1 139 141 10.1016/0021-8928(83)90049-7 ZBL0526.73034 2-s2.0-0020908089 Ruggiero C. M. Solution of transcendental and algebraic equations with applications to wave propagation in elastic plates NASA STI/Recon Technical Report 1981 81 Pickett G. Millev Y. On the analytic inversion of functions, solution of transcendental equations and infinite self-mappings Journal of Physics A: Mathematical and General 2002 35 20 4485 4494 10.1088/0305-4470/35/20/308 ZBL1062.30045 2-s2.0-0037166209 Chapra S. C. Canale R. P. Numerical Methods for Engineers 1998 3rd New York, NY, USA McGraw-Hill Leathers R. A. McCormick N. J. Closed-form solutions for transcendental equations of heat transfer Journal of Heat Transfer 1996 118 4 970 973 10.1115/1.2822596 2-s2.0-0030499142 Muskhelishvili N. I. Singular Integral Equations 1953 Groningen, The Netherlands Noordhoff Burniston E. E. Siewert C. E. The use of Riemann problems in solving a class of transcendental equations Mathematical Proceedings of the Cambridge Philosophical Society 1973 73 1 111 118 10.1017/S0305004100047526 Luck R. Stevens J. W. Explicit solutions for transcendental equations SIAM Review 2002 44 2 227 233 10.1137/S0036144501386111 ZBL1094.30008 2-s2.0-0036601380 Jackson D. Non-essential singularities of functions of several complex variables The Annals of Mathematics 1916 17 4 172 179 10.2307/2007204 Jackson D. Roots and singular points of semi-analytic functions The Annals of Mathematics 1917 19 2 142 151 10.2307/1967771 Dehn E. Algebraic Equations: An Introduction to the Theories of Lagrange and Galois 1930 New York, NY, USA Columbia University Press McNamee J. M. A bibliography on roots of polynomials Journal of Computational and Applied Mathematics 1993 47 3 391 394 10.1016/0377-0427(93)90064-I ZBL0788.65056 2-s2.0-0027667665 McNamee J. M. A supplementary bibliography on roots of polynomials Journal of Computational and Applied Mathematics 1997 78 1 1 10.1016/s0377-0427(96)00147-1 McNamee J. M. An updated supplementary bibliography on roots of polynomials Journal of Computational and Applied Mathematics 1999 110 2 305 306 10.1016/S0377-0427(99)00273-3 ZBL0933.65046 2-s2.0-0038832591 McNamee J. M. Numerical Methods for Roots of Polynomials, Part 1, Studies in Computational Mathematics 2007 14 Cambridge, Mass, USA Elsevier Science McNamee J. M. Pan V. Numerical Methods for Roots of Polynomials, Part II 2013 16 Cambridge, Mass, USA Elsevier Science Studies in Computational Mathematics Golub G. H. Van Loan C. F. Matrix Computations 1996 3rd Baltimore, Md, USA Johns Hopkins University Press Cengel Y. A. Heat Transfer: A Practical Approach 2005 3rd New York, NY, USA McGraw-Hill Abramowitz M. Stegun I. A. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables 1972 9th New York, NY, USA Dover Publications Press H. Teukolsky S. A. Vetterling W. T. Flannery B. R. Numerical Recipes in Fortran 77: The Art of Scientific Computing 1992 Cambridge University Press Weisstein E. W. CRC Concise Encyclopedia of Mathematics 2002 2nd Boca Raton, Fla, USA CRC Press MR1944431