2013
DOI: 10.7546/cr-2013-66-6-13101331-5
|View full text |Cite
|
Sign up to set email alerts
|

Convergence of the Weierstrass Method for Simultaneous Approximation of Polynomial Zeros

Abstract: In 1891, Weierstrass presented his famous iterative method for finding all the zeros of a polynomial simultaneously. In this paper we establish three new local convergence theorems for the Weierstrass method with a posteriori and a priori error estimates. The main result of the paper generalizes, improves and complements some well known results of Dochev (1962), Kjurkchiev and Markov (1983) and Yakoubsohn (2002). The results are given for polynomials over an arbitrary normed field.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
5
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 3 publications
2
5
0
Order By: Relevance
“…Finally, we refer the reader to some recent papers [2,17,20,[22][23][24][25]28,29], which investigate initial conditions of the type (66).…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Finally, we refer the reader to some recent papers [2,17,20,[22][23][24][25]28,29], which investigate initial conditions of the type (66).…”
Section: Discussionmentioning
confidence: 99%
“…On the basis of this theory lays the notion function of initial conditions of T since the convergence of any iterative method of the type (1) is studied with respect to some function of initial conditions (see [35,36]). Some applications of this theory can be found in [1,2,5,7,8,[14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][35][36][37][38]. Let R n be equipped with coordinate-wise ordering defined by:…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…If the roots ζ 1 ,…, ζ n are distinct and z1false(0false),,znfalse(0false) are sufficiently good initial approximations to these roots, then the method converges at a quadratic rate, as was firstly proven by Dochev . A complete history and an improvement of Dochev's theorem can be found in Proinov and Petkova (see also Proinov, section 6). For multiple roots, the method still converges (locally), but the quadratic convergence is lost; see, eg, Fraigniaud.…”
Section: The Weierstrass Methods In Double-struckhfalse[boldxfalse]mentioning
confidence: 99%
“…The iteration method (1.2)-(1.3) is introduced for the first time by Weierstrass in 1891 [1], rediscovered later by Durand [2], Dochev [3], Kerner [4], Prešić [5], and since then it has been investigated by many authors (see [6,7,8,9,10,11,12,13,14,15,16]). In the literature the method (1.2)-(1.3) is also called Weierstrass-Dochev, Durand-Kerner, or shorter the WDK-method.…”
Section: Introductionmentioning
confidence: 99%