An Extension of the Steffensen Iteration and Its Computational Complexity. (Q4241107)
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: An Extension of the Steffensen Iteration and Its Computational Complexity. |
scientific article; zbMATH DE number 1282059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Extension of the Steffensen Iteration and Its Computational Complexity. |
scientific article; zbMATH DE number 1282059 |
Statements
An Extension of the Steffensen Iteration and Its Computational Complexity. (English)
0 references
29 April 1999
0 references
\(\varepsilon\)-algorithm
0 references
Newton method
0 references
Steffensen iteration method
0 references
Shanks transform
0 references
convergence
0 references
Hankel determinants
0 references
computational complexity
0 references
Kepler equation
0 references
0.7596702575683594
0 references
0.7572620511054993
0 references
