sign in
english version rss feed

inria-00503017, version 2

A formal study of Bernstein coefficients and polynomials

Yves Bertot (Author to contact preferably) 12, Frédérique Guilhot (Author to contact preferably) 1, Assia Mahboubi () 234

Mathematical Structures in Computer Science 21, 04 (2011) 731-761

Abstract: Bernstein coefficients provide a discrete approximation of the behavior of a polynomial inside an interval. This can be used for example to isolate real roots of polynomials. We prove a criterion for the existence of a single root in an interval and the correctness of the de Casteljau algorithm to compute efficiently Bernstein coefficients.

 
  • inria-00503017, version 2
  • oai:hal.inria.fr:inria-00503017
  • From: 
  • Submitted on: Wednesday, 22 September 2010 12:27:26
  • Updated on: Saturday, 2 July 2011 15:10:35
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...