Specifications for triangulation algorithms of elementary-algebraic systems

DOI10.1016/S1631-073X(02)02219-7zbMath1017.65048MaRDI QIDQ1598480

Vincent Jalby, Anne-Mercedes Bellido

Publication date: 4 August 2002

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

zbMATH Keywords

polynomial systemstriangulation algorithmstriangular elementary-algebraic systems

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10)

Cites Work

• Unnamed Item
• An elimination method for polynomial systems
• On the theories of triangular sets
• Triangular sets for solving polynomial systems: a comparative implementation of four methods
• Weak Wu stratification in \(\mathbb{R}^n\)
• Complexity of stratifications of semi-Pfaffian sets
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• On the links between triangular sets and dynamic constructible closure

This page was built for publication: Specifications for triangulation algorithms of elementary-algebraic systems