Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2212.05694 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909282991079424 |
|---|---|
| author | Zhang, Hong-Yan Jiang, Wen-Juan |
| author_facet | Zhang, Hong-Yan Jiang, Wen-Juan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_05694 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Open Source Implementations of Numerical Algorithms for Computing the Complete Elliptic Integral of the First Kind Zhang, Hong-Yan Jiang, Wen-Juan Numerical Analysis 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. |
| title | Open Source Implementations of Numerical Algorithms for Computing the Complete Elliptic Integral of the First Kind |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2212.05694 |