On the links between triangular sets and dynamic constructible closure

DOI10.1016/S0022-4049(00)00136-5zbMath0992.68244MaRDI QIDQ5946465

Stéphane Dellière

Publication date: 14 October 2001

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

zbMATH Keywords

constructible triangular systemsLazard's triangular setsnormalized triangular polynomial systems

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects in algebraic geometry (14Q99)

Related Items (4)

Lifting and recombination techniques for absolute factorization ⋮ Directed evaluation ⋮ Decomposition of polynomial sets into characteristic pairs ⋮ Specifications for triangulation algorithms of elementary-algebraic systems

Uses Software

• AXIOM
• ALDOR

Cites Work

• A new method for solving algebraic systems of positive dimension
• Decomposing polynomial systems into simple systems
• Examples of using dynamic constructible closure.
• On the theories of triangular sets
• Triangular sets for solving polynomial systems: a comparative implementation of four methods
• Associative differential operations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the links between triangular sets and dynamic constructible closure