Calculating the square root with arbitrary order of convergence (Q4518240)
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 1532861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Calculating the square root with arbitrary order of convergence |
scientific article; zbMATH DE number 1532861 |
Statements
Calculating the square root with arbitrary order of convergence (English)
0 references
20 November 2000
0 references
Belaga parameters
0 references
polynomials
0 references
division
0 references
error bounds
0 references
iterative algorithm
0 references
square roots
0 references
convergence
0 references
0.8058193325996399
0 references
0.7906481027603149
0 references
0.7881494164466858
0 references
0.7852325439453125
0 references
0.784028172492981
0 references
The author reports an iterative algorithm to calculate accurately square roots of real numbers. The goal is to reduce the number of divisions with an iterative scheme with higher-order convergence is implemented. A study of the condition number, a round-off error analysis, and numerical examples would further contribute to this useful paper.
0 references