On the Bézout construction of the resultant

20Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper deals with some ideas of Bézout and his successors Poisson, Netto and Laurent for solving polynomial systems. We treat them from the determinantal and from the Gröbner basis point of view. This results in effective algorithms for constructing the multivariate resultant. Other problems of Elimination Theory are discussed: how to find an eliminant for a polynomial system, how to represent its zeroes as the rational functions of the roots of this eliminant and how to separate zeroes. © 1999 Academic Press.

Cite

CITATION STYLE

APA

Bikker, P., & Uteshev, A. Y. (1999). On the Bézout construction of the resultant. Journal of Symbolic Computation, 28(1–2), 45–88. https://doi.org/10.1006/jsco.1999.0267

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free