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.
- 一般社団法人情報処理学会の論文
- 1982-12-20
著者
-
Sasaki Tateaki
The Institute Of Physical And Chemical Research
-
Sasaki Tateaki
The Institute Of Physical And Chemical Research Wako-shi
-
KANADA YASUMASA
Computer Center, The University of Tokyo Bunkyo-ku
-
Kanada Yasumasa
Computer Center The University Of Tokyo Bunkyo-ku
関連論文
- Analysis of Accuracy Decreasing in Polynomial Remainder Sequence with Floating-point Number Coefficients
- The interval arithmetic for the ill-conditioned polynomial equation
- Cramer-type Formula for the Polynomial Solutions of Coupled Linear Equations with Polynomial Coefficients
- Multidimensional Systematic Sampling (Mathematical Methods in Software Science and Engineering : Second Conference)
- Theory of Multiple Polynomial Remainder Sequence
- Parallelism in Algebraic Computation and Parallel Algorithms for Symbolic Linear Systems (Mathematical Methods in Software Science and Engineering : Third Conference)
- A Modular Grobner Basis Method for Algebraic Equations
- A Modular Method for Grobner-basis Construction over Q and Solving System of Algebraic Equations
- Secondary Polynomial Remainder Sequence and an Extension of Subresultant Theory
- Approximate Square-free Decomposition and Root-finding of III-conditioned Algebraic Equations
- Practically Fast Multiple-Precision Evaluation of LOG(X)
- Multidimensional Systematic Sampling
- HLisp : Its Concept, Implementation and Applications
- Determination of the Critical Points of Antiferromagnetic Ising Model with Next Nearest Neighbour Interactions on the Triangular Lattice