Computing isolated singular solutions of polynomial systems: case of breadth one

DOI10.1137/110827247MaRDI QIDQ2882346zbMATH OpenOpenAlexFDO

Authors Nan Li, Lihong Zhi

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

isolated singular solutionlocal dual spacepolynomial systemquadratic convergenceregularized Newton iterationroot refinement

Mathematics Subject Classification ID

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

Abstract: We present a symbolic-numeric method to refine an approximate isolated singular solution $hatmathbfx=(hat{x}_1,\mathrm{...},hat{x}_n)$ of a polynomial system $F=f_1,\mathrm{...},f_n$ when the Jacobian matrix of $F$ evaluated at $hatmathbfx$ has corank one approximately. Our new approach is based on the regularized Newton iteration and the computation of approximate Max Noether conditions satisfied at the approximate singular solution. The size of matrices involved in our algorithm is bounded by $nimesn$. The algorithm converges quadratically if $hatxx$ is close to the isolated exact singular solution.

Recommendations

• Newton's method with deflation for isolated singularities of polynomial systems
• Verified error bounds for isolated singular solutions of polynomial systems
• scientific article; zbMATH DE number 3900059
• Computing multiple zeros of polynomial systems: case of breadth one (invited talk)
• Computing singular solutions to polynomial systems

Cited in

(20)

• Computing singular solutions to polynomial systems
• Efficient computation of dual space and directional multiplicity of an isolated point
• Computing multiple zeros of polynomial systems: case of breadth one (invited talk)
• Locating the closest singularity in a polynomial homotopy
• Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
• Numerical approximation of multiple isolated roots of analytical systems
• On deflation and multiplicity structure
• An improved method for evaluating Max Noether conditions: case of breadth one (extended abstract)
• Verified error bounds for isolated singular solutions of polynomial systems
• scientific article; zbMATH DE number 3900059 (Why is no real title available?)
• On Solving Nonlinear Equations with Simple Singularities or Nearly Singular Solutions
• Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one
• Computing the multiplicity structure of an isolated singular solution: case of breadth one
• Foreword. What is numerical algebraic geometry?
• On isolation of simple multiple zeros and clusters of zeros of polynomial systems
• scientific article; zbMATH DE number 5245181 (Why is no real title available?)
• 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
• Verified error bounds for singular solutions of nonlinear systems
• Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Computing isolated singular solutions of polynomial systems: case of breadth one

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