• Title/Summary/Keyword: eighth-order of convergence

Search Result 4, Processing Time 0.026 seconds

A QUADRAPARAMETRIC FAMILY OF EIGHTH-ORDER ROOT-FINDING METHODS

  • Kim, Young Ik
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.27 no.1
    • /
    • pp.133-143
    • /
    • 2014
  • A new three-step quadraparametric family of eighth-order iterative methods free from second derivatives are proposed in this paper to find a simple root of a nonlinear equation. Convergence analysis as well as numerical experiments confirms the eighth-order convergence and asymptotic error constants.

STUDY OF OPTIMAL EIGHTH ORDER WEIGHTED-NEWTON METHODS IN BANACH SPACES

  • Argyros, Ioannis K.;Kumar, Deepak;Sharma, Janak Raj
    • Communications of the Korean Mathematical Society
    • /
    • v.33 no.2
    • /
    • pp.677-693
    • /
    • 2018
  • In this work, we generalize a family of optimal eighth order weighted-Newton methods to Banach spaces and study its local convergence to approximate a locally-unique solution of a system of nonlinear equations. The convergence in this study is shown under hypotheses only on the first derivative. Our analysis avoids the usual Taylor expansions requiring higher order derivatives but uses generalized Lipschitz-type conditions only on the first derivative. Moreover, our new approach provides computable radius of convergence as well as error bounds on the distances involved and estimates on the uniqueness of the solution based on some functions appearing in these generalized conditions. Such estimates are not provided in the approaches using Taylor expansions of higher order derivatives which may not exist or may be very expensive or impossible to compute. The convergence order is computed using computational order of convergence or approximate computational order of convergence which do not require usage of higher derivatives. This technique can be applied to any iterative method using Taylor expansions involving high order derivatives. The study of the local convergence based on Lipschitz constants is important because it provides the degree of difficulty for choosing initial points. In this sense the applicability of the method is expanded. Finally, numerical examples are provided to verify the theoretical results and to show the convergence behavior.

A NEW OPTIMAL EIGHTH-ORDER FAMILY OF MULTIPLE ROOT FINDERS

  • Cebic, Dejan;Ralevic, Nebojsa M.
    • Journal of the Korean Mathematical Society
    • /
    • v.59 no.6
    • /
    • pp.1067-1082
    • /
    • 2022
  • This paper presents a new optimal three-step eighth-order family of iterative methods for finding multiple roots of nonlinear equations. Different from the all existing optimal methods of the eighth-order, the new iterative scheme is constructed using one function and three derivative evaluations per iteration, preserving the efficiency and optimality in the sense of Kung-Traub's conjecture. Theoretical results are verified through several standard numerical test examples. The basins of attraction for several polynomials are also given to illustrate the dynamical behaviour and the obtained results show better stability compared to the recently developed optimal methods.

SOME OPTIMAL METHODS WITH EIGHTH-ORDER CONVERGENCE FOR THE SOLUTION OF NONLINEAR EQUATIONS

  • Kim, Weonbae;Chun, Changbum
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.29 no.4
    • /
    • pp.663-676
    • /
    • 2016
  • In this paper we propose a new family of eighth order optimal methods for solving nonlinear equations by using weight function methods. The methods of the family require three function and one derivative evaluations per step and has order of convergence eight, and so they are optimal in the sense of Kung-Traub hypothesis. Precise analysis of convergence is given. Some members of the family are compared with several existing methods to show their performance and as a result to confirm that our methods are as competitive as compared to them.