另外,计算平方根。
,这是我们写的计算平方根的代码,计算完全全平方根的。
It's the piece of code we wrote for computing square roots, square roots of actually perfect squares.
证明了:若用QR分解所作的算法无需计算平方根,则相应的迭代加细算法也无需计算平方根。
It is shown that, if algorithms for performing the QR decomposition are free from calculation of square root, the related iterative refinement algorithms can also be square root free.
What is that? It's the piece of code we wrote for computing square roots, square roots of actually perfect squares.
对吧?这是什么呢?,这是我们写的计算平方根的代码,计算完全全平方根的。
All right, this is actually a very old piece of imperative knowledge for computing square roots, it's attributed to Heron of Alexandria, although I believe that the Babylonians are suspected of knowing it beforehand.
好,这是一个很古老的,关于计算平方根的程序性知识,是亚历山大的海伦提出的,不过我怀疑在那之前,巴比伦人就已经猜想过了。
Suppose I want to compute square roots a lot of places in a big chunk of code.
假设我想在一大段代码中,计算很多次平方根。
应用推荐