Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Wien
About this chapter
Cite this chapter
Wang, D. (2001). Zero decomposition of polynomial systems. In: Elimination Methods. Texts and Monographs in Symbolic Computation. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6202-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6202-6_2
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83241-7
Online ISBN: 978-3-7091-6202-6
eBook Packages: Springer Book Archive