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

zbMATH Open1190.65068MaRDI QIDQ5301675FDOQ5301675

Authors: Pramook Khungurn, Hiroshi Sekigawa, Kiyoshi Shirayanagi 

Publication date: 20 January 2009

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

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)