Computing singular solutions to polynomial systems (Q1201933)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing singular solutions to polynomial systems |
scientific article; zbMATH DE number 98833
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing singular solutions to polynomial systems |
scientific article; zbMATH DE number 98833 |
Statements
Computing singular solutions to polynomial systems (English)
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
0 references
0 references
0 references
0.8121280074119568
0 references
0.8060531616210938
0 references
0.7968039512634277
0 references
0.7915943264961243
0 references
