Computing multivariate approximate GCD based on Barnett's theorem

DOI10.1145/1577190.1577214zbMath1356.11095OpenAlexW2027858666MaRDI QIDQ2959028

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

lifting techniqueBézout matrixapproximate GDCillconditioned problem

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

Approximate polynomial GCD by approximate syzygies

Uses Software

• Maple

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