Minimum converging precision of the QR-factorization algorithm for real polynomial GCD

MaRDI QIDQ5301675zbMATH OpenFDO

Authors Pramook Khungurn, Hiroshi Sekigawa, Kiyoshi Shirayanagi

Publication date 20 January 2009

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Quasi-gcd computations
• Extended QRGCD algorithm
• scientific article; zbMATH DE number 953021
• Certified approximate univariate GCDs
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients

Cited in

(1)

• A new Gröbner basis conversion method based on stabilization techniques

This page was built for publication: Minimum converging precision of the QR-factorization algorithm for real polynomial GCD

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