Extended QRGCD algorithm

DOI10.1007/978-3-319-02297-0_22MaRDI QIDQ5168480zbMATH OpenOpenAlexFDO

Authors Kosaku Nagasaka, Takaaki Masui

Publication date 7 July 2014

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02297-0_22

Mathematics Subject Classification ID

Solving polynomial systems; resultants (13P15) Numerical approximation and computational geometry (primarily algorithms) (65D99) Symbolic computation and algebraic computation (68W30)

Recommendations

• Toward the best algorithm for approximate GCD of univariate polynomials
• GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
• scientific article; zbMATH DE number 953021
• Certified approximate univariate GCDs
• Quasi-gcd computations

Cited in

(6)

• Quasi-gcd computations
• Toward the best algorithm for approximate GCD of univariate polynomials
• Improving a CGS-QE Algorithm
• Minimum converging precision of the QR-factorization algorithm for real polynomial GCD
• SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
• Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Extended QRGCD algorithm

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