Heuristics to accelerate the Dixon resultant (Q2483552): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Generalized resultants over unirational algebraic varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient incremental algorithms for the sparse resultant and the mixed volume / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: EXACT COMPUTATION OF THE BIFURCATION POINT B<sub>4</sub> OF THE LOGISTIC MAP AND THE BAILEY–BROADHURST CONJECTURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic tangency equations and Apollonius problems in biochemistry and pharmacology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Search for Flexibility Using Resultants of Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components / rank
 
Normal rank

Latest revision as of 22:27, 27 June 2024

scientific article
Language Label Description Also known as
English
Heuristics to accelerate the Dixon resultant
scientific article

    Statements

    Heuristics to accelerate the Dixon resultant (English)
    0 references
    0 references
    28 April 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    numerical examples
    0 references
    Dixon resultant method
    0 references
    system of polynomial equations
    0 references
    determinant
    0 references
    resultant
    0 references
    0 references