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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: PITCON / rank
 
Normal rank

Revision as of 18:22, 29 February 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
    singular solutions
    0 references
    polynomial systems
    0 references
    polynomial continuation
    0 references
    implementation
    0 references
    test problems
    0 references

    Identifiers