English
Related papers

Related papers: Univariate real root isolation in an extension fie…

200 papers

Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…

Optimization and Control · Mathematics 2016-12-08 Taoran Fu , Bo Jiang , Zhening Li

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

Combinatorics · Mathematics 2017-12-19 David G. L. Wang , Jiarui Zhang

In this paper, we derive explicit formulas for computing the roots of $ax^{2}+bx+c=0$ with $a$ being not invertible in split quaternion algebra. We also imitate the approach developed by Opfer, Janovska and Falcao etc. to verify our results…

Algebraic Geometry · Mathematics 2024-03-29 Wensheng Cao

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

Classical Analysis and ODEs · Mathematics 2008-03-11 Steve Fisk

In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such…

Computational Complexity · Computer Science 2015-07-09 Ignacio Garcia-Marco , Pascal Koiran

For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…

Classical Analysis and ODEs · Mathematics 2022-04-12 Reuben Wheeler

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

Numerical Analysis · Mathematics 2023-09-18 Bor Plestenjak , Michiel E. Hochstenbach

We develop the tools to bound extreme roots of multivariate real zero polynomials globally. This is done through the use of a relaxation that approximates their rigidly convex sets. This relaxation can easily be constructed using the degree…

Combinatorics · Mathematics 2025-10-14 Alejandro González Nevado

A new short clear proof of the asymptotics for the number $c_n$ of real roots of the Bernoulli polynomials $B_n(x)$, as well as for the maximal root $y_n$: $$y_n=\frac{n}{2\pi e}+\frac{\ln(n)}{4\pi e}+O(1)\quad\text{and}\quad…

Number Theory · Mathematics 2025-02-07 A. Efimov

Very recent work introduces an asymptotically fast subdivision algorithm, denoted ANewDsc, for isolating the real roots of a univariate real polynomial. The method combines Descartes' Rule of Signs to test intervals for the existence of…

Mathematical Software · Computer Science 2016-05-03 Alexander Kobel , Fabrice Rouillier , Michael Sagraloff

Let $\A_0, \A_1, \ldots, \A_n$ be given square matrices of size $m$ with rational coefficients. The paper focuses on the exact computation of one point in each connected component of the real determinantal variety $\{\X \in\RR^n \: :\:…

Symbolic Computation · Computer Science 2014-12-19 Didier Henrion , Simone Naldi , Mohab Safey El Din

Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…

Computational Geometry · Computer Science 2020-08-27 Huu Phuoc Le , Mohab Safey El Din , Timo de Wolff

A polynomial is real-rooted if all of its roots are real. This note gives a simple proof of the Hermite-Sylvester theorem that a polynomial $f(x) \in {\mathbf R}[x]$ is real-rooted if and only if an associated quadratic form is positive…

Combinatorics · Mathematics 2021-03-10 Melvyn B. Nathanson

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$.…

Number Theory · Mathematics 2020-11-24 Yuri Bilu , Florian Luca

Viewing a bivariate polynomial f in R[x,t] as a family of univariate polynomials in t parametrized by real numbers x, we call f real rooted if this family consists of monic polynomials with only real roots. If f is the characteristic…

Algebraic Geometry · Mathematics 2016-10-24 Christoph Hanselka

In this paper, we exhibit new monotonicity properties of roots of families of orthogonal polynomials $P_n^{(z)}(x)$ depending polynomially on a parameter (Laguerre and Gegenbauer). By establishing that $P_n^{(z)}(x)$ are realrooted in $z$…

Classical Analysis and ODEs · Mathematics 2024-12-10 Aurelien Xavier Gribinski

A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich , Jorge P. Zubelli

Let $f(x)=p(x)-q(x)$ be a polynomial with real coefficients whose roots have nonnegative real part, where $p$ and $q$ are polynomials with nonnegative coefficients. In this paper, we prove the following: Given an initial point $x_0 > 0$,…

Numerical Analysis · Mathematics 2017-12-12 Nicolas Gillis

In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (\dmm), on the isolated roots of polynomial systems, specifically on the minimum distance between any two such roots. The bounds exploit the…

Symbolic Computation · Computer Science 2010-07-26 Ioannis Z. Emiris , Bernard Mourrain , Elias Tsigaridas

We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…

Symbolic Computation · Computer Science 2021-02-15 Mark Giesbrecht , Hui Huang , George Labahn , Eugene Zima
‹ Prev 1 4 5 6 7 8 10 Next ›