The Computation of Multiple Roots of a Bernstein Basis Polynomial (Q5216781): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computing roots of polynomials by quadratic clipping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3162294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rational cubic clipping method for computing real roots of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate GCD in Bernstein basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of transformations between power and Bernstein polynomial forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Least Norm Formulation and Solution for Structured Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curve intersection using Bézier clipping / rank
 
Normal rank
Property / cites work
 
Property / cites work: GPGCD: an iterative method for calculating approximate GCD of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A companion matrix resultant for Bernstein polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: High Order Terms for Condition Estimation of Univariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured matrix methods for the computation of multiple roots of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4462008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of multiple roots of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The numerical factorization of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method for finding multiple roots of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing multiple roots of inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The numerical greatest common divisor of univariate polynomials / rank
 
Normal rank

Latest revision as of 20:56, 21 July 2024

scientific article; zbMATH DE number 7170180
Language Label Description Also known as
English
The Computation of Multiple Roots of a Bernstein Basis Polynomial
scientific article; zbMATH DE number 7170180

    Statements

    The Computation of Multiple Roots of a Bernstein Basis Polynomial (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 February 2020
    0 references
    0 references
    Bernstein basis polynomials
    0 references
    Sylvester resultant matrix
    0 references
    Sylvester subresultant matrices
    0 references
    greatest common divisor
    0 references
    multiple roots
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references