2000 character limit reached
Approximate GCD in a Bernstein basis
Published 4 Oct 2019 in math.NA, cs.NA, and cs.SC | (1910.01998v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.