Solving polynomial equations: Characteristic sets and triangular systems

Dongming Wang

Mathematics and Computers in Simulation (MATCOM), 1996, vol. 42, issue 4, 339-351

Abstract: 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.

Keywords: Characteristic set; Polynomial system; Triangular system; Zero decomposition (search for similar items in EconPapers)
Date: 1996
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475496000080
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:42:y:1996:i:4:p:339-351

DOI: 10.1016/S0378-4754(96)00008-0

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().