Computing Nearest Gcd with Certification
Abstract
A bisection method, based on exclusion and inclusion tests, is used to address the nearest univariate gcd problem formulated as a bivariate real minimization problem of a rational fraction. The paper presents an algorithm, a first implementation and a complexity analysis relying on Smale's $\alpha$-theory. We report its behavior on an illustrative example.
Domains
Symbolic Computation [cs.SC]
Origin : Files produced by the author(s)
Loading...