IJCMP | On New Root Finding Algorithms for Solving Nonlinear Transcendental Equations

Indexing and Abstracting

On New Root Finding Algorithms for Solving Nonlinear Transcendental Equations

Tekle Gemechu , Srinivasarao Thota

International Journal of Chemistry, Mathematics And Physics(IJCMP), Vol-4,Issue-2, March - April 2020, Pages 18-24 , 10.22161/ijcmp.4.2.1

Download | Downloads : 7 | Total View : 1158

Abstract:

In this paper, we present new iterative algorithms to find a root of the given nonlinear transcendental equations. In the proposed algorithms, we use nonlinear Taylor’s polynomial interpolation and a modified error correction term with a fixed-point concept. We also investigated for possible extension of the higher order iterative algorithms in single variable to higher dimension. Several numerical examples are presented to illustrate the proposed algorithms.

Keywords:

References:

[1] Mező, I: On the structure of the solution set of a generalized Euler–Lambert equation, J. Math.Anal.Appl.455 (2017), 538-553.
[2] W. Kahan, Emeritus: Notes on real root-finding, Math. Dept., and E.E. & Computer Science Dept., University of California at Berkeley, 2016 (https://people.eecs.berkeley.edu/~wkahan/Math128/RealRoots.pdf)
[3] C. Chun, B. Neta: A third-order modification of Newton’s method for multiple roots, Applied Mathematics and Computation, 211 (2009), 474–479.
[4] B. N. Datta: Numerical solution of root-finding problems (lecture note), DeKalb, IL. 60115 USA; URL: www.math.niu.edu/~dattab
[5] G. Dahlquist, A. Bjorck: Numerical methods in scientific computing, Volume-I, Siam Society for industrial and applied mathematics. Philadelphia, USA. 2008.
[6] J. Gerlach: Accelerated convergence in Newton’s method, Society for industrial and applied mathematics, Siam Review 36 (1994), 272-276.
[7] M. Hussein: A note on one-step iteration methods for solving nonlinear equations, World Applied Sciences Journal, 7 (special issue for applied math) (2009), 90-95.
[8] Y. Jin, B. Kalantari: A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity, American Mathematical Society, 138 (2010), 1897-1906.
[9] K. Jisheng, L. Yitian, W. Xiuhua: A uniparametric Chebyshev-type method free from second derivative, Applied Mathematics and Computational, 179 (2006), 296-300.
[10] S. Li, R. Wang: Two fourth order iterative methods based on Continued Fraction for root finding problems, World Academy, 2011.
[11] J. Stoer, R. Bulirsch: Texts in Applied mathematics, 12, Introduction to Numerical Analysis (2nd ed.), springer-Verlag New York, Inc., USA, 1993.
[12] S. Li, R. Wang: Two fourth order iterative methods based on Continued Fraction for root finding problems, World Academy of Science, Engineering and Technology 60, 2011.
[13] L. D. Petkovic , M. S. Petkovic: On the fourth order root finding methods of Euler type, Novisad J. Math., 36 (2006), 157-165.
[14] G. Albeanu: On the generalized Halley method for solving nonlinear equations, Romai journal, 4 (2008), 1-6.
[15] M. K. Jain, S. R. K. Iyenger, R. K. Jain: Numerical Methods for Scientific and Engineering Computation. New Age International (P) Limited Publishers, 2007.
[16] M. Noor, F. A. Shah, K. I. Noor, E. Al-Said: Variation iteration technique for finding multiple roots of nonlinear equations, Scientific Research and Essays, 6 (2011), 1344-1350.
[17] Pakdemirli, H. Boyacl, H. A. Yurtsever: A root finding algorithm with fifth order derivatives, Mathematical and Computational Applications, 13 (2008), 123-128.
[18] A. Quarteroni, R. Sacco, F.Saleri: Numerical mathematics (Texts in applied mathematics; 37), Springer-Verlag New York, Inc., USA, 2000.
[19] A. Ralston, P. Rabinowitz: A first course in numerical analysis (2nd ed.), McGraw-Hill Book Company, New York, 1978.
[20] S. Thota: A New Root-Finding Algorithm Using Exponential Series, Ural Mathematical Journal, 5(1) (2019), 83-90.
[21] G. Tekle: Root Finding For Nonlinear Equations, IISTE, 8 (7) (2018), 18-25.
[22] G. Tekle: Some Multiple and Simple Real Root Finding Methods, IISTE, 7 (10) (2017), 8-12.
[23] G. Tekle: Root Finding With Engineering Applications, EJSSD, 3 (2) (2017), 101-106.
[24] C. Chapra: Applied Numerical methods with Matlab for Engineers and Scientists (3rd ed.), McGraw Hill Education (India), New Delhi, 2012.
[25] S. Thota, V. K. Srivastav: Interpolation based Hybrid Algorithm for Computing Real Root of Non-Linear Transcendental Functions, International Journal of Mathematics and Computer Research, 2 (11) (2014), 729-735.
[26] S. Hussain, V. K. Srivastav, S. Thota: Assessment of Interpolation Methods for Solving the Real Life Problem, International Journal of Mathematical Sciences and Applications, 5 (1) (2015), 91-95.
[27] S. Thota: A Symbolic Algorithm for Polynomial Interpolation with Integral Conditions, Applied Mathematics & Information Sciences 12 (5) (2018), 995-1000.
[28] S. Thota: On A Symbolic Method for Error Estimation of a Mixed Interpolation, Kyungpook Mathematical Journal, 58 (3) (2018), 453-462.
[29] S. Thota, V. K. Srivastav: Quadratically Convergent Algorithm for Computing Real Root of Non-Linear Transcendental Equations, BMC Research Notes, (2018) 11:909.
[30] V. K. Srivastav, S. Thota, M. Kumar: A New Trigonometrical Algorithm for Computing Real Root of Non-linear Transcendental Equations, International Journal of Applied and Computational Mathematics, (2019) 5:44.
[31] S. Thota: A Symbolic Algorithm for Polynomial Interpolation with Stieltjes Conditions in Maple, Proceedings of the Institute of Applied mathematics, 8(2) (2019), 112-120.
[32] S. Thota, G. Tekle: A New Algorithm for Computing a root of Transcendental Equations Using Series Expansion, Southeast Asian Journal of Sciences, 7 (2) (2019), 106-114.
[33] T. Parveen, S. Singh, S. Thota, V. K. Srivastav: A New Hydride Root-Finding Algorithm for Transcendental Equations using Bisection, Regula-Falsi and Newton-Raphson methods , National Conference on Sustainable & Recent Innovation in Science and Engineering (SUNRISE-19), (2019). (ISBN No. 978-93-5391-715-9).