AbstractWe give new proofs of some known results concerning an iterative method of Newton type for the simultaneous calculation of all roots of a polynomial, originally proposed by Weierstrass [1]. The previously known local convergence analysis of the method is simplified and sharpened. We also propose a modified method with improved convergence properties. Global convergence of both methods is touched upon briefly
AbstractIn this paper the concept of partial Padé approximation, introduced by Claude Brezinski, is ...
An iterative method is described which finds all the roots of a square-free polynomial at once, usin...
AbstractTwo accelerating generators that produce iterative root-finding methods of arbitrary order o...
AbstractWe give new proofs of some known results concerning an iterative method of Newton type for t...
AbstractConvergence properties of the SOR Weierstrass method for the simultaneous approximation of p...
AbstractThe purpose of the paper is to present some procedures for the construction of simultaneous ...
AbstractMany problems in mathematics and other natural sciences and techniques reduce themselves to ...
AbstractApplying Newton's and Halley's corrections, some modified methods of higher order for the si...
AbstractWe propose a hybrid method to determine all the zeros of a polynomial simultaneously, by com...
AbstractIn this note we present a numerical method to approximate some relatively prime factors of a...
AbstractApplying Hansen-Patrick's formula for solving the single equation f(z) = 0 to a suitable fun...
AbstractThe construction of computationally verifiable initial conditions which provide both the gua...
AbstractUsing a fixed point relation of the square-root type and the basic fourth-order method, impr...
Abstract Two new iterative methods for the simultaneous determination of all multiple as well as dis...
AbstractOne of the most important problems in solving nonlinear equations is the construction of suc...
AbstractIn this paper the concept of partial Padé approximation, introduced by Claude Brezinski, is ...
An iterative method is described which finds all the roots of a square-free polynomial at once, usin...
AbstractTwo accelerating generators that produce iterative root-finding methods of arbitrary order o...
AbstractWe give new proofs of some known results concerning an iterative method of Newton type for t...
AbstractConvergence properties of the SOR Weierstrass method for the simultaneous approximation of p...
AbstractThe purpose of the paper is to present some procedures for the construction of simultaneous ...
AbstractMany problems in mathematics and other natural sciences and techniques reduce themselves to ...
AbstractApplying Newton's and Halley's corrections, some modified methods of higher order for the si...
AbstractWe propose a hybrid method to determine all the zeros of a polynomial simultaneously, by com...
AbstractIn this note we present a numerical method to approximate some relatively prime factors of a...
AbstractApplying Hansen-Patrick's formula for solving the single equation f(z) = 0 to a suitable fun...
AbstractThe construction of computationally verifiable initial conditions which provide both the gua...
AbstractUsing a fixed point relation of the square-root type and the basic fourth-order method, impr...
Abstract Two new iterative methods for the simultaneous determination of all multiple as well as dis...
AbstractOne of the most important problems in solving nonlinear equations is the construction of suc...
AbstractIn this paper the concept of partial Padé approximation, introduced by Claude Brezinski, is ...
An iterative method is described which finds all the roots of a square-free polynomial at once, usin...
AbstractTwo accelerating generators that produce iterative root-finding methods of arbitrary order o...