23,172 research outputs found
Clustering Complex Zeros of Triangular Systems of Polynomials
This paper gives the first algorithm for finding a set of natural
-clusters of complex zeros of a triangular system of polynomials
within a given polybox in , for any given . Our
algorithm is based on a recent near-optimal algorithm of Becker et al (2016)
for clustering the complex roots of a univariate polynomial where the
coefficients are represented by number oracles.
Our algorithm is numeric, certified and based on subdivision. We implemented
it and compared it with two well-known homotopy solvers on various triangular
systems. Our solver always gives correct answers, is often faster than the
homotopy solver that often gives correct answers, and sometimes faster than the
one that gives sometimes correct results.Comment: Research report V6: description of the main algorithm update
Continuity argument revisited: geometry of root clustering via symmetric products
We study the spaces of polynomials stratified into the sets of polynomial
with fixed number of roots inside certain semialgebraic region , on its
border, and at the complement to its closure. Presented approach is a
generalisation, unification and development of several classical approaches to
stability problems in control theory: root clustering (-stability) developed
by R.E. Kalman, B.R. Barmish, S. Gutman et al., -decomposition(Yu.I.
Neimark, B.T. Polyak, E.N. Gryazina) and universal parameter space method(A.
Fam, J. Meditch, J.Ackermann).
Our approach is based on the interpretation of correspondence between roots
and coefficients of a polynomial as a symmetric product morphism.
We describe the topology of strata up to homotopy equivalence and, for many
important cases, up to homeomorphism. Adjacencies between strata are also
described. Moreover, we provide an explanation for the special position of
classical stability problems: Hurwitz stability, Schur stability,
hyperbolicity.Comment: 45 pages, 4 figure
On the Number of Zeros of Abelian Integrals: A Constructive Solution of the Infinitesimal Hilbert Sixteenth Problem
We prove that the number of limit cycles generated by a small
non-conservative perturbation of a Hamiltonian polynomial vector field on the
plane, is bounded by a double exponential of the degree of the fields. This
solves the long-standing tangential Hilbert 16th problem. The proof uses only
the fact that Abelian integrals of a given degree are horizontal sections of a
regular flat meromorphic connection (Gauss-Manin connection) with a
quasiunipotent monodromy group.Comment: Final revisio
New Acceleration of Nearly Optimal Univariate Polynomial Root-findERS
Univariate polynomial root-finding has been studied for four millennia and is
still the subject of intensive research. Hundreds of efficient algorithms for
this task have been proposed. Two of them are nearly optimal. The first one,
proposed in 1995, relies on recursive factorization of a polynomial, is quite
involved, and has never been implemented. The second one, proposed in 2016,
relies on subdivision iterations, was implemented in 2018, and promises to be
practically competitive, although user's current choice for univariate
polynomial root-finding is the package MPSolve, proposed in 2000, revised in
2014, and based on Ehrlich's functional iterations. By proposing and
incorporating some novel techniques we significantly accelerate both
subdivision and Ehrlich's iterations. Moreover our acceleration of the known
subdivision root-finders is dramatic in the case of sparse input polynomials.
Our techniques can be of some independent interest for the design and analysis
of polynomial root-finders.Comment: 89 pages, 5 figures, 2 table
- …