Computing multivariate approximate GCD based on Barnett's theorem

DOI10.1145/1577190.1577214MaRDI QIDQ2959028zbMATH OpenOpenAlexFDO

Authors Masaru Sanuki

Publication date 3 February 2017

Published in Proceedings of the 2009 conference on Symbolic numeric computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1577190.1577214

zbMATH Keywords

approximate GDCBézout matrixillconditioned problemlifting technique

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16)

Recommendations

• The approximate GCD of inexact polynomials
• Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
• Certified approximate univariate GCDs
• Approximate GCD of multivariate polynomials
• An algorithm for computing certified approximate GCD of n univariate polynomials

Cited in

(2)

• Approximate polynomial GCD by approximate syzygies
• Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Computing multivariate approximate GCD based on Barnett's theorem

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