InforLorV4, PascalFrancis, Corpus, bibRecord, 000897

Solving the Birkhoff Interpolation Problem via the critical point method : An experimental study

Identifieur interne : 000897 ( PascalFrancis/Corpus ); précédent : 000896; suivant : 000898

Solving the Birkhoff Interpolation Problem via the critical point method : An experimental study

Auteurs : Fabrice Rouillier ; MOHAB SAFEY EL DIN ; Uric Schost

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2001.

RBID : Pascal:02-0104455

Descripteurs français

Pascal (Inist)
- Internet, Géométrie algébrique, Géométrie algorithmique, Système équation, Réseau web, Point critique, Résolution problème.

English descriptors

KwdEn :
- Algebraic geometry, Computational geometry, Critical point, Equation system, Internet, Problem solving, World wide web.

Abstract

Following the work of Gonzalez-Vega, this paper is devoted to showing 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 system of polynomial 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 as an open problem. The solution is available at the U.R.L.: http://www-calfor.lip6.fr/^∼safey/applications.html.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2061`
A08	`01`	`1`	`ENG`	`@1 Solving the Birkhoff Interpolation Problem via the critical point method : An experimental study`
A09	`01`	`1`	`ENG`	`@1 ADG 2000 : automated deduction in geometry : Zurich, 25-27 September 2000, revised papers`
A11	`01`	`1`		`@1 ROUILLIER (Fabrice)`
A11	`02`	`1`		`@1 MOHAB SAFEY EL DIN`
A11	`03`	`1`		`@1 SCHOST (Uric)`
A12	`01`	`1`		`@1 RICHTER-GEBERT (Jürgen) @9 ed.`
A12	`02`	`1`		`@1 DONGMING WANG @9 ed.`
A14	`01`			`@1 LORIA, INRIA-Lorraine @2 Nancy @3 FRA @Z 1 aut.`
A14	`02`			`@1 CALFOR, LIP6, University Paris VI @2 Paris @3 FRA @Z 2 aut.`
A14	`03`			`@1 Laboratoire GAGE, École Polytechnique @2 Palaiseau @3 FRA @Z 3 aut.`
A20				`@1 26-40`
A21				`@1 2001`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-42598-5`
A43	`01`			`@1 INIST @2 16343 @5 354000097046450030`
A44				`@0 0000 @1 © 2002 INIST-CNRS. All rights reserved.`
A45				`@0 35 ref.`
A47	`01`	`1`		`@0 02-0104455`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
A66	`02`			`@0 USA`
C01	`01`		`ENG`	@0 Following the work of Gonzalez-Vega, this paper is devoted to showing 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 system of polynomial 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 as an open problem. The solution is available at the U.R.L.: http://www-calfor.lip6.fr/^∼safey/applications.html.
C02	`01`	`X`		`@0 001D02C05`
C02	`02`	`X`		`@0 001A02E05`
C03	`01`	`X`	`FRE`	`@0 Internet @5 01`
C03	`01`	`X`	`ENG`	`@0 Internet @5 01`
C03	`01`	`X`	`SPA`	`@0 Internet @5 01`
C03	`02`	`X`	`FRE`	`@0 Géométrie algébrique @5 02`
C03	`02`	`X`	`ENG`	`@0 Algebraic geometry @5 02`
C03	`02`	`X`	`SPA`	`@0 Geometría algebraica @5 02`
C03	`03`	`X`	`FRE`	`@0 Géométrie algorithmique @5 03`
C03	`03`	`X`	`ENG`	`@0 Computational geometry @5 03`
C03	`03`	`X`	`SPA`	`@0 Geometría computacional @5 03`
C03	`04`	`X`	`FRE`	`@0 Système équation @5 04`
C03	`04`	`X`	`ENG`	`@0 Equation system @5 04`
C03	`04`	`X`	`SPA`	`@0 Sistema ecuación @5 04`
C03	`05`	`X`	`FRE`	`@0 Réseau web @5 05`
C03	`05`	`X`	`ENG`	`@0 World wide web @5 05`
C03	`05`	`X`	`SPA`	`@0 Red WWW @5 05`
C03	`06`	`X`	`FRE`	`@0 Point critique @5 06`
C03	`06`	`X`	`ENG`	`@0 Critical point @5 06`
C03	`06`	`X`	`SPA`	`@0 Punto crítico @5 06`
C03	`07`	`X`	`FRE`	`@0 Résolution problème @5 07`
C03	`07`	`X`	`ENG`	`@0 Problem solving @5 07`
C03	`07`	`X`	`SPA`	`@0 Resolución problema @5 07`
N21				`@1 056`
N82				`@1 PSI`

A30	`01`	`1`	`ENG`	`@1 Automated deduction in geometry. International workshop @2 3 @3 Zurich CHE @4 2000-09-25`

Format Inist (serveur)

NO :	PASCAL 02-0104455 INIST
ET :	Solving the Birkhoff Interpolation Problem via the critical point method : An experimental study
AU :	ROUILLIER (Fabrice); MOHAB SAFEY EL DIN; SCHOST (Uric); RICHTER-GEBERT (Jürgen); DONGMING WANG
AF :	LORIA, INRIA-Lorraine/Nancy/France (1 aut.); CALFOR, LIP6, University Paris VI/Paris/France (2 aut.); Laboratoire GAGE, École Polytechnique/Palaiseau/France (3 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 2061; Pp. 26-40; Bibl. 35 ref.
LA :	Anglais
EA :	Following the work of Gonzalez-Vega, this paper is devoted to showing 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 system of polynomial 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 as an open problem. The solution is available at the U.R.L.: http://www-calfor.lip6.fr/^∼safey /applications.html.
CC :	001D02C05; 001A02E05
FD :	Internet; Géométrie algébrique; Géométrie algorithmique; Système équation; Réseau web; Point critique; Résolution problème
ED :	Internet; Algebraic geometry; Computational geometry; Equation system; World wide web; Critical point; Problem solving
SD :	Internet; Geometría algebraica; Geometría computacional; Sistema ecuación; Red WWW; Punto crítico; Resolución problema
LO :	INIST-16343.354000097046450030
ID :	02-0104455

Links to Exploration step

Pascal:02-0104455

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Solving the Birkhoff Interpolation Problem via the critical point method : An experimental study</title>
<author><name sortKey="Rouillier, Fabrice" sort="Rouillier, Fabrice" uniqKey="Rouillier F" first="Fabrice" last="Rouillier">Fabrice Rouillier</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, INRIA-Lorraine</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Mohab Safey El Din" sort="Mohab Safey El Din" uniqKey="Mohab Safey El Din" last="Mohab Safey El Din">MOHAB SAFEY EL DIN</name>
<affiliation><inist:fA14 i1="02"><s1>CALFOR, LIP6, University Paris VI</s1>
<s2>Paris</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Schost, Uric" sort="Schost, Uric" uniqKey="Schost U" first="Uric" last="Schost">Uric Schost</name>
<affiliation><inist:fA14 i1="03"><s1>Laboratoire GAGE, École Polytechnique</s1>
<s2>Palaiseau</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">02-0104455</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 02-0104455 INIST</idno>
<idno type="RBID">Pascal:02-0104455</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000897</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Solving the Birkhoff Interpolation Problem via the critical point method : An experimental study</title>
<author><name sortKey="Rouillier, Fabrice" sort="Rouillier, Fabrice" uniqKey="Rouillier F" first="Fabrice" last="Rouillier">Fabrice Rouillier</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, INRIA-Lorraine</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Mohab Safey El Din" sort="Mohab Safey El Din" uniqKey="Mohab Safey El Din" last="Mohab Safey El Din">MOHAB SAFEY EL DIN</name>
<affiliation><inist:fA14 i1="02"><s1>CALFOR, LIP6, University Paris VI</s1>
<s2>Paris</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Schost, Uric" sort="Schost, Uric" uniqKey="Schost U" first="Uric" last="Schost">Uric Schost</name>
<affiliation><inist:fA14 i1="03"><s1>Laboratoire GAGE, École Polytechnique</s1>
<s2>Palaiseau</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2001">2001</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algebraic geometry</term>
<term>Computational geometry</term>
<term>Critical point</term>
<term>Equation system</term>
<term>Internet</term>
<term>Problem solving</term>
<term>World wide web</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Internet</term>
<term>Géométrie algébrique</term>
<term>Géométrie algorithmique</term>
<term>Système équation</term>
<term>Réseau web</term>
<term>Point critique</term>
<term>Résolution problème</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Following the work of Gonzalez-Vega, this paper is devoted to showing 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 system of polynomial 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 as an open problem. The solution is available at the U.R.L.: http://www-calfor.lip6.fr/<sup>∼</sup>
safey/applications.html.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2061</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Solving the Birkhoff Interpolation Problem via the critical point method : An experimental study</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>ADG 2000 : automated deduction in geometry : Zurich, 25-27 September 2000, revised papers</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>ROUILLIER (Fabrice)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>MOHAB SAFEY EL DIN</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>SCHOST (Uric)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>RICHTER-GEBERT (Jürgen)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>DONGMING WANG</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA, INRIA-Lorraine</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>CALFOR, LIP6, University Paris VI</s1>
<s2>Paris</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>Laboratoire GAGE, École Polytechnique</s1>
<s2>Palaiseau</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>26-40</s1>
</fA20>
<fA21><s1>2001</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-42598-5</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000097046450030</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2002 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>35 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>02-0104455</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fA66 i1="02"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Following the work of Gonzalez-Vega, this paper is devoted to showing 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 system of polynomial 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 as an open problem. The solution is available at the U.R.L.: http://www-calfor.lip6.fr/<sup>∼</sup>
safey/applications.html.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C05</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001A02E05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Internet</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Internet</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Internet</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Géométrie algébrique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Algebraic geometry</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Geometría algebraica</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Géométrie algorithmique</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Computational geometry</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Geometría computacional</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Système équation</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Equation system</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Sistema ecuación</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Réseau web</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>World wide web</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Red WWW</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Point critique</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Critical point</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Punto crítico</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Résolution problème</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Problem solving</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Resolución problema</s0>
<s5>07</s5>
</fC03>
<fN21><s1>056</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Automated deduction in geometry. International workshop</s1>
<s2>3</s2>
<s3>Zurich CHE</s3>
<s4>2000-09-25</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 02-0104455 INIST</NO>
<ET>Solving the Birkhoff Interpolation Problem via the critical point method : An experimental study</ET>
<AU>ROUILLIER (Fabrice); MOHAB SAFEY EL DIN; SCHOST (Uric); RICHTER-GEBERT (Jürgen); DONGMING WANG</AU>
<AF>LORIA, INRIA-Lorraine/Nancy/France (1 aut.); CALFOR, LIP6, University Paris VI/Paris/France (2 aut.); Laboratoire GAGE, École Polytechnique/Palaiseau/France (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 2061; Pp. 26-40; Bibl. 35 ref.</SO>
<LA>Anglais</LA>
<EA>Following the work of Gonzalez-Vega, this paper is devoted to showing 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 system of polynomial 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 as an open problem. The solution is available at the U.R.L.: http://www-calfor.lip6.fr/<sup>∼</sup>
safey /applications.html.</EA>
<CC>001D02C05; 001A02E05</CC>
<FD>Internet; Géométrie algébrique; Géométrie algorithmique; Système équation; Réseau web; Point critique; Résolution problème</FD>
<ED>Internet; Algebraic geometry; Computational geometry; Equation system; World wide web; Critical point; Problem solving</ED>
<SD>Internet; Geometría algebraica; Geometría computacional; Sistema ecuación; Red WWW; Punto crítico; Resolución problema</SD>
<LO>INIST-16343.354000097046450030</LO>
<ID>02-0104455</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000897 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000897 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:02-0104455
   |texte=   Solving the Birkhoff Interpolation Problem via the critical point method : An experimental study
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Solving the Birkhoff Interpolation Problem via the critical point method : An experimental study

Solving the Birkhoff Interpolation Problem via the critical point method : An experimental study

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri