Linear algebraic approach for computing polynomial resultant
This paper presents a linear algebraic method for computing the re sultant of two polynomials. This method is based on the computation of a determinant of order equal to the minimum of the degrees of the two giv en polynomials. This method turns out to be preferable to other known linear algebraic methods both from a computational point of view and for a total generality respect to the class of the given polynomials. Some relationships of this method with the polynomial pseudo-remainder operation are also discussed.
Unable to display preview. Download preview PDF.
- M. BOCHER, Introduction to higher algebra. The MacMillan C., New York (1907).Google Scholar
- S.Y. KU, R.J. ADLER, Computing polynomial resultants. CACM, 12, 1 (Jan 1969), 23–30.Google Scholar
- G.E. COLLINS, Subresultant and reduced polynomial remainder sequence. J. ACM Vol. 14, n. 1, (Jan 1967).Google Scholar
- R.E. KALMAN, Some computational problems and methods related to invariant factors and control theory. Computational problems in abstract algebra, Ed. J. Leech, Pergamon, London (1970).Google Scholar
- S. BARNETT, Matrices in control theory. Van Nostrand Reinhold C., London (1971).Google Scholar
- J.V. USPENSKY, Theory of equations. New York, Toronto, London, Mc. Graw-Hill Book Company, Inc., 1948.Google Scholar
- D.E. KNUTH, The art of computer programming. Vol. 2: "Seminumerical algorithms", Addison Wesley, Reading, Mass., 1969.Google Scholar