The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
DOI10.1016/J.APNUM.2016.08.005zbMATH Open1353.65014OpenAlexW2513773657MaRDI QIDQ338517FDOQ338517
Authors: Martin Bourne, Su Yi, Joab R. Winkler 
Publication date: 7 November 2016
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: http://eprints.whiterose.ac.uk/104349/1/winkler.pdf
Recommendations
- Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain
- Structure preserving methods for the computation of approximate GCDs of Bernstein polynomials
- A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
Bernstein polynomialssingular value decompositionapproximate greatest common divisorQR decompositionSylvester resultant matrixBézout matrix
Numerical linear algebra (65F99) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Solving polynomial systems; resultants (13P15)
Cites Work
- Algorithm 812: BPOLY
- Computing curve intersection by means of simultaneous iterations
- Certified approximate univariate GCDs
- Structured matrix methods for the computation of multiple roots of a polynomial
- QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
- A fast algorithm for approximate polynomial gcd based on structured matrix computations
- Title not available (Why is that?)
- Title not available (Why is that?)
- The computation of multiple roots of a polynomial
- An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
- Structured matrix-based methods for polynomial \(\varepsilon\)-gcd: analysis and comparisons
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
- Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
- Polynomial Scaling
- Bernstein-Bézoutian matrices
Cited In (10)
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
- The computation of multiple roots of a Bernstein basis polynomial
- The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain
- A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
- An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain
- Structure preserving methods for the computation of approximate GCDs of Bernstein polynomials
- Numerical analysis of fractional viscoelastic column based on shifted Chebyshev wavelet function
- Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
Uses Software
This page was built for publication: The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338517)
