Factorisation de fractions rationnelles et de suites récurrentes
Finding new families of rank-one convex polynomials
FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials
In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate...
Fonctions convexes et logarithmes de polynômes à coefficients positifs
Fractional double Newton step properties for polynomials with all real zeros
Functions without residue and a bilinear differential equation