The convergence of a family of parallel zero-finding methods (Q1767950): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.camwa.2004.01.010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W113723831 / rank | |||
Normal rank |
Revision as of 22:32, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The convergence of a family of parallel zero-finding methods |
scientific article |
Statements
The convergence of a family of parallel zero-finding methods (English)
0 references
8 March 2005
0 references
The aim of the paper is to introduce computationally verifiable initial conditions which could guarantee the convergence of the recently introduced class of fourth-order methods [cf. \textit{T. Sakurai} and \textit{M. S. Petković}, J. Comput. Appl. Math. 72, 275--291 (1996; Zbl 0859.65048)] for simultaneous finding polynomial zeros. First, the authors introduce some basic facts on circular complex arithmetic. Then they prove several technical lemmas. Finally, they state two significant theorems concerning the initial conditions for the convergence. These conditions depend only on polynomial coefficients, its degree and initial approximations of zeros, thus they can be easily verified.
0 references
zeros of polynomials
0 references
simultaneous methods
0 references
convergence
0 references
circular complex arithmetic
0 references