Recursive polynomial remainder sequence and its subresultants

DOI10.1016/J.JALGEBRA.2007.12.023MaRDI QIDQ947487zbMATH OpenOpenAlexFDO

Authors Akira Terui

Publication date 6 October 2008

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0806.0495

zbMATH Keywords

Gaussian eliminationSylvester's identitysubresultantspolynomial remainder sequence

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05)

Abstract: We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," along with investigation of their properties. A recursive PRS is defined as, if there exists the GCD (greatest common divisor) of initial polynomials, a sequence of PRSs calculated "recursively" for the GCD and its derivative until a constant is derived, and recursive subresultants are defined by determinants representing the coefficients in recursive PRS as functions of coefficients of initial polynomials. We give three different constructions of subresultant matrices for recursive subresultants; while the first one is built-up just with previously defined matrices thus the size of the matrix increases fast as the recursion deepens, the last one reduces the size of the matrix drastically by the Gaussian elimination on the second one which has a "nested" expression, i.e. a Sylvester matrix whose elements are themselves determinants.

Recommendations

• Computer Algebra in Scientific Computing
• Recursive sequences and polynomial congruences
• scientific article; zbMATH DE number 2070404
• Polynomially recursive sequences
• Polynomial recurrences and cyclic resultants
• On recurrence sequences with polynomial coefficients
• Polynomial Remainder Sequences and Determinants
• Publication:3480123
• On polynomial-modular recursive sequences
• On a binary recurrent sequence of polynomials

Cites work

• scientific article; zbMATH DE number 3922806 (Why is no real title available?)
• scientific article; zbMATH DE number 4029737 (Why is no real title available?)
• scientific article; zbMATH DE number 1254251 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
• Certified approximate univariate GCDs
• Computer Algebra in Scientific Computing
• New structure theorem for subresultants
• On Euclid's Algorithm and the Theory of Subresultants
• Optimizations of the subresultant algorithm
• Subresultants and Reduced Polynomial Remainder Sequences
• Subresultants revisited.

Cited in

(11)

• scientific article; zbMATH DE number 6868541 (Why is no real title available?)
• Theory of multiple polynomial remainder sequence
• Two Variants of Bézout Subresultants for Several Univariate Polynomials
• Polynomial GCD derived through monic polynomial subtractions
• Subresultants of several univariate polynomials in Newton basis
• scientific article; zbMATH DE number 1512700 (Why is no real title available?)
• Computer Algebra in Scientific Computing
• A simple proof of the validity of the reduced prs algorithm
• scientific article; zbMATH DE number 3913669 (Why is no real title available?)
• Primitive polynomial remainder sequences in elimination theory
• scientific article; zbMATH DE number 3855236 (Why is no real title available?)

This page was built for publication: Recursive polynomial remainder sequence and its subresultants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947487)