A simple proof of the validity of the reduced prs algorithm

DOI10.1007/BF02278715MaRDI QIDQ1099223zbMATH OpenFDO

Authors B. George

Publication date 1987

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

univariate polynomialsreduced polynomial remainder sequence algorithm

Mathematics Subject Classification ID

Polynomials over commutative rings (13B25) Numerical computation of solutions to single equations (65H05)

Recommendations

• scientific article; zbMATH DE number 3922806
• Theory of multiple polynomial remainder sequence
• Recursive polynomial remainder sequence and its subresultants
• scientific article; zbMATH DE number 1512700
• A new method for computing polynomial greatest common divisors and polynomial remainder sequences

Cites work

• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Subresultants and Reduced Polynomial Remainder Sequences

Cited in

(2)

• A new method for computing polynomial greatest common divisors and polynomial remainder sequences
• scientific article; zbMATH DE number 1512700 (Why is no real title available?)

This page was built for publication: A simple proof of the validity of the reduced prs algorithm

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