SIAM Journal on Mathematical Analysis · 1985 · 54 citations · 10 references
ComputingComputational EngineeringMethod ValidationNumber TheoryTheory Of ComputationConvergence AnalysisError EstimationAsymptotic ExpansionsElliptic FunctionsError BoundsError Bounds EstimationLegendre PolynomialsLower Bounds Of Error
Asymptotic formulas with error bounds are obtained for the first elliptic integral near its logarithmic singularity. It is convenient to start from the more general problem of expanding the integral over the positive t-axis of $[(t + x)(t + y)(t + z)(t + w)]^{{{ - 1} / 2}} $. The method of Mellin transforms gives an asymptotic expansion that converges uniformly if ${{0 < \max \{ x,y\} } / {\min \{ z,w\} \leqq r < 1}}$. Each term of the series contains a Legendre polynomial and the derivative of a Legendre function with respect to its degree; this derivative involves nothing worse than a logarithm. A simple bound for the relative error of the Nth partial sum is obtained from Wong’s formula for the remainder, aided by Chebyshev’s integral inequality. Error bounds are given also for more accurate asymptotic formulas containing a complete elliptic integral. Formulas for the standard elliptic integral of the first kind are obtained in the case $w = \infty $. The method of Mellin transforms and Wong’s formula are discussed in an appendix.
10
Computing elliptic integrals by duplication
B. C. Carlson · Numerische Mathematik · 1979 · 180 citations
Natural Sciences, Computer Science, Computational Physics +7
Algorithms Involving Arithmetic and Geometric Means
B. C. Carlson · American Mathematical Monthly · 1971 · 144 citations
Error Bounds for Asymptotic Expansions of Integrals
R. Wong · SIAM Review · 1980 · 45 citations