「十分逼近法」的英文嗎？

Question

我想要知道數學裡面有個算法叫
「十分逼近法」，他的的英文解釋是什麼
謝謝各位的幫忙。

Answer 1

英文是Euclidian Algorithm, 解釋：
The Euclidean algorithm (also called Euclid's algorithm) is an algorithm to determine the greatest common divisor (gcd) of two integers. It is one of the oldest algorithms known, since it appeared in Euclid's Elements around 300 BC. However, the algorithm was probably not discovered by Euclid and it may have been known up to 200 years earlier. It was almost certainly known by Eudoxus of Cnidus (about 375 BC); and Aristotle (about 330 BC) hinted at it in his Topics, 158b, 29-35. The algorithm does not require factoring the two integers.

Answer 2

找了很久都找不到，這裡有些英文解釋求平方根的文章：
http://en.wikipedia.org/wiki/Methods_of_computing_square_roots

看起來沒有一個是十分逼近法。若懂數學的人可能看一下該網頁所列演算法，就知道哪個是我們所謂的十分逼近法吧。

猜測是
decimal approximation
但是我不確定，故不列為答案

http://www.homeschoolmath.net/teaching/square-root-algorithm.php