Division-free computation of subresultants using Bezout matrices

We present an algorithm to compute the subresultant sequence of two polynomials that completely avoids division in the ground domain, generalizing an algorithm given by Abdeljaoued et al. [J. Abdeljaoued, G. Diaz-Toca, and L. Gonzalez-Vega, Minors of Bezout matrices, subresultants and the parameteri...

Full description

Bibliographic Details

Published in:	International journal of computer mathematics Vol. 86; no. 12; pp. 2186 - 2200
Main Author:	Kerber, Michael
Format:	Journal Article
Language:	English
Published:	Abingdon Taylor & Francis 01.12.2009 Taylor & Francis Ltd
Subjects:	Algorithms Bezout matrix F.2.1 [Analysis of Algorithms and Problem Complexity]: Numerical Algorithms and Problems-Computations on Polynomials I.1.2 [Symbolic and Algebraic Manipulation]: Algorithms-Algebraic algorithms Mathematics Matrix polynomial gcd Polynomials subresultant
ISSN:	0020-7160, 1029-0265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!