Properness defects of projections and computation of one point in each connected component of a real algebraic set
Identifieur interne : 003611 ( Crin/Curation ); précédent : 003610; suivant : 003612Properness defects of projections and computation of one point in each connected component of a real algebraic set
Auteurs : Mohab Safey El Din ; Eric SchostSource :
English descriptors
- KwdEn :
Abstract
Computing at least one point in each connected component of a real algebraic set is a basic subroutine to decide emptiness of semi-algbraic sets, which is a fundamental algorithmic problem in effective real algebraic geometry. In this article, we propose a new algorithm for this task, which avoids a hypothesis of properness required in many of the previous methods. We show how studying the set of non-properness of a linear projection enables to detect connected components of a real algebraic set without critical points. Our algorithm is based on this result and its practical counterpoint, using the triangular representation of algebraic varieties. Our experiments show its efficiency on a family of examples.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :003611
Links to Exploration step
CRIN:safey_el_din02aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="619">Properness defects of projections and computation of one point in each connected component of a real algebraic set</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:safey_el_din02a</idno>
<date when="2002" year="2002">2002</date>
<idno type="wicri:Area/Crin/Corpus">003611</idno>
<idno type="wicri:Area/Crin/Curation">003611</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003611</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Properness defects of projections and computation of one point in each connected component of a real algebraic set</title>
<author><name sortKey="Safey El Din, Mohab" sort="Safey El Din, Mohab" uniqKey="Safey El Din M" first="Mohab" last="Safey El Din">Mohab Safey El Din</name>
</author>
<author><name sortKey="Schost, Eric" sort="Schost, Eric" uniqKey="Schost E" first="Eric" last="Schost">Eric Schost</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>polynomial systems</term>
<term>real solutions</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="2379">Computing at least one point in each connected component of a real algebraic set is a basic subroutine to decide emptiness of semi-algbraic sets, which is a fundamental algorithmic problem in effective real algebraic geometry. In this article, we propose a new algorithm for this task, which avoids a hypothesis of properness required in many of the previous methods. We show how studying the set of non-properness of a linear projection enables to detect connected components of a real algebraic set without critical points. Our algorithm is based on this result and its practical counterpoint, using the triangular representation of algebraic varieties. Our experiments show its efficiency on a family of examples.</div>
</front>
</TEI>
<BibTex type="techreport"><ref>safey_el_din02a</ref>
<crinnumber>A02-R-465</crinnumber>
<category>15</category>
<equipe>SPACES</equipe>
<author><e>Safey El Din, Mohab</e>
<e>Schost, Eric</e>
</author>
<title>Properness defects of projections and computation of one point in each connected component of a real algebraic set</title>
<institution>INRIA</institution>
<year>2002</year>
<type>Rapport de recherche</type>
<month>Oct</month>
<url>http://www.loria.fr/publications/2002/A02-R-465/A02-R-465.ps</url>
<keywords><e>polynomial systems</e>
<e>real solutions</e>
</keywords>
<abstract>Computing at least one point in each connected component of a real algebraic set is a basic subroutine to decide emptiness of semi-algbraic sets, which is a fundamental algorithmic problem in effective real algebraic geometry. In this article, we propose a new algorithm for this task, which avoids a hypothesis of properness required in many of the previous methods. We show how studying the set of non-properness of a linear projection enables to detect connected components of a real algebraic set without critical points. Our algorithm is based on this result and its practical counterpoint, using the triangular representation of algebraic varieties. Our experiments show its efficiency on a family of examples.</abstract>
</BibTex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003611 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 003611 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Crin |étape= Curation |type= RBID |clé= CRIN:safey_el_din02a |texte= Properness defects of projections and computation of one point in each connected component of a real algebraic set }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |