Practically Fast Multiple-Precision Evaluation of LOG(X)

Search this Article

Author(s)

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.

Journal

  • Journal of information processing  

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

    Information Processing Society of Japan (IPSJ)

Codes

  • NII Article ID (NAID)
    110002673332
  • NII NACSIS-CAT ID (NCID)
    AA00700121
  • Text Lang
    ENG
  • ISSN
    03876101
  • Data Source
Page Top