Related papers: Global dynamics of the real secant method

Pilgrim's Finite Global Attractor Conjecture has been verified for polynomials [1], but remains open for general rational maps. In this paper, we prove the conjecture for a family of rational maps obtained by gluing two PCF polynomials…

Recursive maps of high order of convergence $m$ (say $m=2^{10}$ or $m=2^{20}$) induce certain monotone step functions from which one can filter relevant information needed to globally separate and compute the real roots of a function on a…

Given a polynomial $p$ of degree $d$ and a bound $\kappa$ on a condition number of $p$, we present the first root-finding algorithms that return all its real and complex roots with a number of bit operations quasi-linear in $d…

This paper is concerned with exact real solving of well-constrained, bivariate polynomial systems. The main problem is to isolate all common real roots in rational rectangles, and to determine their intersection multiplicities. We present…

In the present study, we propose necessary and sufficient assumptions on the coefficients in order to only get distinct real roots of polynomials.

We investigate two well known dynamical systems that are designed to find roots of univariate polynomials by iteration: the methods known by Newton and by Ehrlich-Aberth. Both are known to have found all roots of high degree polynomials…

We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…

This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…

We describe a framework for bounding extreme values of quantities on global attractors of differential dynamical systems. A global attractor is the minimal set that attracts all bounded sets; it contains all forward-time limit points. Our…

We study the behaviour of discrete dynamical systems generated by a continuous map $f$ of a compact real interval into itself where at randomly chosen times a function different from $f$ - so called impulse function is applied. We show that…

We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…

Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution…

The eccentric pie chart, a generalization of the traditional pie chart is introduced. An arbitrary point is fixed within the circle and rays are drawn from it. A sector is bounded by a pair of neighboring rays and the arc between them, The…

We extract a two-dimensional dynamical system from the theorems of Pappus and Steiner in classical projective geometry. We calculate an explicit formula for this system, and study its elementary geometric properties. Then we use Artin…

The dynamical classification of rational maps is a central concern of holomorphic dynamics. Much progress has been made, especially on the classification of polynomials and some approachable one-parameter families of rational maps; the goal…

We introduce a new algorithm denoted DSC2 to isolate the real roots of a univariate square-free polynomial f with integer coefficients. The algorithm iteratively subdivides an initial interval which is known to contain all real roots of f.…

This paper presents a method to determine the reachable set (RS) of spacecraft after a single velocity impulse with an arbitrary direction, which is appropriate for the RS in both the state and observation spaces under arbitrary dynamics,…

We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

Chaotic dynamics is an important source for generating pseudorandom binary sequences (PRNS). Much efforts have been devoted to obtaining period distribution of the generalized discrete Arnold's Cat map in various domains using all kinds of…