Approximate polynomial GCD over integers

DOI10.1016/J.JSC.2011.08.011zbMath1248.11104OpenAlexW1992550888MaRDI QIDQ651873

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

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

Related Items (2)

Toward the best algorithm for approximate GCD of univariate polynomials ⋮ On the greatest common divisor of shifted sets

Uses Software

• Unnamed Item

Cites Work

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

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