High order algorithms for approximating<i>n</i>th roots (Q4828667)
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 2119198
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | High order algorithms for approximating<i>n</i>th roots |
scientific article; zbMATH DE number 2119198 |
Statements
High order algorithms for approximating<i>n</i>th roots (English)
0 references
26 November 2004
0 references
n-th root
0 references
Newton-type method
0 references
convergence
0 references
Chebyshev's method
0 references
numerical examples
0 references
0.8678028583526611
0 references
0.8660984039306641
0 references
0.826405942440033
0 references
0.7805442810058594
0 references
