An iterative method for calculating approximate GCD of univariate polynomials

DOI10.1145/1576702.1576750MaRDI QIDQ2883839zbMATH OpenOpenAlexFDO

Authors Akira Terui

Publication date 13 May 2012

Published in Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://tsukuba.repo.nii.ac.jp/?action=repository_action_common_download&item_id=18169&item_no=1&attribute_id=17&file_no=1

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65D99) Symbolic computation and algebraic computation (68W30)

Recommendations

• GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
• GPGCD, an iterative method for calculating approximate GCD of univariate polynomials, with the complex coefficients
• An algorithm for computing certified approximate GCD of n univariate polynomials
• Certified approximate univariate GCDs

Cited in

(13)

• An algorithm for computing certified approximate GCD of n univariate polynomials
• A subspace method for the computation of the GCD of polynomials
• Approximate polynomial GCD by approximate syzygies
• An improvement in the lattice construction process of approximate polynomial GCD over integers
• A quadratically convergent algorithm for structured low-rank approximation
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
• Approximate GCD of several univariate polynomials with small degree perturbations
• A heuristic verification of the degree of the approximate GCD of two univariate polynomials
• Approximate GCD by relaxed NewtonSLRA algorithm
• GPGCD, an iterative method for calculating approximate GCD of univariate polynomials, with the complex coefficients
• Computation of the GCD of polynomials using gaussian transformations and shifting
• A subdivision method for computing nearest gcd with certification

Describes a project that uses

Uses Software

• MultRoot

This page was built for publication: An iterative method for calculating approximate GCD of univariate polynomials

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