Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods (Q1872931): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of roots of a system of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots / 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: A new efficient algorithm for computing Gröbner bases \((F_4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining All Solutions to Certain Systems of Nonlinear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Method for Solving Sparse Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral end games for polynomial continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving polynomial systems by polyhedral homotopies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding mixed cells in the mixed volume computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing singular solutions to polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Newton polytopes for solving sparse polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 777: HOMPACK90 / rank
 
Normal rank

Latest revision as of 16:31, 5 June 2024

scientific article
Language Label Description Also known as
English
Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods
scientific article

    Statements

    Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods (English)
    0 references
    0 references
    0 references
    0 references
    19 May 2003
    0 references
    0 references
    systems of equations
    0 references
    nonlinear programming
    0 references
    homotopy continuation methods
    0 references
    isolated solutions
    0 references
    polynomial equations
    0 references
    numerical results
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references