The computation of multiple roots of a Bernstein basis polynomial
From MaRDI portal
Recommendations
- The computation of multiple roots of a polynomial
- scientific article; zbMATH DE number 2151210
- Structured matrix methods for the computation of multiple roots of a polynomial
- Computing multiple roots of inexact polynomials
- A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis
Cites work
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- A companion matrix resultant for Bernstein polynomials
- A fast algorithm for approximate polynomial gcd based on structured matrix computations
- A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
- A rational cubic clipping method for computing real roots of a polynomial
- Approximate GCD in Bernstein basis
- Bounds on a polynomial
- Computing multiple roots of inexact polynomials
- Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
- Computing roots of polynomials by quadratic clipping
- Curve intersection using Bézier clipping
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- High Order Terms for Condition Estimation of Univariate Polynomials
- scientific article; zbMATH DE number 5168246 (Why is no real title available?)
- scientific article; zbMATH DE number 1254251 (Why is no real title available?)
- scientific article; zbMATH DE number 1254271 (Why is no real title available?)
- scientific article; zbMATH DE number 2064527 (Why is no real title available?)
- Method for finding multiple roots of polynomials
- On the stability of transformations between power and Bernstein polynomial forms
- 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
- The computation of multiple roots of a polynomial
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
- The numerical factorization of polynomials
- The numerical greatest common divisor of univariate polynomials
- Total Least Norm Formulation and Solution for Structured Problems
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
Cited in
(7)- The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain
- Structured matrix methods for the computation of multiple roots of a polynomial
- A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis
- Computing multiple roots of inexact polynomials
- scientific article; zbMATH DE number 2151210 (Why is no real title available?)
- scientific article; zbMATH DE number 5019917 (Why is no real title available?)
- On the Calculation of the Bernstein-Szegö Factor for Multivariate Polynomials
This page was built for publication: The computation of multiple roots of a Bernstein basis polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216781)
