Sturm's Theorem with Endpoints

08/16/2022
by   Philippe Pébay, et al.
0

Sturm's Theorem is a fundamental 19th century result relating the number of real roots of a polynomial f in an interval to the number of sign alternations in a sequence of polynomial division-like calculations. We provide a short direct proof of Sturm's Theorem, including the numerically vexing case (ignored in many published accounts) where an interval endpoint is a root of f.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/27/2018

Counting Polynomial Roots in Isabelle/HOL: A Formal Proof of the Budan-Fourier Theorem

Many problems in computer algebra and numerical analysis can be reduced ...
research
02/28/2023

A short proof for the parameter continuation theorem

The Parameter Continuation Theorem is the theoretical foundation for pol...
research
10/07/2021

On the possibility of fast stable approximation of analytic functions from equispaced samples via polynomial frames

We consider approximating analytic functions on the interval [-1,1] from...
research
12/09/2021

A solution to Ringel's circle problem

We construct families of circles in the plane such that their tangency g...
research
10/10/2019

Implementing evaluation strategies for continuous real functions

We give a technical overview of our exact-real implementation of various...
research
04/30/2019

Case Study of the Proof of Cook's theorem - Interpretation of A(w)

Cook's theorem is commonly expressed such as any polynomial time-verifia...
research
08/01/2017

Digit Serial Methods with Applications to Division and Square Root (with mechanically checked correctness proofs)

We present a generic digit serial method (DSM) to compute the digits of ...

Please sign up or login with your details

Forgot password? Click here to reset