Some modifications of the parallel Halley iteration method and their convergence (Q1074309): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Circular arithmetic and the determination of polynomial zeros / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the convergence order of a modified method for simultaneous finding polynomial zeros / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3740920 / rank | |||
Normal rank | |||
Latest revision as of 12:41, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some modifications of the parallel Halley iteration method and their convergence |
scientific article |
Statements
Some modifications of the parallel Halley iteration method and their convergence (English)
0 references
1987
0 references
We derive five kinds of algorithms for simultaneously finding the zeros of a complex polynomial. The convergence and the convergence rate with higher order are obtained. The algorithms are numerically illustrated by an example of degree 10, and the numerical results are satisfactory.
0 references
complex polynomial
0 references
zeros
0 references
parallel Halley iteration method
0 references
convergence order
0 references
numerical example
0 references
0 references
0 references
