Euler定数の多倍長高速計算法  [in Japanese] Fast Calculation Method for High Precision Euler's Constant  [in Japanese]

Access this Article

Search this Article

Author(s)

Abstract

右田等によって提案された縮約法は、円周率だけでなく多くの計算に適用できる。ここでは、縮約法を10進数でN桁のEuler定数の計算に適用すると、計算量がO ( (og)^)の計算法になり効率的な計算法になることを示した。実際に、C++言語の高精度ルーチンを使い計算し、非常に効率的な計算法であることを示した。Recursive reduction of series, proposed by Migita et. al., can bc applied to not only high precision computation of π but also many high precision computation. In this paper, it is shown that N digits calculation time for Euler's constant γ=0.577・・・ is O (N (logN)^3) and its method is very effective. Some numerical computation is down to show that this calculation method is very effective.

Recursive reduction of series, proposed by Migita et. al., can bc applied to not only high precision computation of π but also many high precision computation. In this paper, it is shown that N digits calculation time for Euler's constant γ=0.577・・・ is O (N (logN)^3) and its method is very effective. Some numerical computation is down to show that this calculation method is very effective.

Journal

  • IPSJ SIG Notes

    IPSJ SIG Notes 1999(103(1999-HPC-079)), 7-12, 1999-12-03

    Information Processing Society of Japan (IPSJ)

References:  6

Codes

  • NII Article ID (NAID)
    110002932356
  • NII NACSIS-CAT ID (NCID)
    AN10463942
  • Text Lang
    JPN
  • Article Type
    Technical Report
  • ISSN
    09196072
  • NDL Article ID
    5338811
  • NDL Source Classification
    ZM13(科学技術--科学技術一般--データ処理・計算機)
  • NDL Call No.
    Z14-1121
  • Data Source
    CJP  NDL  NII-ELS  IPSJ 
Page Top