Efficient Computations of Irredundant Triangular Decompositions with the RegularChains Library

Authors:
Changbo Chen;François Lemaire;Marc Moreno Maza;Wei Pan;Yuzhen Xie
Affiliations:
University of Western Ontario, London N6A 1M8, Canada;Université de Lille 1, 59655 Villeneuve d'Ascq Cedex, France;University of Western Ontario, London N6A 1M8, Canada;University of Western Ontario, London N6A 1M8, Canada;University of Western Ontario, London N6A 1M8, Canada
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
Year:
2007

Citing 6
Cited 2

A new method for solving algebraic systems of positive dimension

Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
On the theories of triangular sets

Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Triangular sets for solving polynomial systems: a comparative implementation of four methods

Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components

SIAM Journal on Numerical Analysis
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers

Journal of Complexity
Sharp estimates for triangular sets

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation

Parallel computation of the minimal elements of a poset

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
When does equal sat(T)?

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present new functionalities that we have added to the RegularChainslibrary in Mapleto efficiently compute irredundant triangular decompositions. We report on the implementation of different strategies. Our experiments show that, for difficult input systems, the computing time for removing redundant components can be reduced to a small portion of the total time needed for solving these systems.