Approximate GCD in a Bernstein basis
Numerical Analysis
2019-10-07 v1 Numerical Analysis
Symbolic Computation
Abstract
We adapt Victor Y. Pan's root-based algorithm for finding approximate GCD to the case where the polynomials are expressed in Bernstein bases. We use the numerically stable companion pencil of Gudbj\"orn F. J\'onsson to compute the roots, and the Hopcroft-Karp bipartite matching method to find the degree of the approximate GCD. We offer some refinements to improve the process.
Cite
@article{arxiv.1910.01998,
title = {Approximate GCD in a Bernstein basis},
author = {Robert M. Corless and Leili Rafiee Sevyeri},
journal= {arXiv preprint arXiv:1910.01998},
year = {2019}
}