asymptotic error constant
Recently Published Documents


TOTAL DOCUMENTS

6
(FIVE YEARS 3)

H-INDEX

2
(FIVE YEARS 1)

Author(s):  
Regina S. Burachik ◽  
Bethany I. Caldwell ◽  
C. Yalçın Kaya

AbstractIt is well known that the Newton method may not converge when the initial guess does not belong to a specific quadratic convergence region. We propose a family of new variants of the Newton method with the potential advantage of having a larger convergence region as well as more desirable properties near a solution. We prove quadratic convergence of the new family, and provide specific bounds for the asymptotic error constant. We illustrate the advantages of the new methods by means of test problems, including two and six variable polynomial systems, as well as a challenging signal processing example. We present a numerical experimental methodology which uses a large number of randomized initial guesses for a number of methods from the new family, in turn providing advice as to which of the methods employed is preferable to use in a particular search domain.


2019 ◽  
Vol 17 (01) ◽  
pp. 1843011
Author(s):  
Ramandeep Behl ◽  
Changbum Chun ◽  
Ali Saleh Alshormani ◽  
S. S. Motsa

In this paper, we present a new and interesting optimal scheme of order eight in a general way for solving nonlinear equations, numerically. The beauty of our scheme is that it is capable of producing further new and interesting optimal schemes of order eight from every existing optimal fourth-order scheme whose first substep employs Newton’s method. The construction of this scheme is based on rational functional approach. The theoretical and computational properties of the proposed scheme are fully investigated along with a main theorem which establishes the order of convergence and asymptotic error constant. Several numerical examples are given and analyzed in detail to demonstrate faster convergence and higher computational efficiency of our methods.


Symmetry ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 691 ◽  
Author(s):  
Mehdi Salimi ◽  
Ramandeep Behl

The principal motivation of this paper is to propose a general scheme that is applicable to every existing multi-point optimal eighth-order method/family of methods to produce a further sixteenth-order scheme. By adopting our technique, we can extend all the existing optimal eighth-order schemes whose first sub-step employs Newton’s method for sixteenth-order convergence. The developed technique has an optimal convergence order regarding classical Kung-Traub conjecture. In addition, we fully investigated the computational and theoretical properties along with a main theorem that demonstrates the convergence order and asymptotic error constant term. By using Mathematica-11 with its high-precision computability, we checked the efficiency of our methods and compared them with existing robust methods with same convergence order.


2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Young Ik Kim ◽  
Young Hee Geum

We construct a biparametric family of fourth-order iterative methods to compute multiple roots of nonlinear equations. This method is verified to be optimally convergent. Various nonlinear equations confirm our proposed method with order of convergence of four and show that the computed asymptotic error constant agrees with the theoretical one.


Sign in / Sign up

Export Citation Format

Share Document