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

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

2010-07-31

arxiv.org/abs/1008.0061v2

Mathematics

Numerical Analysis

Scientific paper

We present a symbolic-numeric method to refine an approximate isolated singular solution $\hat{\mathbf{x}}=(\hat{x}_{1}, ..., \hat{x}_{n})$ of a polynomial system $F=\{f_1, ..., f_n\}$ when the Jacobian matrix of $F$ evaluated at $\hat{\mathbf{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 \times n$. The algorithm converges quadratically if $\hat{\xx}$ is close to the isolated exact singular solution.

Affiliated with

Also associated with

No associations

Rating

Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8561