Computing all solutions to polynomial systems using homotopy continuation (Q1097645): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0096-3003(87)90064-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132476962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A methodology for solving chemical equilibrium systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A transformation to avoid solutions at infinity for polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homotopy for solving polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homotopy for solving general polynomial systems that respects m- homogeneous structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 652 / rank
 
Normal rank

Latest revision as of 14:40, 18 June 2024

scientific article
Language Label Description Also known as
English
Computing all solutions to polynomial systems using homotopy continuation
scientific article

    Statements

    Computing all solutions to polynomial systems using homotopy continuation (English)
    0 references
    0 references
    0 references
    1987
    0 references
    The authors establish the principles of implementation and report on the performance of computer programs that use the homotopies described in their previous paper [ibid. 24, 101-113 (1987; reviewed above)]. Numerical results are presented on three typical problems from geometric modeling, chemical equilibrium studies and kinematics of mechanisms. Generally the new approach is faster and more reliable.
    0 references
    zeros of polynomial functions
    0 references
    homotopy
    0 references
    continuation
    0 references
    computer programs
    0 references
    Numerical results
    0 references
    geometric modeling
    0 references
    chemical equilibrium
    0 references
    kinematics
    0 references

    Identifiers