A new semilocal convergence theorem for the Weierstrass method from data at one point
arXiv:0709.105921 citationsh-index: 20
Originality Synthesis-oriented
AI Analysis
Provides a more general convergence guarantee for the Weierstrass method, benefiting numerical analysts working on polynomial root-finding.
The paper presents a new semilocal convergence theorem for the Weierstrass method that generalizes and improves all previous results for simultaneous polynomial zero computation.
In this paper we present a new semilocal convergence theorem from data at one point for the Weierstrass iterative method for the simultaneous computation of polynomial zeros. The main result generalizes and improves all previous ones in this area.