scholarly journals A New Optimal Family of Schröder’s Method for Multiple Zeros

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1076 ◽  
Author(s):  
Ramandeep Behl ◽  
Arwa Jeza Alsolami ◽  
Bruno Antonio Pansera ◽  
Waleed M. Al-Hamdan ◽  
Mehdi Salimi ◽  
...  

Here, we suggest a high-order optimal variant/modification of Schröder’s method for obtaining the multiple zeros of nonlinear uni-variate functions. Based on quadratically convergent Schröder’s method, we derive the new family of fourth -order multi-point methods having optimal convergence order. Additionally, we discuss the theoretical convergence order and the properties of the new scheme. The main finding of the present work is that one can develop several new and some classical existing methods by adjusting one of the parameters. Numerical results are given to illustrate the execution of our multi-point methods. We observed that our schemes are equally competent to other existing methods.


2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Chein-Shan Liu ◽  
Tsung-Lin Lee

Kung and Traub conjectured that a multipoint iterative scheme without memory based on m evaluations of functions has an optimal convergence order p = 2 m − 1 . In the paper, we first prove that the two-step fourth-order optimal iterative schemes of the same class have a common feature including a same term in the error equations, resorting on the conjecture of Kung and Traub. Based on the error equations, we derive a constantly weighting algorithm obtained from the combination of two iterative schemes, which converges faster than the departed ones. Then, a new family of fourth-order optimal iterative schemes is developed by using a new weight function technique, which needs three evaluations of functions and whose convergence order is proved to be p = 2 3 − 1 = 4 .



Mathematics ◽  
2021 ◽  
Vol 9 (16) ◽  
pp. 1855 ◽  
Author(s):  
Petko D. Proinov ◽  
Maria T. Vasileva

One of the famous third-order iterative methods for finding simultaneously all the zeros of a polynomial was introduced by Ehrlich in 1967. In this paper, we construct a new family of high-order iterative methods as a combination of Ehrlich’s iteration function and an arbitrary iteration function. We call these methods Ehrlich’s methods with correction. The paper provides a detailed local convergence analysis of presented iterative methods for a large class of iteration functions. As a consequence, we obtain two types of local convergence theorems as well as semilocal convergence theorems (with computer verifiable initial condition). As special cases of the main results, we study the convergence of several particular iterative methods. The paper ends with some experiments that show the applicability of our semilocal convergence theorems.



Author(s):  
Mohamed M. Khader

AbstractThis paper is devoted to introduce a numerical treatment using the generalized Adams-Bashforth-Moulton method for some of the variable-order fractional modeling dynamics problems, such as Riccati and Logistic differential equations. The fractional derivative is described in Caputo variable-order fractional sense. The obtained numerical results of the proposed models show the simplicity and efficiency of the proposed method. Moreover, the convergence order of the method is also estimated numerically.



2007 ◽  
Vol 227 (2) ◽  
pp. 1306-1339 ◽  
Author(s):  
Qiang Zhou ◽  
Zhaohui Yao ◽  
Feng He ◽  
M.Y. Shen


2014 ◽  
Vol 68 (2) ◽  
pp. 261-288 ◽  
Author(s):  
Taher Lotfi ◽  
Somayeh Sharifi ◽  
Mehdi Salimi ◽  
Stefan Siegmund






2019 ◽  
Vol 99 (1) ◽  
pp. 91-94
Author(s):  
A. V. Gasnikov ◽  
E. A. Gorbunov ◽  
D. A. Kovalev ◽  
A. A. M. Mokhammed ◽  
E. O. Chernousova


Sign in / Sign up

Export Citation Format

Share Document