Related papers: Iterative square roots of functions

In this paper we develop a tool to identify functions which have no iterative roots of any order. Using this, we prove that when $X$ is $[0,1]^m$, $\mathbb{R}^m$ or $S^1$, every non-empty open set of the space $\mathcal{C}(X)$ of continuous…

Some easily verifiable sufficient conditions for the nonexistence of iterative roots for multifunctions on arbitrary nonempty sets are presented. Typically if the graph of the multifunction has a distinguished point with a relatively large…

We study random independent and identically distributed iterations of functions from an iterated function system of homeomorphisms on the circle which is minimal. We show how such systems can be analyzed in terms of iterated function…

We construct a family of iterations for computing the principal square root of a square matrix $A$ using Zolotarev's rational minimax approximants of the square root function. We show that these rational functions obey a recursion, allowing…

We study the ``approximate squaring'' map f(x) := x ceiling(x) and its behavior when iterated. We conjecture that if f is repeatedly applied to a rational number r = l/d > 1 then eventually an integer will be reached. We prove this when…

Let $\mathcal{C}(S^{m})$ denote the set of continuous maps from the unit sphere $S^{m}$ in $\mathbb{R}^{m+1}$ into itself endowed with the supremum norm. We prove that the set $\{f^n: f\in \mathcal{C}(S^{m})~\text{and}~n\ge 2\}$ of iterated…

Let $Rat_d$ denote the space of holomorphic self-maps of ${\bf P}^1$ of degree $d\geq 2$, and $\mu_f$ the measure of maximal entropy for $f\in Rat_d$. The map of measures $f\mapsto\mu_f$ is known to be continuous on $Rat_d$, and it is shown…

A finite family $\mathcal{F}=\{f_1,\ldots,f_n\}$ of continuous selfmaps of a given metric space $X$ is called an iterated function system (shortly IFS). In a case of contractive selfmaps of a complete metric space is well-known that IFS has…

We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with…

Graph G is the square of graph H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Given H it is easy to compute its square H^2. Determining if a given graph G is the square of some graph is not easy…

Let C be a closed subset of a topological space X, and let f : C --> X. Let us assume that f is continuous and f(x) lies in C for every x in the boundary of C. How many times can one iterate f? This paper provides estimates on the number of…

We study invariant sets and measures generated by iterated function systems defined on countable discrete spaces that are uniform grids of a finite dimension. The discrete spaces of this type can be considered as models of spaces in which…

A new method of root finding is formulated that uses a numerical iterative process involving three points. A given function y = f(x) whose roots are desired is fitted and approximated by a polynomial function of the form P(x)= a(x-b)^N that…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

This work is to propose an iterative method of choice to compute a stable subspace of a regular matrix pencil. This approach is to define a sequence of matrix pencils via particular left null spaces. We show that this iteration preserves a…

A graph H is a square root of a graph G if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of deciding whether a given graph admits a square root. This problem…

We present an iterative root finding method for harmonic mappings in the complex plane, which is a generalization of Newton's method for analytic functions. The complex formulation of the method allows an analysis in a complex variables…

Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…

Let $C_{n,g}$ be the number of rooted cubic maps with $2n$ vertices on the orientable surface of genus $g$. We show that the sequence $(C_{n,g}:g\ge 0)$ is asymptotically normal with mean and variance asymptotic to $(1/2)(n-\ln n)$ and…

The work that consists of two parts is devoted to the problem of enumerating unrooted $r$-regular maps on the torus up to all its symmetries. We begin with enumerating near-$r$-regular rooted maps on the torus, projective plane and the…