A family of simultaneous zero-finding methods (Q1130393)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A family of simultaneous zero-finding methods |
scientific article; zbMATH DE number 1192639
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A family of simultaneous zero-finding methods |
scientific article; zbMATH DE number 1192639 |
Statements
A family of simultaneous zero-finding methods (English)
0 references
20 August 1998
0 references
The authors propose a generally original iterative method to simultaneously calculate all zeros of a polynomial. The method improves on previously known methods accelerating the order of convergence from three to four. It contains, as particular cases, a number of other methods. Numerical examples, run in quadruple precision, illustrate the feasability of the method proposed.
0 references
zeros of polynomials
0 references
iteration functions
0 references
simultaneous methods
0 references
convergence acceleration
0 references
numerical examples
0 references
iterative method
0 references
