A Landen-type method for computation of Weierstrass functions
Matvey Smirnov, Kirill Malkov, and Sergey Rogovoy

TL;DR
This paper introduces a Landen-type transformation for Weierstrass functions applicable to general lattices, providing an efficient quadratic convergence method for computing elliptic functions, periods, and integrals from invariants.
Contribution
It develops a novel Landen-type transformation for Weierstrass functions applicable to all lattices, enabling an effective quadratic convergence algorithm for elliptic computations.
Findings
Quadratic convergence rate of the proposed method
Effective computation of Weierstrass functions and invariants
Applicable to general complex lattices
Abstract
We establish a version of the Landen's transformation for Weierstrass functions and invariants that is applicable to general lattices in complex plane. Using it we present an effective method for computing Weierstrass functions, their periods, and elliptic integral in Weierstrass form given Weierstrass invariants and of an elliptic curve. Similarly to the classical Landen's method our algorithm has quadratic rate of convergence.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical and numerical algorithms · Matrix Theory and Algorithms · Digital Filter Design and Implementation
