scholarly journals Multistep High-Order Methods for Nonlinear Equations Using Padé-Like Approximants

2017 ◽  
Vol 2017 ◽  
pp. 1-6
Author(s):  
Alicia Cordero ◽  
José L. Hueso ◽  
Eulalia Martínez ◽  
Juan R. Torregrosa
Keyword(s):  
Nonlinear Equation ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
High Order ◽  
High Order Methods ◽  
Optimal Methods ◽  
Numerical Tests ◽  
Theoretical Results

We present new high-order optimal iterative methods for solving a nonlinear equation, f(x)=0, by using Padé-like approximants. We compose optimal methods of order 4 with Newton’s step and substitute the derivative by using an appropriate rational approximant, getting optimal methods of order 8. In the same way, increasing the degree of the approximant, we obtain optimal methods of order 16. We also perform different numerical tests that confirm the theoretical results.

scholarly journals Optimal High-Order Methods for Solving Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
S. Artidiello ◽  
A. Cordero ◽  
Juan R. Torregrosa ◽  
M. P. Vassileva
Keyword(s):  
Weight Function ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
High Order ◽  
Function Technique ◽  
Numerical Tests ◽  
New Methods ◽  
Theoretical Results ◽  
Made In

A class of optimal iterative methods for solving nonlinear equations is extended up to sixteenth-order of convergence. We design them by using the weight function technique, with functions of three variables. Some numerical tests are made in order to confirm the theoretical results and to compare the new methods with other known ones.

scholarly journals Proving the convergence of the iterative methods by using symbolic computation in Maple

2012 ◽  
Vol 28 (1) ◽  
pp. 1-8
Author(s):  
GHEORGHE ARDELEAN ◽  
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Symbolic Computation ◽  
High Order ◽  
High Order Methods ◽  
Convergence Error

The proofs of the convergence for some high-order methods for solving nonlinear equations, by using symbolic computation in Maple, is presented. Also, the convergence error for some Newton-type methods is evaluated by symbolic computation.

scholarly journals Effective High-Order Iterative Methods via the Asymptotic Form of the Taylor-Lagrange Remainder

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Isaac Fried
Keyword(s):  
Iterative Methods ◽  
Asymptotic Form ◽  
Nonlinear Function ◽  
High Order ◽  
High Order Methods ◽  
High Order Iterative Methods

The asymptotic form of the Taylor-Lagrange remainder is used to derive some new, efficient, high-order methods to iteratively locate the root, simple or multiple, of a nonlinear function. Also derived are superquadratic methods that converge contrarily and superlinear and supercubic methods that converge alternatingly, enabling us not only to approach, but also to bracket the root.

scholarly journals An optimal fourth-order family of modified Cauchy methods for finding solutions of nonlinear equations and their dynamical behavior

2019 ◽  
Vol 17 (1) ◽  
pp. 1567-1598
Author(s):  
Tianbao Liu ◽  
Xiwen Qin ◽  
Qiuyue Li
Keyword(s):  
Nonlinear Equations ◽  
Fourth Order ◽  
Dynamical Behavior ◽  
Basins Of Attraction ◽  
Second Derivative ◽  
Third Order ◽  
Numerical Tests ◽  
The Family ◽  
Theoretical Results ◽  
High Computational Efficiency

Abstract In this paper, we derive and analyze a new one-parameter family of modified Cauchy method free from second derivative for obtaining simple roots of nonlinear equations by using Padé approximant. The convergence analysis of the family is also considered, and the methods have convergence order three. Based on the family of third-order method, in order to increase the order of the convergence, a new optimal fourth-order family of modified Cauchy methods is obtained by using weight function. We also perform some numerical tests and the comparison with existing optimal fourth-order methods to show the high computational efficiency of the proposed scheme, which confirm our theoretical results. The basins of attraction of this optimal fourth-order family and existing fourth-order methods are presented and compared to illustrate some elements of the proposed family have equal or better stable behavior in many aspects. Furthermore, from the fractal graphics, with the increase of the value m of the series in iterative methods, the chaotic behaviors of the methods become more and more complex, which also reflected in some existing fourth-order methods.

scholarly journals Three New Optimal Fourth-Order Iterative Methods to Solve Nonlinear Equations

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Gustavo Fernández-Torres ◽  
Juan Vásquez-Aquino
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
Newton’S Method ◽  
Newton's Method ◽  
Classical Method ◽  
Multiple Roots ◽  
Order Convergence ◽  
Numerical Examples ◽  
Optimal Methods

