Solving polynomial equations: Characteristic sets and triangular systems
We review, compare and experiment with two methods for solving systems of polynomial equations. One of the methods is developed by Wu based on Ritt's concept of characteristic sets, and the other is proposed by the author in extending the idea of Seidenberg's elimination theory. We present the two methods in parallel and explain how a system of polynomial equations can be solved by computing the medial set, characteristic set, characteristic (irreducible) series, principal triangular system and (irreducible) triangular series of the corresponding polynomial system. Experimental data on 50 examples are provided which demonstrate the applicability and efficiency of the methods.
Year of publication: |
1996
|
---|---|
Authors: | Wang, Dongming |
Published in: |
Mathematics and Computers in Simulation (MATCOM). - Elsevier, ISSN 0378-4754. - Vol. 42.1996, 4, p. 339-351
|
Publisher: |
Elsevier |
Subject: | Characteristic set | Polynomial system | Triangular system | Zero decomposition |
Saved in:
Saved in favorites
Similar items by subject
-
Comparing acceleration techniques for the Dixon and Macaulay resultants
Lewis, Robert H., (2010)
-
Heuristics to accelerate the Dixon resultant
Lewis, Robert H., (2008)
-
Conic tangency equations and Apollonius problems in biochemistry and pharmacology
Lewis, Robert H., (2003)
- More ...
Similar items by person