An iterative method for calculating approximate GCD of univariate polynomials
From MaRDI portal
Publication:2883839
DOI10.1145/1576702.1576750zbMath1237.65024OpenAlexW2033539266MaRDI QIDQ2883839
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
Symbolic computation and algebraic computation (68W30) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Related Items (5)
A quadratically convergent algorithm for structured low-rank approximation ⋮ GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ A subdivision method for computing nearest gcd with certification ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials
Uses Software
This page was built for publication: An iterative method for calculating approximate GCD of univariate polynomials
