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.
Type de document :
Communication dans un congrès
Third International Workshop on Automated Deduction in Geometry - ADG'2000, Sep 2000, Zurich, Switzerland. Springer, 2061, pp.26-40, 2000, Lecture Notes in Computer Science. 〈10.1007/3-540-45410-1_3〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00099276
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:52:21
Dernière modification le : jeudi 11 janvier 2018 - 06:27:20

Identifiants

Collections

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. Springer, 2061, pp.26-40, 2000, Lecture Notes in Computer Science. 〈10.1007/3-540-45410-1_3〉. 〈inria-00099276〉

Partager

Métriques

Consultations de la notice

186