Approximate polynomial GCD over integers

DOI10.1016/J.JSC.2011.08.011MaRDI QIDQ651873zbMATH OpenOpenAlexFDO

Authors Kosaku Nagasaka

Publication date 19 December 2011

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2011.08.011

zbMATH Keywords

approximate polynomial GCDnumerical polynomial GCD

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Number-theoretic algorithms; complexity (11Y16) Numerical approximation and computational geometry (primarily algorithms) (65D99) Randomized algorithms (68W20)

Recommendations

• scientific article; zbMATH DE number 953021
• Toward the best algorithm for approximate GCD of univariate polynomials
• Certified approximate univariate GCDs
• On approximate GCDs of univariate polynomials
• An algorithm for computing certified approximate GCD of n univariate polynomials

Cites work

• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
• A Rank-Revealing Method with Updating, Downdating, and Applications
• An algorithm for computing certified approximate GCD of n univariate polynomials
• An Inequality About Factors of Polynomials
• Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor
• Approximate factorization of multivariate polynomials via differential equations
• Approximate GCD of multivariate polynomials
• Approximate GCD of multivariate polynomials
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• Approximate polynomial GCD: small degree and small height perturbations
• Approximate Polynomial gcd: Small Degree and Small Height Perturbations
• Certified approximate univariate GCDs
• Computation of approximate polynomial GCDs and an extension
• Computation of the GCD of polynomials using gaussian transformations and shifting
• Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
• DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
• Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method
• Factoring polynomials with rational coefficients
• Heuristics on lattice basis reduction in practice
• scientific article; zbMATH DE number 3756571 (Why is no real title available?)
• scientific article; zbMATH DE number 40793 (Why is no real title available?)
• scientific article; zbMATH DE number 62668 (Why is no real title available?)
• scientific article; zbMATH DE number 1303542 (Why is no real title available?)
• scientific article; zbMATH DE number 1346524 (Why is no real title available?)
• scientific article; zbMATH DE number 1113848 (Why is no real title available?)
• scientific article; zbMATH DE number 953021 (Why is no real title available?)
• scientific article; zbMATH DE number 1852136 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• On approximate GCDs of univariate polynomials
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
• Quasi-gcd computations
• The approximate GCD of inexact polynomials

Cited in

(5)

• Toward the best algorithm for approximate GCD of univariate polynomials
• On the greatest common divisor of shifted sets
• Approximate GCD of multivariate polynomials
• An improvement in the lattice construction process of approximate polynomial GCD over integers
• Polynomial GCD derived through monic polynomial subtractions

Describes a project that uses

Uses Software

• MultRoot

This page was built for publication: Approximate polynomial GCD over integers

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