arXiv · 0806.0478
Subresultants in Recursive Polynomial Remainder Sequence
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.
Explore related subjects
Keep this discovery
Akira Terui. 2008-06-03. Subresultants in Recursive Polynomial Remainder Sequence. https://arxiv.org/abs/0806.0478
Cite the original work for its findings. Save a collection to share your selection of sources.