In this paper, we extend the dual form of the generalized algorithm of Sebastião e Silva [3] for polynomial zeros and show that it is effective for finding zeros of transcendental functions in a circle of analyticity.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46319/1/211_2005_Article_BF01401040.pd
AbstractEmpirical data for the polynomial confirm the efficiency of exploring function structure as ...
This is to certify that this PhD thesis is, to the best of my knowledge, entirely my own work, excep...
In this paper, by using standard techniques we shall obtain results with relaxed hypothesis which g...
In this paper, we extend Householder's [4] generalization of an algorithm of Sebastião e Silva [11] ...
AbstractConsideration is given to the ways in which an algorithm for finding the zeros of polynomial...
AbstractA family of iterative methods for simultaneously approximating simple zeros of analytic func...
We propose a simple and fast implimentation to find real zeros of polynomials of integercoefiicients...
AbstractApplying Gauss-Seidel approach to the improvements of two simultaneous methods for finding p...
Let P(z) be a polynomial of degree n with real or complex coefficients. In this paper we obtain a ri...
AbstractSeveral algorithms for simultaneously approximating simple complex zeros of a polynomial are...
AbstractIn a recent paper [2], Nourein derived an iteration formula, which exhibited cubic convergen...
AbstractA globally convergent matrix algorithm is presented for finding the real and complex zeros o...
AbstractA new iterative method for finding simultaneously all zeros of generalized polynomials is co...
AbstractTwo one parameter families of iterative methods for the simultaneous determination of simple...
AbstractA parametric family of iterative methods for the simultaneous determination of simple comple...
AbstractEmpirical data for the polynomial confirm the efficiency of exploring function structure as ...
This is to certify that this PhD thesis is, to the best of my knowledge, entirely my own work, excep...
In this paper, by using standard techniques we shall obtain results with relaxed hypothesis which g...
In this paper, we extend Householder's [4] generalization of an algorithm of Sebastião e Silva [11] ...
AbstractConsideration is given to the ways in which an algorithm for finding the zeros of polynomial...
AbstractA family of iterative methods for simultaneously approximating simple zeros of analytic func...
We propose a simple and fast implimentation to find real zeros of polynomials of integercoefiicients...
AbstractApplying Gauss-Seidel approach to the improvements of two simultaneous methods for finding p...
Let P(z) be a polynomial of degree n with real or complex coefficients. In this paper we obtain a ri...
AbstractSeveral algorithms for simultaneously approximating simple complex zeros of a polynomial are...
AbstractIn a recent paper [2], Nourein derived an iteration formula, which exhibited cubic convergen...
AbstractA globally convergent matrix algorithm is presented for finding the real and complex zeros o...
AbstractA new iterative method for finding simultaneously all zeros of generalized polynomials is co...
AbstractTwo one parameter families of iterative methods for the simultaneous determination of simple...
AbstractA parametric family of iterative methods for the simultaneous determination of simple comple...
AbstractEmpirical data for the polynomial confirm the efficiency of exploring function structure as ...
This is to certify that this PhD thesis is, to the best of my knowledge, entirely my own work, excep...
In this paper, by using standard techniques we shall obtain results with relaxed hypothesis which g...
DOI
Add to ORKG