AI Chat AI Image Generator AI Video Text to Speech

Approximate GCD in a Bernstein basis

10/04/2019

∙

by Robert M. Corless, et al.

∙

∙

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örn F. Jónsson 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.

Robert M. Corless
12 publications
Leili Rafiee Sevyeri
4 publications

page 1

page 2

page 3

page 4

research

∙ 12/12/2019

Evaluation of Chebyshev polynomials on intervals and application to root finding

In approximation theory, it is standard to approximate functions by poly...

0 Viviane Ledoux, et al. ∙

research

∙ 06/17/2022

Accelerated Subdivision for Clustering Roots of Polynomials given by Evaluation Oracles

In our quest for the design, the analysis and the implementation of a su...

0 Rémi Imbach, et al. ∙

research

∙ 03/25/2021

Approximate GCD in Lagrange bases

For a pair of polynomials with real or complex coefficients, given in an...

0 Leili Rafiee Sevyeri, et al. ∙

research

∙ 02/05/2021

Stable numerical evaluation of multi-degree B-splines

Multi-degree splines are piecewise polynomial functions having sections ...

0 Carolina Vittoria Beccari, et al. ∙

research

∙ 10/28/2021

On computing root polynomials and minimal bases of matrix pencils

We revisit the notion of root polynomials, thoroughly studied in [F. Dop...

0 Vanni Noferini, et al. ∙

research

∙ 06/02/2022

An extended range of stable flux reconstruction schemes on quadrilaterals for various polynomial bases

An extended range of energy stable flux reconstruction schemes, develope...

0 Will Trojak, et al. ∙

research

∙ 03/22/2022

An Algorithm for Solving Solvable Polynomial Equations of Arbitrary Degree by Radicals

This work provides a method(an algorithm) for solving the solvable unary...

0 Song Li, et al. ∙