Abstract
This paper shows an algorithm for computing all the solutions with their multiplicities of a system of algebraic equations. The algorithm previously proposed by the authors for the case where the ideal is zero-dimensional and radical seems to have practical efficiency. We present a new method for solving systems which are not necessarily radical. The set of all solutions is partitioned into subsets each of which consists of mutually conjugate solutions having the same multiplicity.
Cite
CITATION STYLE
Kobayashi, H., Moritsugu, S., & Hogan, R. W. (1989). Solving systems of algebraic equations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 358 LNCS, pp. 139–149). Springer Verlag. https://doi.org/10.1007/3-540-51084-2_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
