Specifications for triangulation algorithms of elementary-algebraic systems;Spécifications des algorithmes de triangulation de systèmes algébro-élémentaires

Comptes Rendus Mathematique

Volumn 334, Issue 2, 2002, Pages 155-159

  Bellido, Anne Mercedes ^a   Jalby, Vincent ^a  

^a UNIVERSITY OF LIMOGES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038392359     PISSN: 1631073X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1631-073X(02)02219-7     Document Type: Article

References (9)

1. Aubry P., Lazard D., Moreno Maza M., On the theory of triangular sets, J. Symbolic Comput. 28 (1999) 105-124.
2. Aubry P., Moreno Maza M., Triangular sets for solving polynomial systems; a comparative implementation of four methods, J. Symbolic Comput. 28 (1999) 125-154.
3. Bareiss E.H., Sylvester's identity and multistep integer preserving Gaussian elimination, Math. Comp. 22 (1968) 565-578.
4. Dellière S., On the link between triangular set and dynamic constructible closure, J. Pure Appl. Algebra 163 (2001) 49-68.
5. Duval D., Gómez-Díaz T., A lazy method for triangularizing polynomial systems, Publications du LACO 4 (1995).
6. Gabrielov A., Vorobjov N., Complexity of stratifications of semi-Pfaffian sets, Discrete Comput. Geom. 14 (1995) 71-91.
7. Losajiewicz S., Triangulation of semi-analytic sets, Ann. Scuola Norm. Sup. Pisa 18 (1964) 449-474.
8. n, J. Symbolic Comput. 28 (1999) 213-223.
9. Wang D., Decomposing polynomial systems into simple systems, J. Symbolic Comput. 16 (1998) 83-114.