The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
From MaRDI portal
(Redirected from Publication:338517)
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
Cites work
- scientific article; zbMATH DE number 1254251 (Why is no real title available?)
- scientific article; zbMATH DE number 1262453 (Why is no real title available?)
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- A fast algorithm for approximate polynomial gcd based on structured matrix computations
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
- Algorithm 812: BPOLY
- An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
- Bernstein-Bézoutian matrices
- Certified approximate univariate GCDs
- Computing curve intersection by means of simultaneous iterations
- Polynomial Scaling
- QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
- 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
- Structured matrix-based methods for polynomial \(\varepsilon\)-gcd: analysis and comparisons
- The computation of multiple roots of a polynomial
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
Cited in
(10)- An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain
- Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
- Numerical analysis of fractional viscoelastic column based on shifted Chebyshev wavelet function
- 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
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
- The computation of multiple roots of a Bernstein basis polynomial
- Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- Structure preserving methods for the computation of approximate GCDs of Bernstein polynomials
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)
