Abstract

In this work, two broad classes of iteration functions in n-dimensional vector spaces are introduced. They are called iteration functions of the first and second kind at a fixed point of the corresponding iteration function. Two general local convergence theorems are presented for Picard-type iterative methods with high Q-order of convergence. In particular, it is shown that if an iterative method is generated by an iteration function of first or second kind, then it is Q-convergent under each initial approximation that is sufficiently close to the fixed point. As an application, a detailed local convergence analysis of two fourth-order iterative methods is provided for finding all zeros of a polynomial simultaneously. The new results improve the previous ones for these methods in several directions.

Highlights

  • This paper is devoted to the convergence of iterative methods for the simultaneous approximation of all zeros of an algebraic polynomial of degree n ≥ 2

  • It is shown that if an iterative method is generated by an iteration function of first or second kind, it is Q-convergent under each initial approximation that is sufficiently close to the fixed point

  • Two general local convergence theorems were established for Picard-type iterative methods with high Q-order of convergence

Read more

Summary

Introduction

This paper is devoted to the convergence of iterative methods for the simultaneous approximation of all zeros of an algebraic polynomial of degree n ≥ 2. The first method for simultaneously finding polynomial zeros was introduced by Weierstrass [1] in 1891. Classical Iterative Methods for Simultaneous Approximation of Polynomial Zeros. Ξ n ) in the space Kn. Every iterative method for simultaneously finding all the zeros of a polynomial f ∈ K[z] is given by a fixed point iteration distributed under the terms and conditions of the Creative Commons x ( k +1) = T ( x ( k ) ), k = 0, 1, 2, . Let us recall two well-known iteration functions for simultaneous approximation of polynomial zeros: Definition 1 (Weierstrass [1]). The second formula in (4) is due to Börsch–Supan [6]

Q-Order of Convergence
A Fourth-Order Root-Finding Method for Simple Polynomial Zeros
A Fourth-Order Root-Finding Method for Multiple Polynomial Zeros with
The Purpose of the Paper
Two Kinds of Iteration Functions
Notations
Quasi-Homogeneous Function
Iteration Function of the First Kind
Iteration Function of the Second Kind
Relationship between the First and the Second Kind Iteration Functions
Local Convergence of the First Kind of Kyurkchiev-Zheng-Sun’s Method
This completes
Local Convergence of the Second Kind of Kyurkchiev–Zheng–Sun’s Method
Local Convergence of the First Kind of Iliev’s Method
Local Convergence of the Second Kind of Iliev’s Method
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call