scholarly journals On the simultaneous improving k inclusion disks for polynomial zeros

Filomat ◽  
2008 ◽  
Vol 22 (2) ◽  
pp. 9-21
Author(s):  
Dusan Milosevic ◽  
Miodrag Petkovic
Keyword(s):  
Iterative Method ◽  
Order Of Convergence ◽  
Convergence Properties ◽  
Polynomial Zeros ◽  
Numerical Examples ◽  
Modified Method

A modification of the iterative method of B?rsch-Supan type for the simultaneous inclusion of polynomial zeros is considered. The modified method provides the simultaneous inclusion of k (of n ? k) zeros, dealing with k inclusion disks of these zeros and the point (unchangeable) approximations to the remaining n - k zeros. It is proved that the R-order of convergence of the considered method is two if k < n and three if k = n. Three numerical examples are given to illustrate convergence properties of the presented method. .

scholarly journals A Family of Fourteenth-Order Convergent Iterative Methods for Solving Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Fiza Zafar ◽  
Gulshan Bibi
Keyword(s):  
Iterative Method ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Efficiency Index ◽  
Numerical Examples ◽  
New Class ◽  
First Derivative ◽  
New Methods ◽  
Specific Step

We present a family of fourteenth-order convergent iterative methods for solving nonlinear equations involving a specific step which when combined with any two-step iterative method raises the convergence order by n+10, if n is the order of convergence of the two-step iterative method. This new class include four evaluations of function and one evaluation of the first derivative per iteration. Therefore, the efficiency index of this family is 141/5 =1.695218203. Several numerical examples are given to show that the new methods of this family are comparable with the existing methods.

scholarly journals A New Iterative Method for Finding Approximate Inverses of Complex Matrices

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
M. Kafaei Razavi ◽  
A. Kerayechian ◽  
M. Gachpazan ◽  
S. Shateyi
Keyword(s):  
Iterative Method ◽  
Order Of Convergence ◽  
Complex Matrices ◽  
Approximate Inverse ◽  
Numerical Examples ◽  
Convergence Behavior ◽  
Approximate Inverses ◽  
Nonsingular Matrices ◽  
New Iterative Method

This paper presents a new iterative method for computing the approximate inverse of nonsingular matrices. The analytical discussion of the method is included to demonstrate its convergence behavior. As a matter of fact, it is proven that the suggested scheme possesses tenth order of convergence. Finally, its performance is illustrated by numerical examples on different matrices.

scholarly journals A New Sixth Order Method for Nonlinear Equations inR

2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Sukhjit Singh ◽  
D. K. Gupta
Keyword(s):  
Iterative Method ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Performance Measure ◽  
Sixth Order ◽  
Order Method ◽  
Numerical Examples ◽  
Real Roots ◽  
New Iterative Method ◽  
Number Of Iterations

A new iterative method is described for finding the real roots of nonlinear equations inR. Starting with a suitably chosenx0, the method generates a sequence of iterates converging to the root. The convergence analysis is provided to establish its sixth order of convergence. The number of iterations and the total number of function evaluations used to get a simple root are taken as performance measure of our method. The efficacy of the method is tested on a number of numerical examples and the results obtained are summarized in tables. It is observed that our method is superior to Newton’s method and other sixth order methods considered.

scholarly journals Iterative Method to Find Core-EP Inverse

2018 ◽  
Author(s):  
Vinay Madhusudanan
Keyword(s):  
Iterative Method ◽  
Convergence Properties ◽  
Numerical Examples ◽  
The Core

In this article, an iterative method for estimating the core-EP inverse is proposed and the convergence properties of the same are discussed. Also, numerical examples with different values of parameters and the criteria for stopping the iteration are presented.

scholarly journals Second Degree Generalized Successive Over Relaxation Method for Solving System of Linear Equations

2020 ◽  
Vol 12 (1) ◽  
pp. 60-71
Author(s):  
Firew Hailu ◽  
Genanew Gofe Gonfa ◽  
Hailu Muleta Chemeda
Keyword(s):  
Iterative Method ◽  
Linear Equations ◽  
Relaxation Method ◽  
The Other ◽  
System Of Linear Equations ◽  
Convergence Properties ◽  
Numerical Examples ◽  
Successive Over Relaxation ◽  
Number Of Iterations ◽  
Second Degree

