Email Gateway (Aug 22 2022 at 18:25): Email Gateway (Aug 22 2022 at 18:25):From: "Thiemann, René" <Rene.Thiemann@uibk.ac.at>
Dear all,
it is my pleasure to announce a new AFP-entry which is available
at https://www.isa-afp.org/entries/Budan_Fourier.html
The Budan-Fourier Theorem and Counting Real Roots with Multiplicity
by Wenda Li
This entry is mainly about counting and approximating real roots (of a
polynomial) with multiplicity. We have first formalised the Budan-Fourier
theorem: given a polynomial with real coefficients, we can calculate sign
variations on Fourier sequences to over-approximate the number of real roots
(counting multiplicity) within an interval. When all roots are known to be real,
the over-approximation becomes tight: we can utilise this theorem to count real
roots exactly. It is also worth noting that Descartes' rule of sign is a direct
consequence of the Budan-Fourier theorem, and has been included in this entry.
In addition, we have extended previous formalised Sturm's theorem to count real
roots with multiplicity, while the original Sturm's theorem only counts distinct
real roots. Compared to the Budan-Fourier theorem, our extended Sturm's theorem
always counts roots exactly but may suffer from greater computational cost.
Happy counting,
René
Last updated: Nov 21 2024 at 12:39 UTC