English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We present a symbolic-numeric method to refine an approximate isolated singular solution $\hat{\mathbf{x}}=(\hat{x}_{1}, \ldots, \hat{x}_{n})$ of a polynomial system $F=\{f_1, \ldots, 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 differential 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{\mathbf{x}}$ is close to the isolated exact singular solution.

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