Journals / Mathematical and Computational Applications / 2007 / Cilt: 12 - Sayı: 2

Perturbative derivation and comparisons of root-finding algorithms with fourth order derivatives

Pages
117–124
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

It is found that the quadruple-correction-term algorithm performs better than the others.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Perturbation theory is systematically used to generate root finding algorithms with fourth order derivatives.
📊
Key Findings & Data:Depending on the number of correction terms in the perturbation expansion and the number of Taylor expansion terms, different root finding formulas can be generated.
💡
Conclusion & Impact:It is found that the quadruple-correction-term algorithm performs better than the others.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Perturbation theory is systematically used to generate root finding algorithms with fourth order derivatives. Depending on the number of correction terms in the perturbation expansion and the number of Taylor expansion terms, different root finding formulas can be generated. Expanding Taylor series up to fourth order derivatives and taking two, three and four correction terms in the perturbation expansions, three different root finding algorithms are derived. The algorithms are contrasted numerically with each other as well as with the Newton-Raphson algorithm. It is found that the quadruple-correction-term algorithm performs better than the others.

🔖

Cite This Article

PAKDEMİRLİ, M., BOYACI, H., YURTSEVER, H. A. (2007). Perturbative derivation and comparisons of root-finding algorithms with fourth order derivatives. Mathematical and Computational Applications, Cilt: 12 - Sayı: 2, 117–124. https://ajindex.com/articles/280333

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (5)

  1. A. H. Nayfeh, Introduction to Perturbation Techniques, John Wiley and Sons, New York, 1981
  2. E. J. Hinch, Perturbation Methods, Cambridge University Press, New York, 1991
  3. A. S. Householder, The Numerical Treatment of a Single Nonlinear Equation, McGraw-Hill, New York, 1970
  4. M. Pakdemirli, and H. Boyacı, Generation of root finding algorithms via perturbation theory and some formulas, Applied Mathematics and Computation (in press)
  5. S. Abbasbandy, Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method, Applied Mathematics and Computation 145, 887-893, 2003.