Error bounds for Newton's iterates derived from the Kantorovich theorem (Q1059985)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3905746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Error bounds for Newton's iterates derived from the Kantorovich theorem |
scientific article; zbMATH DE number 3905746 |
Statements
Error bounds for Newton's iterates derived from the Kantorovich theorem (English)
0 references
1986
0 references
This paper shows that the upper and lower bounds of the errors in the Newton iterates recently obtained by \textit{F. Potra} and \textit{V. Pták} [ibid. 34, 63-72 (1980; Zbl 0434.65034)] and \textit{G. Miel} [Computing 27, 237-244 (1981; Zbl 0451.65042)] follow immediately from the Kantorovich theorem, the Kantorovich recurrence relations and Gragg-Tapia's technique. It is also shown that the upper and lower bounds of Miel are sharper than those of Potra-Pták.
0 references
error bounds
0 references
Potra-Ptak's bounds
0 references
Miel's bounds
0 references
upper and lower bounds
0 references
Newton iterates
0 references
Kantorovich theorem
0 references
Kantorovich recurrence relations
0 references
Gragg-Tapia's technique
0 references
0 references
0.9041451811790466
0 references
0.8389315009117126
0 references
0.8209937214851379
0 references
