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.

収録刊行物

詳細情報

  • CRID
    1571698602057913856
  • NII論文ID
    110002673332
  • NII書誌ID
    AA00700121
  • ISSN
    03876101
  • 本文言語コード
    en
  • データソース種別
    • CiNii Articles

問題の指摘

ページトップへ