An iteration algorithm of calculation of elliptic integrals
From MaRDI portal
(Redirected from An iteration algorithm of calculation of elliptic integrals)
Using the inversion of the doubling formula for points on an elliptic curve, the author presents a new iteration algorithm to compute a general incomplete elliptic integral. Also, the half argument formulas of elliptic functions are proved.NEWLINENEWLINEFor the entire collection see [Zbl 1236.70003].
Recommendations
- Numerical computation of incomplete elliptic integrals of a general form
- Numerical inversion of a general incomplete elliptic integral
- Precise and fast computation of a general incomplete elliptic integral of second kind by half and double argument transformations
- scientific article; zbMATH DE number 4190976
- Algorithms for computing complete elliptic integrals and some related functions
Cited in
(5)- Multiplication and division on elliptic curves, torsion points, and roots of modular equations
- scientific article; zbMATH DE number 3844917 (Why is no real title available?)
- An iterative method for numerical integration of rational functions
- Iterative Method for Calculation of the Weierstrass Elliptic Function
- scientific article; zbMATH DE number 2065719 (Why is no real title available?)
This page was built for publication: An iteration algorithm of calculation of elliptic integrals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895481)