We study the strange behavior in floating-point arithmetic of a function proposed by Nicholas Higham, consisting of repeated square roots extraction followed by the same number of times squaring and find its fixpoints. For IEEE standard double precision floating point numbers the fixpoints have the form
![\[ x \in \left\{\left( 1+k\mathrm{eps}\right) ^{\frac{1}{\mathrm{eps}}},\quad k=\left[ -745:\frac{1}{2}:-\frac{1}{2},0:709\right]\right\} \cup \{0\} , \]](https://www.carpathian.cunbm.utcluj.ro/wp-content/ql-cache/quicklatex.com-87aca5b608d2a57c933263a7a75b5b5b_l3.png "Rendered by QuickLaTeX.com")
where 
is the machine epsilon.
| Author(s) | Trîmbiţaş, Radu T. |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2021.02.20 |
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
Fixed point theorems for basic θ-contraction and applications
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
Periodic cycles for an extension of generalized 3x + 1 functions
Some remarks on expansive mappings in metric spaces
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
Extreme solution for fractional differential equation with nonlinear boundary condition
Generalized Split Feasibility Problem: Solution by Iteration
carpathian_2021_37_2_355_360