An official website of the United States government
Finding roots of univariate polynomials is one of the fundamental tasks of numerics, and there is still a wide gap between root finders that are well understood in theory and those that perform well in practice. We investigate the root-finding method of Weierstrass, also known as the Durand–Kerner-method: this is a root finder that tries to approximate all roots of a given polynomial in parallel. This method has been introduced 130 years ago and has since then a good reputation for finding all roots in practice except in obvious cases of symmetry. Nonetheless, very little is known about its global dynamics and convergence properties. We show that the Weierstrass method, like the well-known Newton method, is not generally convergent: there are open sets of polynomials p p of every degree d ≥ 3 d \ge 3 such that the dynamics of the Weierstrass method applied to p p exhibits attracting periodic orbits. Specifically, all polynomials sufficiently close to Z 3 + Z + 175 Z^3 + Z + 175 have attracting cycles of period 4 4 . Here, period 4 4 is minimal: we show that for cubic polynomials, there are no periodic orbits of length 2 2 or 3 3 that attract open sets of starting points. We also establish another convergence problem for the Weierstrass method: for almost every polynomial of degree d ≥ 3 d\ge 3 there are orbits that are defined for all iterates but converge to ∞ \infty ; this is a problem that does not occur for Newton’s method. Our results are obtained by first interpreting the original problem coming from numerical mathematics in terms of higher-dimensional complex dynamics, then phrasing the question in algebraic terms in such a way that we could finally answer it by applying methods from computer algebra. The main innovation here is the translation into an algebraic question, which is amenable to (exact) computational methods close to the limits of current computer algebra systems.
more »
« less
Introducing isodynamic points for binary forms and their ratios
Abstract The isodynamic points of a plane triangle are known to be the only pair of its centers invariant under the action of the Möbius group $${\mathcal {M}}$$ M on the set of triangles, Kimberling (Encyclopedia of Triangle Centers, http://faculty.evansville.edu/ck6/encyclopedia ). Generalizing this classical result, we introduce below the isodynamic map associating to a univariate polynomial of degree $$d\ge 3$$ d ≥ 3 with at most double roots a polynomial of degree (at most) $$2d-4$$ 2 d - 4 such that this map commutes with the action of the Möbius group $${\mathcal {M}}$$ M on the zero loci of the initial polynomial and its image. The roots of the image polynomial will be called the isodynamic points of the preimage polynomial. Our construction naturally extends from univariate polynomials to binary forms and further to their ratios.
more »
« less
- Award ID(s):
- 2100791
- PAR ID:
- 10439505
- Publisher / Repository:
- Springer
- Date Published:
- Journal Name:
- Complex Analysis and its Synergies
- Volume:
- 9
- Issue:
- 1
- ISSN:
- 2524-7581
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Santhanam, Rahul (Ed.)For an odd prime p, we say f(X) ∈ F_p[X] computes square roots in F_p if, for all nonzero perfect squares a ∈ F_p, we have f(a)² = a. When p ≡ 3 mod 4, it is well known that f(X) = X^{(p+1)/4} computes square roots. This degree is surprisingly low (and in fact lowest possible), since we have specified (p-1)/2 evaluations (up to sign) of the polynomial f(X). On the other hand, for p ≡ 1 mod 4 there was previously no nontrivial bound known on the lowest degree of a polynomial computing square roots in F_p. We show that for all p ≡ 1 mod 4, the degree of a polynomial computing square roots has degree at least p/3. Our main new ingredient is a general lemma which may be of independent interest: powers of a low degree polynomial cannot have too many consecutive zero coefficients. The proof method also yields a robust version: any polynomial that computes square roots for 99% of the squares also has degree almost p/3. In the other direction, Agou, Deliglése, and Nicolas [Agou et al., 2003] showed that for infinitely many p ≡ 1 mod 4, the degree of a polynomial computing square roots can be as small as 3p/8.more » « less
-
Abstract Let $$f$$ be a degree $$d$$ bicritical rational map with critical point set $$\mathcal{C}_f$$ and critical value set $$\mathcal{V}_f$$. Using the group $$\textrm{Deck}(f^k)$$ of deck transformations of $f^k$, we show that if $$g$$ is a bicritical rational map that shares an iterate with $$f$$, then $$\mathcal{C}_f = \mathcal{C}_g$$ and $$\mathcal{V}_f = \mathcal{V}_g$$. Using this, we show that if two bicritical rational maps of even degree $$d$$ share an iterate, then they share a second iterate, and both maps belong to the symmetry locus of degree $$d$$ bicritical rational maps.more » « less
-
Let $$p:\mathbb{C}\rightarrow \mathbb{C}$$ be a polynomial. The Gauss–Lucas theorem states that its critical points, $$p^{\prime }(z)=0$$ , are contained in the convex hull of its roots. We prove a stability version whose simplest form is as follows: suppose that $$p$$ has $n+m$ roots, where $$n$$ are inside the unit disk, $$\begin{eqnarray}\max _{1\leq i\leq n}|a_{i}|\leq 1~\text{and}~m~\text{are outside}~\min _{n+1\leq i\leq n+m}|a_{i}|\geq d>1+\frac{2m}{n};\end{eqnarray}$$ then $$p^{\prime }$$ has $n-1$ roots inside the unit disk and $$m$$ roots at distance at least $(dn-m)/(n+m)>1$ from the origin and the involved constants are sharp. We also discuss a pairing result: in the setting above, for $$n$$ sufficiently large, each of the $$m$$ roots has a critical point at distance $${\sim}n^{-1}$$ .more » « less
-
We prove that the most natural low-degree test for polynomials over finite fields is “robust” in the high-error regime for linear-sized fields. Specifically we consider the “local” agreement of a function $$f:\mathbb{F}_{q}^{m}\rightarrow \mathbb{F}_{q}$$ from the space of degree-d polynomials, i.e., the expected agreement of the function from univariate degree-d polynomials over a randomly chosen line in $$\mathbb{F}_{q}^{m}$$, and prove that if this local agreement is $$\varepsilon\geq\Omega((d/q)^{\tau}))$$ for some fixed $$\tau > 0$$, then there is a global degree-d polynomial $$Q:\mathbb{F}_{q}^{m}\rightarrow \mathbb{F}_{q}$$ with agreement nearly $$\varepsilon$$ with $$f$$. This settles a long-standing open question in the area of low-degree testing, yielding an $O(d)$ -query robust test in the “high-error” regime (i.e., when $$\varepsilon < 1/2)$$. The previous results in this space either required $$\varepsilon > 1/2$$ (Polishchuk & Spielman, STOC 1994), or $$q=\Omega(d^{4})$$ (Arora & Sudan, Combinatorica 2003), orneeded to measure local distance on 2-dimensional “planes” rather than one-dimensional lines leading to $$\Omega(d^{2})$$ -query complexity (Raz & Safra, STOC 1997). Our analysis follows the spirit of most previous analyses in first analyzing the low-variable case $(m=O(1))$ and then “boot-strapping” to general multivariate settings. Our main technical novelty is a new analysis in the bivariate setting that exploits a previously known connection between multivariate factorization and finding (or testing) low-degree polynomials, in a non “black-box” manner. This connection was used roughly in a black-box manner in the work of Arora & Sudan — and we show that opening up this black box and making some delicate choices in the analysis leads to our essentially optimal analysis. A second contribution is a bootstrapping analysis which manages to lift analyses for $m=2$ directly to analyses for general $$m$$, where previous works needed to work with $m=3$ or $m=4$ — arguably this bootstrapping is significantly simpler than those in prior works.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript
- Journal Article:
- https://doi.org/10.1007/s40627-022-00112-4
