Some simultaneous iterations for finding all zeros of a polynomial with high order convergence (Q1294297): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0096-3003(98)00009-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2095210218 / rank | |||
Normal rank | |||
Latest revision as of 10:10, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some simultaneous iterations for finding all zeros of a polynomial with high order convergence |
scientific article |
Statements
Some simultaneous iterations for finding all zeros of a polynomial with high order convergence (English)
0 references
1 February 2000
0 references
The authors construct some iterations for simultaneously finding all zeros of an algebraic polynomial with convergence of order 4. The simultaneous iterations are established by using Lagrange interpolation with special nodes. The convergence results are further illustrated by some numerical examples. This paper improves the result by \textit{A. W. Nourein} [J. Comput. Appl. Math. 1, 251-254 ( 1975; Zbl 0315.65029)].
0 references
simultaneous iteration
0 references
zeros of polynomials
0 references
Lagrange interpolation
0 references
convergence
0 references
numerical examples
0 references
0 references
