Practically Fast Multiple-Precision Evaluation of LOG(X)

この論文をさがす

著者

抄録

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.

収録刊行物

  • Journal of information processing  

    Journal of information processing 5(4), 247-250, 1982-12-20 

    一般社団法人情報処理学会

各種コード

  • NII論文ID(NAID)
    110002673332
  • NII書誌ID(NCID)
    AA00700121
  • 本文言語コード
    ENG
  • ISSN
    03876101
  • データ提供元
ページトップへ