The Computation of Multiple Roots of a Bernstein Basis Polynomial
From MaRDI portal
Publication:5216781
DOI10.1137/18M1219904zbMath1431.65064MaRDI QIDQ5216781
Yi Su, Winkler, Joab R., Martin Bourne
Publication date: 20 February 2020
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
greatest common divisormultiple rootsSylvester resultant matrixBernstein basis polynomialsSylvester subresultant matrices
Numerical computation of roots of polynomial equations (65H04) Computational methods for problems pertaining to field theory (12-08)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- The computation of multiple roots of a polynomial
- The numerical factorization of polynomials
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- Computing roots of polynomials by quadratic clipping
- Curve intersection using Bézier clipping
- Bounds on a polynomial
- A rational cubic clipping method for computing real roots of a polynomial
- A companion matrix resultant for Bernstein polynomials
- Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
- Structured matrix methods for the computation of multiple roots of a polynomial
- On the stability of transformations between power and Bernstein polynomial forms
- A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
- Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
- Method for finding multiple roots of polynomials
- The numerical greatest common divisor of univariate polynomials
- Computing multiple roots of inexact polynomials
- Total Least Norm Formulation and Solution for Structured Problems
- Approximate GCD in Bernstein basis
- High Order Terms for Condition Estimation of Univariate Polynomials
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
This page was built for publication: The Computation of Multiple Roots of a Bernstein Basis Polynomial
