| Item type |
JInfP(1) |
| 公開日 |
1983-12-20 |
| タイトル |
|
|
タイトル |
Practically Fast Multiple-Precision Evaluation of LOG(X) |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Practically Fast Multiple-Precision Evaluation of LOG(X) |
| 言語 |
|
|
言語 |
eng |
| キーワード |
|
|
主題Scheme |
Other |
|
主題 |
（IPSJ Best Paper Award、論文賞受賞） |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_6501 |
|
資源タイプ |
journal article |
| 著者所属 |
|
|
|
The Institute of Physical and Chemical Research |
| 著者所属 |
|
|
|
Computer Center The University of Tokyo |
| 著者所属(英) |
|
|
|
en |
|
|
The Institute of Physical and Chemical Research |
| 著者所属(英) |
|
|
|
en |
|
|
Computer Center, The University of Tokyo |
| 著者名 |
Tateaki, Sasaki
Yasumasa, Kanada
|
| 著者名(英) |
Tateaki, Sasaki
Yasumasa, Kanada
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
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. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
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. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AA00700121 |
| 書誌情報 |
Journal of Information Processing
巻 5,
号 4,
p. 247-250,
発行日 1983-12-20
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
1882-6652 |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-JIP0504004 (533.1 kB)
