A family of simultaneous zero-finding methods (Q1130393): 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/s0898-1221(97)00206-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2043556891 / rank | |||
Normal rank |
Latest revision as of 08:56, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A family of simultaneous zero-finding methods |
scientific article |
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