Abstract
In this paper we study a special kind of Hankel matrices with entries in an unique factorization domain (U.F.D.). It is used to construct an algorithm to determine the resultant and the greatest common divisor (G.C.D.) of multivariate polynomials.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Buchberger B., Collins G.E. and Loos R. (eds), "Computer Algebra: Symbolic and Algebraic Computation", Springer-Verlag, Viena (1983).
Fiedler M. "Special Matrices and their applications in numerical mathematics". Kluner Academic Publishers (1986).
Gantmacher F.R. "Theory of Matrices", Chelsea New York (1960).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Llovet, J., Sendra, J.R. (1989). Hankel matrices and polynomials. In: Huguet, L., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1987. Lecture Notes in Computer Science, vol 356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51082-6_88
Download citation
DOI: https://doi.org/10.1007/3-540-51082-6_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51082-6
Online ISBN: 978-3-540-46150-0
eBook Packages: Springer Book Archive