We present new modifications to Newton's method for solving nonlinear equations. The analysis of convergence shows that these methods have fourth-order convergence. Each of the three methods uses three functional evaluations. Thus, according to Kung-Traub's conjecture, these are optimal methods. With the previous ideas, we extend the analysis to functions with multiple roots. Several numerical examples are given to illustrate that the presented methods have better performance compared with Newton's classical method and other methods of fourth-order convergence recently published.

scholarly journals A class of efficient high‐order iterative methods with memory for nonlinear equations and their dynamics

2018 ◽  
Vol 41 (17) ◽  
pp. 7263-7282 ◽  
Author(s):  
Cory L. Howk ◽  
José L. Hueso ◽  
Eulalia Martínez ◽  
Carles Teruel
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
High Order ◽  
With Memory ◽  
High Order Iterative Methods

scholarly journals On a Family of High-Order Iterative Methods under Kantorovich Conditions and Some Applications

2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
S. Amat ◽  
C. Bermúdez ◽  
S. Busquier ◽  
M. J. Legaz ◽  
S. Plaza
Keyword(s):  
Banach Spaces ◽  
Integral Equations ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Numerical Experiments ◽  
High Order ◽  
High Order Iterative Methods

This paper is devoted to the study of a class of high-order iterative methods for nonlinear equations on Banach spaces. An analysis of the convergence under Kantorovich-type conditions is proposed. Some numerical experiments, where the analyzed methods present better behavior than some classical schemes, are presented. These applications include the approximation of some quadratic and integral equations.

SOME NEWTON-TYPE ITERATIVE METHODS WITH AND WITHOUT MEMORY FOR SOLVING NONLINEAR EQUATIONS

2014 ◽  
Vol 11 (05) ◽  
pp. 1350078 ◽  
Author(s):  
XIAOFENG WANG ◽  
TIE ZHANG
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Type Method ◽  
New Methods ◽  
Hermite Interpolating Polynomial ◽  
With Memory ◽  
Theoretical Results ◽  
Very High ◽  
High Computational Efficiency

In this paper, we present some three-point Newton-type iterative methods without memory for solving nonlinear equations by using undetermined coefficients method. The order of convergence of the new methods without memory is eight requiring the evaluations of three functions and one first-order derivative in per full iteration. Hence, the new methods are optimal according to Kung and Traubs conjecture. Based on the presented methods without memory, we present two families of Newton-type iterative methods with memory. Further accelerations of convergence speed are obtained by using a self-accelerating parameter. This self-accelerating parameter is calculated by the Hermite interpolating polynomial and is applied to improve the order of convergence of the Newton-type method. The corresponding R-order of convergence is increased from 8 to 9, [Formula: see text] and 10. The increase of convergence order is attained without any additional calculations so that the two families of the methods with memory possess a very high computational efficiency. Numerical examples are demonstrated to confirm theoretical results.

scholarly journals Multipoint Fractional Iterative Methods with (2α + 1)th-Order of Convergence for Solving Nonlinear Problems

Mathematics ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. 452
Author(s):  
Giro Candelario ◽  
Alicia Cordero ◽  
Juan R. Torregrosa
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Newton Method ◽  
Fractional Derivatives ◽  
Order Of Convergence ◽  
Recent Literature ◽  
Nonlinear Problems ◽  
Type Method ◽  
Numerical Tests ◽  
Multipoint Method

In the recent literature, some fractional one-point Newton-type methods have been proposed in order to find roots of nonlinear equations using fractional derivatives. In this paper, we introduce a new fractional Newton-type method with order of convergence α + 1 and compare it with the existing fractional Newton method with order 2 α . Moreover, we also introduce a multipoint fractional Traub-type method with order 2 α + 1 and compare its performance with that of its first step. Some numerical tests and analysis of the dependence on the initial estimations are made for each case, including a comparison with classical Newton ( α = 1 of the first step of the class) and classical Traub’s scheme ( α = 1 of fractional proposed multipoint method). In this comparison, some cases are found where classical Newton and Traub’s methods do not converge and the proposed methods do, among other advantages.

scholarly journals A New Derivative-Free Method to Solve Nonlinear Equations

Mathematics ◽  
2021 ◽  
Vol 9 (6) ◽  
pp. 583
Author(s):  
Beny Neta
Keyword(s):  
Nonlinear Equation ◽  
Nonlinear Equations ◽  
High Order ◽  
Order Derivative ◽  
Eighth Order ◽  
High Order Derivative ◽  
Derivative Free ◽  
Derivative Free Method

A new high-order derivative-free method for the solution of a nonlinear equation is developed. The novelty is the use of Traub’s method as a first step. The order is proven and demonstrated. It is also shown that the method has much fewer divergent points and runs faster than an optimal eighth-order derivative-free method.

Sign in / Sign up

Export Citation Format

Share Document