A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials (Q2400326): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cam.2017.01.035 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Implicitizing rational surfaces using moving quadrics constructed from moving planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Viro method for construction of Bernstein-Bézier algebraic hypersurface piece / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Viro method for construction of \(C^r\) piecewise algebraic hypersurfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common factor detection and estimation / 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: The computation of multiple roots of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bernstein-Bézoutian matrices / 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: Q4462008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured Total Least Norm for Nonlinear Problems / 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: 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: Algorithm 812: BPOLY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3162294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS / 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: A resultant matrix for scaled Bernstein polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4917542 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.CAM.2017.01.035 / rank
 
Normal rank

Latest revision as of 09:44, 18 December 2024

scientific article
Language Label Description Also known as
English
A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
scientific article

    Statements

    A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2017
    0 references
    approximate greatest common divisor
    0 references
    Sylvester resultant matrix
    0 references
    structure-preserving matrix methods
    0 references
    computer aided geometric design
    0 references
    Bernstein polynomials
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers