Subresultants in Recursive Polynomial Remainder Sequence
From MaRDI portal
Publication:6209770
arXiv0806.0478MaRDI QIDQ6209770FDOQ6209770
Authors: Akira Terui 
Publication date: 3 June 2008
Abstract: We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," and investigate their properties. In calculating PRS, if there exists the GCD (greatest common divisor) of initial polynomials, we calculate "recursively" with new PRS for the GCD and its derivative, until a constant is derived. We call such a PRS a recursive PRS. We define recursive subresultants to be determinants representing the coefficients in recursive PRS by coefficients of initial polynomials. Finally, we discuss usage of recursive subresultants in approximate algebraic computation, which motivates the present work.
Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13P99)
This page was built for publication: Subresultants in Recursive Polynomial Remainder Sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6209770)