In this paper, a second degree generalized successive over relaxation iterative method for solving system of linear equations based on the decomposition  A= Dm+Lm+Um  is presented and the convergence properties of the proposed method are discussed. Two numerical examples are considered to show the efficiency of the proposed method. The results presented in tables show that the Second Degree Generalized Successive Over Relaxation Iterative method is more efficient than the other methods considered based on number of iterations, computational running time and accuracy. Keywords: Second Degree, Generalized Gauss Seidel, Successive over relaxation, Convergence.

scholarly journals On the Convergence of a New Family of Multi-Point Ehrlich-Type Iterative Methods for Polynomial Zeros

Mathematics ◽  
2021 ◽  
Vol 9 (14) ◽  
pp. 1640
Author(s):  
Petko D. Proinov ◽  
Milena D. Petkova
Keyword(s):  
Iterative Method ◽  
Iterative Methods ◽  
Convergence Theorem ◽  
Local Convergence ◽  
Semilocal Convergence ◽  
Polynomial Zeros ◽  
Numerical Examples ◽  
New Family ◽  
Local Convergence Theorem ◽  
Semilocal Convergence Theorem

In this paper, we construct and study a new family of multi-point Ehrlich-type iterative methods for approximating all the zeros of a uni-variate polynomial simultaneously. The first member of this family is the two-point Ehrlich-type iterative method introduced and studied by Trićković and Petković in 1999. The main purpose of the paper is to provide local and semilocal convergence analysis of the multi-point Ehrlich-type methods. Our local convergence theorem is obtained by an approach that was introduced by the authors in 2020. Two numerical examples are presented to show the applicability of our semilocal convergence theorem.

An Accelerated Iterative Method with Third-Order Convergence

2012 ◽  
Vol 220-223 ◽  
pp. 2658-2661
Author(s):  
Zhong Yong Hu ◽  
Liang Fang ◽  
Lian Zhong Li
Keyword(s):  
Iterative Method ◽  
Fourth Order ◽  
Newton’S Method ◽  
Newton's Method ◽  
New Method ◽  
Order Convergence ◽  
Third Order ◽  
Numerical Examples ◽  
Modified Newton’S Method ◽  
Jarratt Method

We present a new modified Newton's method with third-order convergence and compare it with the Jarratt method, which is of fourth-order. Based on this new method, we obtain a family of Newton-type methods, which converge cubically. Numerical examples show that the presented method can compete with Newton's method and other known third-order modifications of Newton's method.

scholarly journals A fourth order method for finding a simple root of univariate function

2015 ◽  
Vol 34 (2) ◽  
pp. 197-211
Author(s):  
D. Sbibih ◽  
Abdelhafid Serghini ◽  
A. Tijini ◽  
A. Zidna
Keyword(s):  
Iterative Method ◽  
Fourth Order ◽  
Newton’S Method ◽  
Simple Root ◽  
Newton's Method ◽  
Order Method ◽  
Numerical Examples ◽  
Quadratic Interpolation ◽  
Univariate Function ◽  
Fourth Order Method

In this paper, we describe an iterative method for approximating asimple zero $z$ of a real defined function. This method is aessentially based on the idea to extend Newton's method to be theinverse quadratic interpolation. We prove that for a sufficientlysmooth function $f$ in a neighborhood of $z$ the order of theconvergence is quartic. Using Mathematica with its high precisioncompatibility, we present some numerical examples to confirm thetheoretical results and to compare our method with the others givenin the literature.

scholarly journals A Family of Derivative-Free Methods with High Order of Convergence and Its Application to Nonsmooth Equations

2012 ◽  
Vol 2012 ◽  
pp. 1-15 ◽  
Author(s):  
Alicia Cordero ◽  
José L. Hueso ◽  
Eulalia Martínez ◽  
Juan R. Torregrosa
Keyword(s):  
Fourth Order ◽  
Order Of Convergence ◽  
Nonsmooth Equations ◽  
Order Convergence ◽  
Linear Combinations ◽  
Numerical Examples ◽  
Derivative Free ◽  
Derivative Free Methods ◽  
Seventh Order ◽  
The Given

A family of derivative-free methods of seventh-order convergence for solving nonlinear equations is suggested. In the proposed methods, several linear combinations of divided differences are used in order to get a good estimation of the derivative of the given function at the different steps of the iteration. The efficiency indices of the members of this family are equal to 1.6266. Also, numerical examples are used to show the performance of the presented methods, on smooth and nonsmooth equations, and to compare with other derivative-free methods, including some optimal fourth-order ones, in the sense of Kung-Traub’s conjecture.

Sign in / Sign up

Export Citation Format

Share Document