Open AccessInclusion Weierstrass-like root-finders with corrections
Author(s) -
Dalibor Petković,
Stanko Petković,
Marija Milošević
Publication year - 2003
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil0317143p
Subject(s) - mathematics , inversion (geology) , convergence (economics) , interval (graph theory) , root finding algorithm , polynomial , set (abstract data type) , root (linguistics) , type (biology) , interval arithmetic , algorithm , mathematical analysis , combinatorics , computer science , nonlinear system , paleontology , linguistics , philosophy , physics , ecology , structural basin , quantum mechanics , economics , biology , programming language , economic growth , bounded function
In this paper we present iterative methods of Weierstrass's type for the simultaneous inclusion of all multiple zeros of a polynomial. The order of convergence of the proposed interval method is 1 + ?2 ? 2.414 or 3, depending on the type of the applied disk inversion. The criterion for the choice of a proper circular root-set is given. This criterion uses the already calculated entries which increases the computational efficiency of the presented algorithms. Numerical results are given to demonstrate the convergence behavior.