Approximate GCD in a Bernstein basis
From MaRDI portal
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.
This page was built for publication: Approximate GCD in a Bernstein basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6326571)
