Computing singular solutions to polynomial systems (Q1201933): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3911286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of polynomial equations by bounded and real homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Rates for Newton’s Method at Singular Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton’s Method at Singular Points. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton’s Method at Singular Points. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broyden’s Method for a Class of Problems Having Singular Jacobian at the Root / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eine Methode zur Berechnung sämtlicher Lösungen von Polynomgleichungssystemen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3917180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex analytic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3865883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all solutions to polynomial systems and other systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach to Homotopy and Degree Theory / 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: Q3657778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solving Nonlinear Equations with Simple Singularities or Nearly Singular Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Newton’s Method at Irregular Singularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometrically Isolated Nonisolated Solutions and Their Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3324935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Solution of a Class of Deficient Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerically determining solutions of systems of polynomial equations / 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: A methodology for solving chemical equilibrium systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Computing All Solutions to Systems of Polynomials Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homotopy for solving polynomial 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: Q4000024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477888 / 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: Computing all solutions to polynomial systems using homotopy continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficient-parameter polynomial continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3468723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing singular solutions to nonlinear analytic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all isolated solutions to polynomial systems using HOMPACK / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally Convergent Method for Simultaneously Finding Polynomial Roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the Newton process to multiple solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Newton’s Method for Singular Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the monotone convergence of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent algorithm for computing fixed points of \(C^2\) maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding All Solutions to a System of Polynomial Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solutions to polynomial systems obtained by homotopy methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813159 / rank
 
Normal rank

Latest revision as of 14:16, 17 May 2024

scientific article
Language Label Description Also known as
English
Computing singular solutions to polynomial systems
scientific article

    Statements

    Computing singular solutions to polynomial systems (English)
    0 references
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    A method to improve the accuracy of approximations to singular solutions of polynomial systems is presented. The method is established in a context of polynomial continuation; thus all solutions are generated, with the singular solution being approximated more accurately by standard implementations. The theorem on which the method is based is proven using results from several complex variables and algebraic geometry. A specific implementation is given and the results in solving four test problems are presented.
    0 references
    0 references
    0 references
    0 references
    0 references
    singular solutions
    0 references
    polynomial systems
    0 references
    polynomial continuation
    0 references
    implementation
    0 references
    test problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references