A class of exponential quadratically convergent iterative formulae for unconstrained optimization

Kahya E.

APPLIED MATHEMATICS AND COMPUTATION, cilt.186, sa.2, ss.1010-1017, 2007 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 186 Sayı: 2
  • Basım Tarihi: 2007
  • Doi Numarası: 10.1016/j.amc.2006.08.040
  • Dergi Adı: APPLIED MATHEMATICS AND COMPUTATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1010-1017
  • Eskişehir Osmangazi Üniversitesi Adresli: Evet

Özet

For solving nonlinear, univariate and unconstrained optimization problems, Newton method is an important and basic method which converges quadratically. This paper presents a class of exponential iterative formulae. Convergence analyses show that the proposed methods converge quadratically. The efficiencies of the methods are analyzed in terms of the most popular and widely used criterion in comparison with the classical Newton method using five test functions. Numerical results indicate that one of the new exponential iterative formulae is effective and comparable to well-known Newton's method. (c) 2006 Elsevier Inc. All rights reserved.