Zero decomposition of polynomial systems

  • Dongming Wang
Part of the Texts and Monographs in Symbolic Computation book series (TEXTSMONOGR)


From now on we come to describe elimination algorithms that decompose arbitrary systems of multivariate polynomials into special systems of triangular form - the theme of this book. Meanwhile, various zero relations between the given and the constructed systems will be established. In this chapter three kinds of different yet related algorithms are presented which compute such decompositions of relatively coarse form.


Minimal Degree Decomposition Algorithm Polynomial System Decomposition Tree Triangular System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Wien 2001

Authors and Affiliations

  • Dongming Wang
    • 1
  1. 1.Laboratoire d’Informatique de Paris 6Universiré Pierre et Marie CurieParisFrance

Personalised recommendations