Approximate GCD a la dedieu

zbMATH1252.49047MaRDI QIDQ3164992FDOQ3164992

Authors

Publication date 25 October 2012

Full work available at URL http://www.emis.de/journals/AMEN/2011/2011.htm

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

approximate gcd problemNewton-Gauss-method

Mathematics Subject Classification ID

Newton-type methods (49M15) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Recommendations

• Certified approximate univariate GCDs
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Approximate GCD and its application to ill-conditioned algebraic equations
• GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
• scientific article; zbMATH DE number 953021

Cited in

(3)

• How to Remove the Exponent GCD in HK09
• A quadratically convergent algorithm for structured low-rank approximation
• A subdivision method for computing nearest gcd with certification

This page was built for publication: Approximate GCD a la dedieu

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