Fast computation of the Bézout and Dixon resultant matrices (Q1599530): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Concise parallel Dixon determinant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subresultants and Reduced Polynomial Remainder Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bézoutians / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inertia characteristics of self-adjoint matrix polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multipolynomial resultant algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cayley method in computer aided geometric design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494299 / rank
 
Normal rank

Revision as of 09:29, 4 June 2024

scientific article
Language Label Description Also known as
English
Fast computation of the Bézout and Dixon resultant matrices
scientific article

    Statements

    Fast computation of the Bézout and Dixon resultant matrices (English)
    0 references
    0 references
    11 June 2002
    0 references
    common root of polynomials
    0 references
    Gröbner bases
    0 references
    computer algebra systems
    0 references
    MAPLE
    0 references
    MATHEMATICA
    0 references
    performance
    0 references
    Bézout resultant matrix
    0 references
    Dixon-Cayley resultant matrix
    0 references
    algorithm
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references