110002673332
Practically Fast Multiple-Precision Evaluation of LOG(X)
en
abstract
A new algorithm for multiple-precision evaluation of log(x) is presented. The algorithm is based on the wellknown q-expansion formulas for elliptic theta functions and the famous arithmetic-geometric mean of Gauss. The algorithm is a generalization of the Salamin-Brent algorithm based on the arithmetic-geometric mean. The efficiency of the new algorithm is shown by numerical experiments.
9000004146887
SASAKI TATEAKI
The Institute of Physical and Chemical Research Wako-shi
9000004146889
KANADA YASUMASA
Computer Center, The University of Tokyo Bunkyo-ku
03876101
AA00700121
Journal of information processing
一般社団法人情報処理学会
Information Processing Society of Japan (IPSJ)
1982-12-20
5
4
247
250
110002673332