Related papers: Chebyshev's method applied to polynomials with two…
We study the approximation of conformal mappings with the polynomials defined by Keldysh and Lavrentiev from an extremal problem considered by Julia. These polynomials converge uniformly on the closure of any Smirnov domain to the conformal…
It is shown that if two hyperbolic polynomials have a particular factorization into quadratics, then their roots satisfy a power majorization relation whenever key coefficients in their factorizations satisfy a corresponding majorization…
A theorem of Kushnirenko and Bernstein shows that the number of isolated roots of a system of polynomials in a torus is bounded above by the mixed volume of the Newton polytopes of the given polynomials, and this upper bound is generically…
Chebyshev varieties are algebraic varieties parametrized by Chebyshev polynomials or their multivariate generalizations. We determine the dimension, degree, singular locus and defining equations of these varieties. We explain how they play…
Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these…
We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly independent functions on an interval $[a,b]$. A general theory of Chebyshev sets guarantees the existence of rules with a Gaussian property, in…
We investigate the well known Newton method to find roots of entire holomorphic functions. Our main result is that the immediate basin of attraction for every root is simply connected and unbounded. We also introduce ``virtual immediate…
For a family of holomorphic functions on an arbitrary domain, we introduce Fatou and Julia like sets, and establish some of their interesting properties.
We extend results by Barnsley et al. about orthogonal polynomials on Julia sets to the case of generalized Julia sets. The equilibrium measure is considered. In addition, we discuss optimal smoothness of Green functions and Parreau-Widom…
We prove that a long iteration of rational maps is expanding near boundaries of bounded type Siegel disks. This leads us to extend Petersen's local connectivity result on the Julia sets of quadratic Siegel polynomials to a general case. A…
The main object of the paper is to reveal connections between Chebyshev polynomials of the first and second kinds and Fibonacci polynomials introduced by Catalan. This is achieved by relating the respective (ordinary and exponential)…
We investigate a trivariate polynomial associated with rooted trees. It generalises a bivariate polynomial for rooted trees that was recently introduced by Liu. We show that this polynomial satisfies a deletion-contraction recursion and can…
We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…
In this paper we develop a new method which is a generalization of the Obreshkoff -Ehrlich method for the cases of algebraic, trigonometric and exponential polynomials. This method has a cubic rate of convergence. It is efficient from the…
We prove that the Julia set $J(f)$ of at most finitely renormalizable unicritical polynomial $f:z\mapsto z^d+c$ with all periodic points repelling is locally connected. (For $d=2$ it was proved by Yoccoz around 1990.) It follows from a…
For a sequence of complex parameters $\{c_n\}$ we consider the compositions of functions $f_{c_n} (z) = z^2 + c_n$, which is the non-autonomous version of the classical quadratic dynamical system. The definitions of Julia and Fatou sets are…
Using generating functions, we derive many identities involving balancing and Lucas-balancing polynomials. By relating these polynomials to Chebyshev polynomials of the first and second kind, and Fibonacci and Lucas numbers, we offer some…
In this paper we follow the general approach, proposed earlier by the first author, which is derived from the invariant theory field and provides a way of obtaining of the polynomial identities for any arbitrary polynomial family. We…
A new variant of Newton's method - named Backtracking New Q-Newton's method (BNQN) - which has strong theoretical guarantee, is easy to implement, and has good experimental performance, was recently introduced by the third author.…
We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…