Skip to Main content Skip to Navigation

Solving the Birkhoff interpolation problem via the critical point method: an experimental study

Fabrice Rouillier 1, 2 Mohab Safey El Din 2, 1 Eric Schost 3
1 CALFOR - Calcul formel
LIP6 - Laboratoire d'Informatique de Paris 6
2 SPACES - Solving problems through algebraic computation and efficient software
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Following the work of Gonzalez-Vega, this paper is devoted to show how to use recent algorithmic tools of computational real algebraic geometry to solve the Birkhoff Interpolation Problem. We recall and partly improve two algorithms to find at least one point in each connected component of a real algebraic set defined by a single equation or a polynomial system of equations, both based on the computation of the critical points of a distance function. These algorithms are used to solve the Birkhoff Interpolation Problem in a case which was known to be an open problem.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00099276
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:52:21 AM
Last modification on : Thursday, March 5, 2020 - 6:33:36 PM

Links full text

Identifiers

Citation

Fabrice Rouillier, Mohab Safey El Din, Eric Schost. Solving the Birkhoff interpolation problem via the critical point method: an experimental study. Third International Workshop on Automated Deduction in Geometry - ADG'2000, Sep 2000, Zurich, Switzerland. pp.26-40, ⟨10.1007/3-540-45410-1_3⟩. ⟨inria-00099276⟩

Share

Metrics

Record views

308