Search arXivSearch

arXiv · 2605.06698

A fixed point iteration method for the arctangent with any odd order of convergence based on sine and cosine

Abstract

In this paper, we present a fixed point method for the arctangent based on sine and cosine. Let $t\in \mathbb{R}^{+}$ and $P\in \mathbb{N}$. We define: \[T\left(x\right)=x-\sum_{k=1}^{P}\,\frac{\left(-1\right)^{k-1}}{2\,k-1} \left(\frac {\sin\!\left(x\right)-t\cos\!\left(x\right)} {\cos\!\left(x\right)+t\sin\!\left(x\right)} \right)^{2\,k-1}.\] For every initial value $x_0$ sufficiently close to $\arctan\left(t\right)$, the sequence \[x_{n+1}=T\left(x_{n}\right)\;;\,n=0,1,\ldots\] is converging to $\arctan\left(t\right)$ with order of convergence exactly $\left(2\,P+1\right)$. The computational test we performed demonstrates the efficiency of the method. \selectlanguage{ngerman} \[\] \[\textbf{Zusammenfassung}\] In dieser Abhandlung stellen wir ein Fixpunktverfahren zur Berechnung des arcustangens auf Basis von sinus und cosinus vor. Es sei $t\in \mathbb{R}^{+}$ und $P\in\mathbb{N}$. Wir definieren: \[T\left(x\right)=x-\sum_{k=1}^{P}\,\frac{\left(-1\right)^{k-1}}{2\,k-1} \left(\frac {\sin\!\left(x\right)-t\cos\!\left(x\right)} {\cos\!\left(x\right)+t\sin\!\left(x\right)}\right) ^{2\,k-1}.\] Für jeden Startwert $x_0$ hinreichend nahe bei $\arctan\left(t\right)$ konvergiert die Folge \[x_{n+1}=T\left(x_{n}\right)\;;\,n=0,1,\ldots\] gegen $\arctan\left(t\right)$ mit Konvergenzordnung genau $\left(2\,P+1\right)$. Anhand einer praktischen Berechnung von $\fracπ{4}$ zeigen wir die Effizienz des Verfahrens. \[\text{Deutsche Version ab Seite 17}\]

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alois Schiessl. 2026-05-11. A fixed point iteration method for the arctangent with any odd order of convergence based on sine and cosine. https://arxiv.org/abs/2605.06698

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. Liu proposed the conjecture \[ \sum_{\text{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \ge 2+\left(\frac{2r}{R}\right)^k,\qquad k>1, \] with the reverse inequality for $k<1$. We prove this conjecture by reducing it to an algebraic inequality for three positive variables with prescribed sum and product. We also determine the equality cases.

math.GM

A quadratic critical-value conjecture for the fifth Bessel moment

We conjecture an explicit evaluation of the pure fifth Bessel moment $\int_0^\infty K_0(t)^5\,dt$ as a quadratic expression in the critical value $L(f,2)$ of the weight-three, level-60 newform $f$ (LMFDB orbit 60.3.b.a) identified in the twisted fifth-moment modularity theorem of Lim, Tu and Yu, with coefficients in $\mathbb{Q}(\sqrt{5})$ and the square taken before the real and imaginary parts. Directed interval computations, using no stored Bessel or $L$-values, bound the absolute discrepancy by $10^{-358}$. We prove three exact modular identities for $f$: the Petersson-norm formula $\langle f,f\rangle_{60} = \frac{3(5-\sqrt{5})}{2π^4}|L(f,2)|^2$, the coefficient-conjugation relation $L(f^σ,2) = κL(f,2)$ with explicit $κ\in \mathbb{Q}(\sqrt{5},i)$, and the twisted symmetric-square evaluation $L(χ_{-4}\mathrm{Sym}^2 f,2) = \sqrt{15}\,π^2 \langle f,f\rangle_{60}$, together with $L(χ_{-4}\mathrm{Sym}^2 f,3) = π^4\langle f,f\rangle_{60}/8$, in the full Euler-factor normalization of Lim, Tu and Yu. The last identity shows that the companion norm conjecture $D_{5,\mathrm{odd}} = \frac{3\sqrt{15}(5-\sqrt{5})}{2}|L(f,2)|^2$ is equivalent to the symmetric-square conjecture $D_{5,\mathrm{odd}} = π^2 L(χ_{-4}\mathrm{Sym}^2 f,2)$ of Lim, Tu and Yu, while the exact relation $D_{5,\mathrm{even}} = π^2 D_{5,\mathrm{odd}}/(2\sqrt{15})$ follows from Chuang's period formulas. Every Bessel-to-modular equality, including the individual-period formula, remains conjectural. Complete proofs, exact rational certificates and verification programs are included as ancillary files.

math.GM