You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/references/bib.bib
+18-2Lines changed: 18 additions & 2 deletions
Original file line number
Diff line number
Diff line change
@@ -2279,14 +2279,14 @@ @book{berndt:1991a
2279
2279
year = {1991},
2280
2280
}
2281
2281
2282
-
@article{@fukushima:2009a,
2282
+
@article{fukushima:2009a,
2283
2283
abstract = {As a preparation step to compute Jacobian elliptic functions efficiently, we created a fast method to calculate the complete elliptic integral of the first and second kinds, K(m) and E(m), for the standard domain of the elliptic parameter, 0 < m < 1. For the case 0 < m < 0.9, the method utilizes 10 pairs of approximate polynomials of the order of 9--19 obtained by truncating Taylor series expansions of the integrals. Otherwise, the associate integrals, K(1 − m) and E(1 − m), are first computed by a pair of the approximate polynomials and then transformed to K(m) and E(m) by means of Jacobi's nome, q, and Legendre's identity relation. In average, the new method runs more-than-twice faster than the existing methods including Cody's Chebyshev polynomial approximation of Hastings type and Innes' formulation based on q-series expansions. Next, we invented a fast procedure to compute simultaneously three Jacobian elliptic functions, sn(u|m), cn(u|m), and dn(u|m), by repeated usage of the double argument formulae starting from the Maclaurin series expansions with respect to the elliptic argument, u, after its domain is reduced to the standard range, 0 ≤ u < K(m)/4, with the help of the new method to compute K(m). The new procedure is 25--70{\%} faster than the methods based on the Gauss transformation such as Bulirsch's algorithm, sncndn, quoted in the Numerical Recipes even if the acceleration of computation of K(m) is not taken into account.},
2284
2284
author = {Toshio Fukushima},
2285
2285
day = {25},
2286
2286
doi = {10.1007/s10569-009-9228-z},
2287
2287
issn = {1572-9478},
2288
2288
journal = {Celestial Mechanics and Dynamical Astronomy},
2289
-
keywords = {},
2289
+
keywords = {complete elliptic integral, function approximation, math, special function, elliptic, numerical, algorithm},
2290
2290
month = {oct},
2291
2291
number = {4},
2292
2292
pages = {305},
@@ -2295,3 +2295,19 @@ @article{
2295
2295
volume = {105},
2296
2296
year = {2009},
2297
2297
}
2298
+
2299
+
@article{fukushima:2015a,
2300
+
abstract = {Piecewise minimax rational function approximations with the single and double precision accuracies are developed for (i) K(m) and E(m), the complete elliptic integral of the first and second kind, respectively, and (ii) B(m)≡(E(m)−(1−m)K(m))/m and D(m)≡(K(m)−E(m))/m, two associate complete elliptic integrals of the second kind. The maximum relative error is one and 5 machine epsilons in the single and double precision computations, respectively. The new approximations run faster than the exponential function. When compared with the previous methods (Fukushima, 2009; Fukushima, 2011), which have been the fastest among the existing double precision procedures, the new method requires around a half of the memory and runs 1.7–2.2 times faster.},
2301
+
author = {Toshio Fukushima},
2302
+
doi = {10.1016/j.cam.2014.12.038},
2303
+
issn = {0377-0427},
2304
+
journal = {Journal of Computational and Applied Mathematics},
2305
+
keywords = {complete elliptic integral, function approximation, logarithmic singularity, minimax approximation, rational function approximation, math, special function, elliptic, numerical, algorithm},
2306
+
month = {jul},
2307
+
number = {},
2308
+
pages = {71--76},
2309
+
title = {{Precise and fast computation of complete elliptic integrals by piecewise minimax rational function approximation}},
0 commit comments