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

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

h a t m a t h b f x = (h a t x_{1}, ..., h a t x_{n})

of a polynomial system

F = f_{1}, ..., f_{n}

when the Jacobian matrix of

F

evaluated at

h a t m a t h b f x

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

n i m e s n

. The algorithm converges quadratically if

h a t x x

is close to the isolated exact singular solution.

Review text

Let us consider an approximate singular solution \(\hat{\eta}\) of a polynomial system \(F=\{f_1, \dots, f_n\}\) satisfying \(\|\hat \eta- \hat \eta_{{e}}\|=\varepsilon\), where \(\hat{\eta}_{{e}}\) denotes the isolated exact singular solution of \(F\), the positive number \(\varepsilon\) is small enough such that there are no other solutions of \(F\) nearby, and assume that the corank of the Jacobian matrix \(F'(\hat{\eta}_{{e}})\) is one. In view to restore the quadratic convergence of the Newton method, the authors apply one regularized Newton iteration to obtain a new approximation \(\hat \eta+\hat \theta\), and then compute the approximate null vector \(\vartheta_1\) of the Jacobian \(F'(\hat \eta+\hat \theta)\) which gives a generalized Newton direction, and the step length \(\delta\) is obtained by solving a linear system. They show that NEWLINE\[NEWLINE\|\hat \eta+\hat \theta+ \delta \vartheta_1- \hat \eta_{{e}}\| = O(\varepsilon^2).NEWLINE\]NEWLINE The size of matrices involved in the algorithm is bounded by \(n\times n\), and the method has been implemented in Maple.

Recommendations

Cited in

(20)

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)