Practically Fast Multiple-Precision Evaluation of LOG(X)

Search this article

Description

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

Details 詳細情報について

  • CRID
    1571698602057913856
  • NII Article ID
    110002673332
  • NII Book ID
    AA00700121
  • ISSN
    03876101
  • Text Lang
    en
  • Data Source
    • CiNii Articles

Report a problem

Back to top