AbstractUsing a fixed point relation of the square-root type and the basic fourth-order method, improved methods of fifth and sixth order for the simultaneous determination of simple zeros of a polynomial are obtained. An increase in convergence is achieved without additional numerical operations, which points to high computational efficiency of the accelerated methods. The main aim of this work is the convergence analysis of improved simultaneous methods given under computationally verifiable initial conditions in the spirit of Smale’s point estimation theory
AbstractThe construction of initial conditions which provide the safe convergence of iterative proce...
AbstractWe propose a hybrid method to determine all the zeros of a polynomial simultaneously, by com...
AbstractSeveral algorithms for simultaneously approximating simple complex zeros of a polynomial are...
AbstractUsing a fixed point relation of the square-root type and the basic fourth-order method, impr...
AbstractThe construction of computationally verifiable initial conditions which provide both the gua...
AbstractA parametric family of iterative methods for the simultaneous determination of simple comple...
AbstractApplying Gauss-Seidel approach to the improvements of two simultaneous methods for finding p...
AbstractA new iterative method of the fourth-order for the simultaneous determination of polynomial ...
AbstractTwo one parameter families of iterative methods for the simultaneous determination of simple...
AbstractOne of the most important problems in solving nonlinear equations is the construction of suc...
Abstract. The construction of computationally verifiable initial conditions which provide both the g...
AbstractA one parameter family of iterative methods for the simultaneous approximation of simple com...
AbstractUsing Newton's and Halley's corrections, some modifications of the simultaneous method for f...
AbstractApplying Newton's and Halley's corrections, some modified methods of higher order for the si...
AbstractOne of the crucial problems in solving polynomial equations is to state some kind of quantit...
AbstractThe construction of initial conditions which provide the safe convergence of iterative proce...
AbstractWe propose a hybrid method to determine all the zeros of a polynomial simultaneously, by com...
AbstractSeveral algorithms for simultaneously approximating simple complex zeros of a polynomial are...
AbstractUsing a fixed point relation of the square-root type and the basic fourth-order method, impr...
AbstractThe construction of computationally verifiable initial conditions which provide both the gua...
AbstractA parametric family of iterative methods for the simultaneous determination of simple comple...
AbstractApplying Gauss-Seidel approach to the improvements of two simultaneous methods for finding p...
AbstractA new iterative method of the fourth-order for the simultaneous determination of polynomial ...
AbstractTwo one parameter families of iterative methods for the simultaneous determination of simple...
AbstractOne of the most important problems in solving nonlinear equations is the construction of suc...
Abstract. The construction of computationally verifiable initial conditions which provide both the g...
AbstractA one parameter family of iterative methods for the simultaneous approximation of simple com...
AbstractUsing Newton's and Halley's corrections, some modifications of the simultaneous method for f...
AbstractApplying Newton's and Halley's corrections, some modified methods of higher order for the si...
AbstractOne of the crucial problems in solving polynomial equations is to state some kind of quantit...
AbstractThe construction of initial conditions which provide the safe convergence of iterative proce...
AbstractWe propose a hybrid method to determine all the zeros of a polynomial simultaneously, by com...
AbstractSeveral algorithms for simultaneously approximating simple complex zeros of a polynomial are...