Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A systematic approach to computing and indexing the fixed points of an iterated exponential (2009.02745v1)

Published 6 Sep 2020 in math.NA, cs.NA, and math.CV

Abstract: This paper describes a systematic method of numerically computing and indexing fixed points of $z{zw}$ for fixed $z$ or equivalently, the roots of $T_2(w;z)=w-z{zw}$. The roots are computed using a modified version of fixed-point iteration and indexed by integer triplets ${n,m,p}$ which associate a root to a unique branch of $T_2$. This naming convention is proposed sufficient to enumerate all roots of the function with $(n,m)$ enumerated by $\mathbb{Z}2$. However, branches near the origin can have multiple roots. These cases are identified by the third parameter $p$. This work was done with rational or symbolic values of $z$ enabling arbitrary precision arithmetic. A selection of roots up to order ${10{12},10{12},p}$ with $|z|\leq 10{12}$ was used as test cases. Results were accurate to the precision used in the computations, generally between $30$ and $100$ digits. Mathematica ver. $12$ was used to implement the algorithms.

Summary

We haven't generated a summary for this paper yet.