The guaranteed convergence of Laguerre-like method (Q597223): 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(03)90028-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1965159190 / rank | |||
Normal rank |
Latest revision as of 09:06, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The guaranteed convergence of Laguerre-like method |
scientific article |
Statements
The guaranteed convergence of Laguerre-like method (English)
0 references
6 August 2004
0 references
The authors continue their study of a Laguerre-like method for the simultaneous computation of all zeros of polynomial. The method, recently presented by the first author [J. Comput. Appl. Math. 152, No. 1--2, 451--465 (2003; Zbl 1022.65053)], is recalled together with estimates and inequalities necessary for the convergence analysis. The main result of the paper is a theorem which gives a condition assuring fourth order convergence when the Laguerre-like method is applied to a polynomial of degree \(\geq 3\) with simple zeros. A numerical example of the method is given at the end of the paper.
0 references
zeros of polynomials
0 references
point estimation
0 references
approximate zeros
0 references
simultaneous zeros
0 references
guaranteed convergence
0 references
Laguerre-like method
0 references