FLQ, the fastest quadratic complexity bound on the values of positive roots of polynomials

MaRDI QIDQ3598609zbMATH OpenFDO

Authors Andreas I. Argyris, Alkiviadis G. Akritas, Adam Strzeboński

Publication date 3 February 2009

Full work available at URL https://eudml.org/doc/11459

zbMATH Keywords

numerical examplescontinued fractions methodVincent's theoremlinear and quadratic complexity boundspositive roots of polynomialsreal root isolation methods

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04)

Recommendations

• Linear and quadratic complexity bounds on the values of the positive roots of polynomials
• scientific article; zbMATH DE number 7267629
• Improving the performance of the continued fractions method using new bounds of positive roots
• Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds
• On the quality of some root-bounds

Cited in

(3)

• Linear and quadratic complexity bounds on the values of the positive roots of polynomials
• Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation?
• Vincent's theorem of 1836: overview and future research

Describes a project that uses

Uses Software

• ISOLATE

This page was built for publication: FLQ, the fastest quadratic complexity bound on the values of positive roots of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598609)