A note on resultants
The authors present an algorithm for the determination of the number of common roots of a finite set of polynomials in one indeterminate with the coefficients in a field. The algorithm described is based on Sylvester's resultants of two polynomials in one indeterminate and on Kronecker's elimination. As an application a device is derived that establishes the multiplicities of the roots of a given polynomial. The cases of the cubics and of the quartics are explicitly discussed. The authors compare their algorithm with a result of \textit{S. Barnett} [Linear Multilinear Algebra 8, 271-279 (1980; Zbl 0438.12012)].
- The number of roots of a lacunary bivariate polynomial on a line
- Number of common roots and resultant of two tropical univariate polynomials
- An Ingrained Error Concerning Resultants
- Resultants and loop closure
- scientific article; zbMATH DE number 4027602 (Why is no real title available?)
- scientific article; zbMATH DE number 16644 (Why is no real title available?)
- scientific article; zbMATH DE number 480305 (Why is no real title available?)
- Some results on counting roots of polynomials and the Sylvester resultant
This page was built for publication: A note on resultants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094456)