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

One of the most important problems in solving nonlinear equations is the construction of such initial conditions which provide both the guaranteed and fast convergence of the considered numerical algorithms. In this paper we study an iterative method of Newton's type for the inclusion of isolated complex zero of a given polynomial. We state computationally verifiable initial condition for the convergence of the considered interval method, which depends only on attainable data, and prove the quadratic convergence of this method. A numerical example is given.

On the Newton-like method for the inclusion of a polynomial zero