next up previous contents index Next: Finding bounds on the Up: Analyzing univariate polynomials Previous: Analyzing univariate polynomials

  • La page de J-P. Merlet
  • J-P. Merlet home page
  • La page Présentation de COPRIN
  • COPRIN home page
  • La page "Présentation" de l'INRIA
  • INRIA home page

    Introduction

    In this chapter we intend to determine some information on the roots of an univariate polynomial without solving it. A polynomial is defined by the list of its coefficient ordered along increasing power in a data structure of type VECTOR. For most of the procedures defined in the sequel the coefficients may also intervals, in which case the data structure is of type INTERVAL_VECTOR (this type of polynomial will be called interval polynomial).

    next up previous contents index Next: Finding bounds on the Up: Analyzing univariate polynomials Previous: Analyzing univariate polynomials
  • La page de J-P. Merlet
  • J-P. Merlet home page
  • La page Présentation de COPRIN
  • COPRIN home page
  • La page "Présentation" de l'INRIA
  • INRIA home page

    Jean-Pierre Merlet