相关论文: Chaotic Root-Finding for a Small Class of Polynomi…

It is shown in this paper that non-conforming finite elements on the triangle using $P^{1}$-nonconforming polynomials and $P^{2}$ -conforming polynomials can be easily built and used.They appear as an 'enriched' version of the standard…

In this paper we report on an application of computer algebra in which mathematical puzzles are generated of a type that had been widely used in mathematics contests by a large number of participants worldwide. The algorithmic aspect of our…

Counting problems, determining the number of possible states of a large system under certain constraints, play an important role in many areas of science. They naturally arise for complex disordered systems in physics and chemistry, in…

It is known that difference equations generated as the Newton-Raphson iteration for quadratic equations are solvable in closed form, and the solution can be constructed from linear three-term recurrence relations with constant coefficients.…

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

A fractal method to detect, locate and quantify chaos in multi-dimensional-conservative-closed systems, based on the creation of artificial exits, is presented. The method is invariant under space-time changes of coordinates and can be used…

Lie group analysis of the difference equations of the form \begin{align*} x_{n+1} =\frac{x_{n-4}x_{n-3}}{x_{n}(a_n +b_nx_{n-4}x_{n-3}x_{n-2}x_{n-1})}, \end{align*} where $a_n$ and $b_n$ are real sequences, is performed and non-trivial…

By characterizing all orthogonal polynomials sequences $(P_n)_{n\geq 0}$ for which $$ (ax+b)(\triangle +2\,\mathrm{I})P_n(x(s-1/2))=(a_n x+b_n)P_n(x)+c_n P_{n-1}(x),\quad n=0,1,2,\dots, $$ where $\,\mathrm{I}$ is the identity operator, $x$…

Given a function f: [a,b] -> R, if f(a) < 0 and f(b)> 0 and f is continuous, the Intermediate Value Theorem implies that f has a root in [a,b]. Moreover, given a value-oracle for f, an approximate root of f can be computed using the…

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Theorem. An irreducible cubic polynomial with rational coefficients has a root in a one step radical extension of Q if and only if the discriminate is a square of a rational number. Theorem. An irreducible polynomial x^4+px^2+qx+s with…

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

We first show the existence and nature of convergence to a limiting set of roots for polynomials in a three-term recurrence of the form $p_{n+1}(z) = Q_k(z)p_{n}(z)+ \gamma p_{n-1}(z)$ as $n$ $\rightarrow$ $\infty$, where the coefficient…

Here we define natural chaotic systems, like the earths weather and climate system, as chaotic systems which are open to the world so have constantly changing boundary conditions, and measurements of their states are subject to errors. In…

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…

This paper seeks to further explore the distribution of the real roots of random polynomials with non-centered coefficients. We focus on polynomials where the typical values of the coefficients have power growth and count the average number…

The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…

We generate new hierarchy of many-parameter family of maps of the interval [0,1] with an invariant measure, by composition of the chaotic maps of reference [1]. Using the measure, we calculate Kolmogorov-Sinai entropy, or equivalently…

We consider random polynomials whose coefficients are independent and uniform on {-1,1}. We prove that the probability that such a polynomial of degree n has a double root is o(n^{-2}) when n+1 is not divisible by 4 and asymptotic to…