A note on Solving Parametric Polynomial Systems
Symbolic Computation
2015-03-19 v1
Abstract
Lazard and Rouillier in [9], by introducing the concept of discriminant variety, have described a new and efficient algorithm for solving parametric polynomial systems. In this paper we modify this algorithm, and we show that with our improvements the output of our algorithm is always minimal and it does not need to compute the radical of ideals.
Keywords
Cite
@article{arxiv.1105.4682,
title = {A note on Solving Parametric Polynomial Systems},
author = {Asieh Pourhaghani},
journal= {arXiv preprint arXiv:1105.4682},
year = {2015}
}