Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One

DOI10.1137/110827247zbMath1247.65065arXiv1008.0061OpenAlexW2091853326MaRDI QIDQ2882346

No author found.

Publication date: 4 May 2012

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.0061

zbMATH Keywords

polynomial systemquadratic convergenceroot refinementregularized Newton iterationlocal dual spaceisolated singular solution

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Polynomials, factorization in commutative rings (13P05) Numerical computation of roots of polynomial equations (65H04)

Related Items (11)

On deflation and multiplicity structure ⋮ Efficient computation of dual space and directional multiplicity of an isolated point ⋮ Improved two-step Newton's method for computing simple multiple zeros of polynomial systems ⋮ Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one ⋮ VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities ⋮ Two-step Newton's method for deflation-one singular zeros of analytic systems ⋮ Numerical approximation of multiple isolated roots of analytical systems ⋮ Foreword. What is numerical algebraic geometry? ⋮ On isolation of simple multiple zeros and clusters of zeros of polynomial systems ⋮ Verified error bounds for singular solutions of nonlinear systems ⋮ Locating the closest singularity in a polynomial homotopy

Uses Software

• Maple

This page was built for publication: Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One