Recursive polynomial remainder sequence and the nested subresultants

Authors:
Akira Terui
Affiliations:
Graduate School of Pure and Applied Sciences, University of Tsukuba, Tsukuba, Japan
Venue:
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Year:
2005

Citing 8
Cited 0

The singular value decomposition for polynomial systems

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Subresultants and Reduced Polynomial Remainder Sequences

Journal of the ACM (JACM)
On Euclid's Algorithm and the Theory of Subresultants

Journal of the ACM (JACM)
New structure theorem for subresultants

Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices

Journal of Symbolic Computation
Subresultants revisited

Theoretical Computer Science - Latin American theoretical informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give two new expressions of subresultants, nested subresultant and reduced nested subresultant, for the recursive polynomial remainder sequence (PRS) which has been introduced by the author. The reduced nested subresultant reduces the size of the subresultant matrix drastically compared with the recursive subresultant proposed by the authors before, hence it is much more useful for investigation of the recursive PRS. Finally, we discuss usage of the reduced nested subresultant in approximate algebraic computation, which motivates the present work.