Open Source Implementations of Numerical Algorithms for Computing the Complete Elliptic Integral of the First Kind
Hong-Yan Zhang, Wen-Juan Jiang
TL;DR
This work addresses the need for license-free, open-source numerical implementations of the complete elliptic integral of the first kind, $K(k)$. It develops four top-down numerical schemes—an infinite-series expansion, AGM-based evaluation, Gauss-Chebyshev, and Gauss-Legendre quadrature—each with verification, validation, and testing to ensure correctness against the commercial ${\mathcal{K}}_{cs}(m)$. The methods are complemented by robust auxiliary components, including generation of Legendre polynomials and their derivatives, Newton-based root finding, and modular, reusable code for orthogonal-polynomial-related computations. The authors provide cross-method consistency, detailed error analyses, and open-source code on GitHub, highlighting practical impact for STEM education and research without licensing constraints.
Abstract
The complete elliptic integral of the first kind (CEI-1) plays a significant role in mathematics, physics and engineering. There is no simple formula for its computation, thus numerical algorithms are essential for coping with the practical problems involved. The commercial implementations for the numerical solutions, such as the functions \lstinline|ellipticK| and \lstinline|EllipticK| provided by MATLAB and Mathematica respectively, are based on $\mathcal{K}_{\mathrm{cs}}(m)$ instead of the usual form $K(k)$ such that $\mathcal{K}_{\mathrm{cs}}(k^2) =K(k)$ and $m=k^2$. It is necessary to develop open source implementations for the computation of the CEI-1 in order to avoid potential risks of using commercial software and possible limitations due to the unknown factors. In this paper, the infinite series method, arithmetic-geometric mean (AGM) method, Gauss-Chebyshev method and Gauss-Legendre methods are discussed in details with a top-down strategy. The four key algorithms for computing CEI-1 are designed, verified, validated and tested, which can be utilized in R\& D and be reused properly. Numerical results show that our open source implementations based on $K(k)$ are equivalent to the commercial implementation based on $\mathcal{K}_{\mathrm{cs}}(m)$. The general algorithms for computing orthogonal polynomials developed are significant byproducts in the sense of STEM education and scientific computation.
