On the history of the Bézoutian and the resultant matrix (Q922614): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Vlastimil Pták / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Vlastimil Pták / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast projection methods for minimal design problems in linear system theory / rank
 
Normal rank

Latest revision as of 10:44, 21 June 2024

scientific article
Language Label Description Also known as
English
On the history of the Bézoutian and the resultant matrix
scientific article

    Statements

    On the history of the Bézoutian and the resultant matrix (English)
    0 references
    0 references
    1990
    0 references
    This exciting story starts with two algorithms given by Euler (1748) to construct, in the ideal generated by F(x,y) and G(x,y), a polynomial independent of Y. Bézout (1764) described a reduction method which leads to a certain system of linear equations. It was Cayley (1857) who observed that the matrix of this system may be identified with the matrix known today as the Bézoutian, i.e. the matrix whose generating function is the polynomial \((f(x)g(y)-g(x)f(y))/(x-y)\).
    0 references
    resultant matrix
    0 references
    elimination theory
    0 references
    Bézoutian matrix
    0 references
    algorithms
    0 references
    ideal
    0 references
    polynomial
    0 references
    reduction method
    0 references

    Identifiers