Abstract
Several computational and structural properties of Bezoutian matrices expressed with respect to the Bernstein polynomial basis are shown. The exploitation of such properties allows the design of fast algorithms for the solution of Bernstein–Bezoutian linear systems without never making use of potentially ill-conditioned reductions to the monomial basis. In particular, we devise an algorithm for the computation of the greatest common divisor (GCD) of two polynomials in Bernstein form. A series of numerical tests are reported and discussed, which indicate that Bernstein–Bezoutian matrices are much less sensitive to perturbations of the coefficients of the input polynomials compared to other commonly used resultant matrices generated after having performed the explicit conversion between the Bernstein and the power basis.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
