International audienceThe Budan table of f collects the signs of the iterated derivative of f. We revisit the classical Budan-Fourier theorem for a univariate real polynomial f and establish a new connexity property of its Budan table. We use this property to characterize the virtual roots of f, (introduced by Gonzales-Vega, Lombardi, Mahe in 1998); they are continuous functions of the coecients of f. We also consider a property (P) of a polynomial f, which is generically satis ed, it eases the topological-combinatorial description and study of the Budan tables. A natural extension of the information collected by the virtual roots provides alternative representations of (P)-polynomials; while an attached tree structure allows a strati ficat...
International audienceThe fact that a real univariate polynomial misses some real roots is usually o...
(Supported by NSF Grant CCF 1116736) Abstract. Univariate polynomial root-finding is both classical ...
AbstractIn this paper we count the number ♯n(0,k), k⩽n−1, of connected components in the space Δn(0,...
International audienceThe Budan table of f collects the signs of the iterated derivative of f. We re...
The Budan table of f collects the signs of the iterated derivatives of f. We revisit the classical B...
Given a degree n univariate polynomial f(x), the Budan-Fourier function Vf (x) counts the sign chang...
Given a degree n univariate polynomial f(x), the Budan-Fourier function Vf (x) counts the sign chang...
International audienceAfter the works of Gonzales-Vega, Lombardi, Mahé,\cite{Lomb1} and Coste, Lajou...
After the works of Gonzales-Vega, Lombardi, Mahé,[11] and Coste, Lajous, Lombardi, Roy [6], we cons...
AbstractIn this Note we give a proof of a generalized version of the classical Budan–Fourier theorem...
Many problems in computer algebra and numerical analysis can be reduced to counting or approximating...
We consider a univariate polynomial f with real coecients having a high degree N but a rather small ...
International audienceThe fact that a real univariate polynomial misses some real roots is usually o...
International audienceThe fact that a real univariate polynomial misses some real roots is usually o...
International audienceThe fact that a real univariate polynomial misses some real roots is usually o...
International audienceThe fact that a real univariate polynomial misses some real roots is usually o...
(Supported by NSF Grant CCF 1116736) Abstract. Univariate polynomial root-finding is both classical ...
AbstractIn this paper we count the number ♯n(0,k), k⩽n−1, of connected components in the space Δn(0,...
International audienceThe Budan table of f collects the signs of the iterated derivative of f. We re...
The Budan table of f collects the signs of the iterated derivatives of f. We revisit the classical B...
Given a degree n univariate polynomial f(x), the Budan-Fourier function Vf (x) counts the sign chang...
Given a degree n univariate polynomial f(x), the Budan-Fourier function Vf (x) counts the sign chang...
International audienceAfter the works of Gonzales-Vega, Lombardi, Mahé,\cite{Lomb1} and Coste, Lajou...
After the works of Gonzales-Vega, Lombardi, Mahé,[11] and Coste, Lajous, Lombardi, Roy [6], we cons...
AbstractIn this Note we give a proof of a generalized version of the classical Budan–Fourier theorem...
Many problems in computer algebra and numerical analysis can be reduced to counting or approximating...
We consider a univariate polynomial f with real coecients having a high degree N but a rather small ...
International audienceThe fact that a real univariate polynomial misses some real roots is usually o...
International audienceThe fact that a real univariate polynomial misses some real roots is usually o...
International audienceThe fact that a real univariate polynomial misses some real roots is usually o...
International audienceThe fact that a real univariate polynomial misses some real roots is usually o...
(Supported by NSF Grant CCF 1116736) Abstract. Univariate polynomial root-finding is both classical ...
AbstractIn this paper we count the number ♯n(0,k), k⩽n−1, of connected components in the space Δn(0,...