Recursive polynomial remainder sequence and its subresultants

DOI10.1016/j.jalgebra.2007.12.023zbMath1173.13028arXiv0806.0495OpenAlexW1983880177MaRDI QIDQ947487

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

subresultantsGaussian eliminationSylvester's identitypolynomial remainder sequence

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05)

Related Items

Polynomial GCD derived through monic polynomial subtractions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Certified approximate univariate GCDs
• Subresultants revisited.
• New structure theorem for subresultants
• Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
• Optimizations of the subresultant algorithm
• Computer Algebra in Scientific Computing
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Theory of Subresultants