Related papers: Relationships between different types of initial c…
In this paper, we establish a general semilocal convergence theorem (with computationally verifiable initial conditions and error estimates) for iterative methods for simultaneous approximation of polynomial zeros. As application of this…
In this paper we study some iterative methods for simultaneous approximation of polynomial zeros. We give new semilocal convergence theorems with error bounds for Ehrlich's and Nourein's iterations. Our theorems generalize and improve…
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…
We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…
We study a family of high order Ehrlich-type methods for approximating all zeros of a polynomial simultaneously. Let us denote by $T^{(1)}$ the famous Ehrlich method (1967). Starting from $T^{(1)}$, Kjurkchiev and Andreev (1987) have…
The Durand-Kerner algorithm is a widely used iterative technique for simultaneously finding all the roots of a polynomial. However, its convergence heavily depends on the choice of initial approximations. This paper introduces two novel…
Iterative methods for the simultaneous determination of all roots of an equation are dis-cussed. The multiplicities of the roots are assumed to be known in advance. The methods are proved to have a cubical rate of convergence. Numerical…
In this paper, we prove some general convergence theorems for the Picard iteration in cone metric spaces over a solid vector space. As an application, we provide a detailed convergence analysis of the Weierstrass iterative method for…
In this paper, we consider a large class of nonlinear equations derived from first-order type methods for solving composite optimization problems. Traditional approaches to establishing superlinear convergence rates of semismooth…
A zero-finding technique for solving nonlinear equations more efficiently than they usually are with traditional iterative methods in which the order of convergence is improved is presented. The key idea in deriving this procedure is to…
We obtain local (i.e., linearized) convergence conditions for iterative methods that seek solitary waves with prescribed values of quadratic conserved quantities of multi-component Hamiltonian nonlinear wave equations. These conditions…
Kyurkchiev and Andreev (1985) constructed an infinite sequence of Weierstrass-type iterative methods for approximating all zeros of a polynomial simultaneously. The first member of this sequence of iterative methods is the famous method of…
This paper investigates the simultaneous identification of a spatially dependent potential and the initial condition in a subdiffusion model based on two terminal observations. The existence, uniqueness, and conditional stability of the…
The purpose of this paper is to present three new methods for finding all simple zeros of polynomials simultaneously. First, we give a new method for finding simultaneously all simple zeros of polynomials constructed by applying the…
Root-finders based on full linear multistep methods (LMMs) use previous function values, derivatives and root estimates to iteratively find a root of a nonlinear function. As ODE solvers, full LMMs are typically not zero-stable. However,…
The purpose of the present work is to study the existence of solutions to initial value problems for nonlinear first order differential systems with nonlinear nonlocal boundary conditions of functional type. The existence results are…
Necessary optimality conditions in Lagrangian form and the sequential minimization framework are extended to mixed-integer nonlinear optimization, without any convexity assumptions. Building upon a recently developed notion of local…
In this paper methods for simultaneous finding all roots of generalized polynomials are developed. These methods are related to the case when the roots are multiple. They possess cubic rate of convergence and they are as labour-consuming as…
We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…