An extended polynomial GCD algorithm using Hankel matrices

DOI10.1016/0747-7171(92)90003-MzbMath0771.15005MaRDI QIDQ1186699

Juan Llovet, Juan Rafael Sendra

Publication date: 28 June 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

greatest common divisorHankel matrixextended polynomial GCD algorithmpolynomial Hankel sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Hermitian, skew-Hermitian, and related matrices (15B57) Matrices over function rings in one or more variables (15A54)

Related Items (4)

A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials ⋮ Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation ⋮ On the complexity of computing the greatest common divisor of several univariate polynomials ⋮ Rank of a Hankel matrix over \({\mathbb{Z}{}} [x_ 1,{\cdots{}},x_ r\)]

Cites Work

• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An extended polynomial GCD algorithm using Hankel matrices