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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we establish a general semilocal convergence theorem (withcomputationally verifiable initial conditions and error estimates) foriterative methods for simultaneous approximation of polynomial zeros. Asapplication of this theorem, we provide new semilocal convergence results forEhrlich's and Dochev-Byrnev's root-finding methods. These results improve theresults of Petkovi\'c, Herceg and Ili\'c [Numer. Algorithms 17 (1998) 313--331]and Proinov [C.~R. Acad. Bulg. Sci. 59 (2006) 705--712]. We also prove thatDochev-Byrnev's method (1964) is identical to Pre{\v s}i\'c-Tanabe's method(1972).

A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods