scholarly journals Derivative free method for the simultaneous inclusion of polynomial zeros

Filomat ◽  
2003 ◽  
pp. 155-168
Author(s):  
Miodrag Petkovic ◽  
Dusan Milosevic
Keyword(s):  
Order Of Convergence ◽  
Initial Conditions ◽  
Convergence Speed ◽  
Combined Method ◽  
Polynomial Zeros ◽  
Numerical Example ◽  
Derivative Free ◽  
Circular Arithmetic ◽  
Derivative Free Method ◽  
Complex Zeros

A combined method for the simultaneous inclusion of complex zeros of a polynomial, composed of two circular arithmetic methods, is presented. This method does not use polynomial derivatives and has the order of convergence equals four. Computationally variable initial conditions that guarantee the convergence are also stated. Two numerical example are included to demonstrate the convergence speed of the presented method.

scholarly journals Stochastic Taylor expansion of derivative-free method for stochastic differential equations

2017 ◽  
Vol 13 (3) ◽  
Author(s):  
Noor Amalina Nisa Ariffin ◽  
Norhayati Rosli
Keyword(s):  
Numerical Methods ◽  
Differential Equations ◽  
Stochastic Differential Equations ◽  
Taylor Series ◽  
Taylor Expansion ◽  
Order Of Convergence ◽  
Derivative Free ◽  
Derivative Free Method ◽  
Systematic Derivation ◽  
Taylor Methods

This paper demonstrates a derivation of stochastic Taylor methods for stochastic differential equations (SDEs). The stochastic Taylor series is extended and truncated at certain terms to achieve the order of convergence of stochatsic Taylor methods for SDEs. The systematic derivation of the expansion of stochastic Taylor series formula is presented. Numerical methods of Euler, Milstein scheme and stochastic Taylor methods of order 2.0 are proposed.

scholarly journals Derivative-Free King’s Scheme for Multiple Zeros of Nonlinear Functions

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1242
Author(s):  
Ramandeep Behl ◽  
Sonia Bhalla ◽  
Eulalia Martínez ◽  
Majed Aali Alsulami
Keyword(s):  
Iterative Methods ◽  
Fourth Order ◽  
Order Of Convergence ◽  
Real Life ◽  
Multiple Roots ◽  
Computational Results ◽  
Nonlinear Functions ◽  
First Order ◽  
Life Problems ◽  
Derivative Free

There is no doubt that the fourth-order King’s family is one of the important ones among its counterparts. However, it has two major problems: the first one is the calculation of the first-order derivative; secondly, it has a linear order of convergence in the case of multiple roots. In order to improve these complications, we suggested a new King’s family of iterative methods. The main features of our scheme are the optimal convergence order, being free from derivatives, and working for multiple roots (m≥2). In addition, we proposed a main theorem that illustrated the fourth order of convergence. It also satisfied the optimal Kung–Traub conjecture of iterative methods without memory. We compared our scheme with the latest iterative methods of the same order of convergence on several real-life problems. In accordance with the computational results, we concluded that our method showed superior behavior compared to the existing methods.

An efficient class of fourth-order derivative-free method for multiple-roots

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Sunil Kumar ◽  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Ioannis K. Argyros
Keyword(s):  
Multiple Root ◽  
Second Step ◽  
Optimal Order ◽  
Multiple Roots ◽  
Nonlinear Functions ◽  
New Methods ◽  
Derivative Free ◽  
Derivative Free Methods ◽  
Derivative Free Method ◽  
Good Number

Abstract Many optimal order multiple root techniques, which use derivatives in the algorithm, have been proposed in literature. Many researchers tried to construct an optimal family of derivative-free methods for multiple roots, but they did not get success in this direction. With this as a motivation factor, here, we present a new optimal class of derivative-free methods for obtaining multiple roots of nonlinear functions. This procedure involves Traub–Steffensen iteration in the first step and Traub–Steffensen-like iteration in the second step. Efficacy is checked on a good number of relevant numerical problems that verifies the efficient convergent nature of the new methods. Moreover, we find that the new derivative-free methods are just as competent as the other existing robust methods that use derivatives.

scholarly journals On a Derivative-Free Variant of King’s Family with Memory

2015 ◽  
Vol 2015 ◽  
pp. 1-5
Author(s):  
M. Sharifi ◽  
S. Karimi Vanani ◽  
F. Khaksar Haghani ◽  
M. Arab ◽  
S. Shateyi
Keyword(s):  
Nonlinear Equations ◽  
Numerical Experiments ◽  
Order Of Convergence ◽  
Derivative Free ◽  
With Memory

The aim of this paper is to construct a method with memory according to King’s family of methods without memory for nonlinear equations. It is proved that the proposed method possesses higherR-order of convergence using the same number of functional evaluations as King’s family. Numerical experiments are given to illustrate the performance of the constructed scheme.

scholarly journals Unified Convergence Analysis of Chebyshev–Halley Methods for Multiple Polynomial Zeros

Mathematics ◽  
2022 ◽  
Vol 10 (1) ◽  
pp. 135
Author(s):  
Stoil I. Ivanov
Keyword(s):  
Convergence Analysis ◽  
Iterative Methods ◽  
Error Estimates ◽  
Local Convergence ◽  
Initial Conditions ◽  
Extended Version ◽  
Unified Approach ◽  
Polynomial Zeros ◽  
Convergence Results ◽  
Appl Math

In this paper, we establish two local convergence theorems that provide initial conditions and error estimates to guarantee the Q-convergence of an extended version of Chebyshev–Halley family of iterative methods for multiple polynomial zeros due to Osada (J. Comput. Appl. Math. 2008, 216, 585–599). Our results unify and complement earlier local convergence results about Halley, Chebyshev and Super–Halley methods for multiple polynomial zeros. To the best of our knowledge, the results about the Osada’s method for multiple polynomial zeros are the first of their kind in the literature. Moreover, our unified approach allows us to compare the convergence domains and error estimates of the mentioned famous methods and several new randomly generated methods.

Derivative-free method for singular systems

2019 ◽  
Author(s):  
Sandra Buhmiler ◽  
Sanja Rapajic ◽  
Milan Lukic ◽  
Slavica Medic ◽  
Natasa Durakovic ◽  
...  
Keyword(s):  
Singular Systems ◽  
Derivative Free ◽  
Derivative Free Method

scholarly journals Two-Step Solver for Nonlinear Equations

Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 128 ◽  
Author(s):  
Ioannis Argyros ◽  
Stepan Shakhno ◽  
Halyna Yarmola
Keyword(s):  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Semilocal Convergence ◽  
Numerical Example ◽  
Weaker Conditions ◽  
Theoretical Results ◽  
Nondifferentiable Operator

In this paper we present a two-step solver for nonlinear equations with a nondifferentiable operator. This method is based on two methods of order of convergence 1 + 2 . We study the local and a semilocal convergence using weaker conditions in order to extend the applicability of the solver. Finally, we present the numerical example that confirms the theoretical results.

Sign in / Sign up

Export Citation Format

Share Document