On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial (Q1044413): Difference between revisions
From MaRDI portal
Latest revision as of 08:10, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial |
scientific article |
Statements
On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial (English)
0 references
18 December 2009
0 references
The goal of this paper is to derive and study a new iterative method of high computational efficiency for finding all (real or complex) zeros of a polynomial, simultaneously. Its local cubic convergence is proved and some computational aspects of the proposed method are discussed. Three numerical examples are also given.
0 references
root-finding methods
0 references
polynomial zeros
0 references
simultaneous methods
0 references
convergence
0 references
computational efficiency
0 references
iterative method
0 references
numerical examples
0 references
0 references
0 references
