Computing singular solutions to polynomial systems

From MaRDI portal





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.



Cites work


Cited in
(24)


Describes a project that uses

Uses Software






This page was built for publication: Computing singular solutions to polynomial systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201933)