Answers are grounded in this paper and cite their sources.
Analysis demonstrates local convergence of Wang–Zheng-type methods for multiple polynomial zeros, suggesting reliability in approximation.
This paper studies a new family of iterative methods for the simultaneous approximation of polynomial zeros with known multiplicities. The methods are obtained by combining the Wang–Zheng iteration function with an arbitrary iteration function. This approach leads to a class of methods referred to as Wang–Zheng-type methods with correction for multiple zeros. A local convergence analysis is developed for a wide class of iteration functions. The analysis describes the conditions under which the proposed methods converge locally. Several known iterative methods are examined as special cases of the general results. In particular, the family constructed by Kyurkchiev and Andreev (1990) is included. For every positive integer N, the N-th method of this family has convergence order 3N+1. The main local convergence theorem extends, complements and improves earlier results by Wang and Wu (1987) and by Kyurkchiev and Andreev (1990).
No takes yet. Share an insight, caveat, or question.
Vasileva et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: