An Algorithm for Finding All Isolated Zeros of Polynomial Systems

Finding all zeros of polynomial systems is very interesting and it is also useul for many applied science problems.In this paper,based on Wu's method,we give an algorithm to find all isolated zeros of polynomial systems (or polynomial equations).By solving Lorenz equations,it is shown that our algo-rithm is efficient and powerful.

ON THE ZEROS OF A CLASS OF POLYNOMIALS AND RELATED ANALYTIC FUNCTIONS

In this paper we prove some interesting extensions and generalizations of Enestrom- Kakeya Theorem concerning the location of the zeros of a polynomial in a complex plane. We also obtain some zero-free regions for a class of related analytic functions. Our results not only contain some known results as a special case but also a variety of interesting results can be deduced in a unified way by various choices of the parameters.

DENSITY OF MARKOV SYSTEMS AND ZEROS OF CHEBYSHEV POLYNOMIALS

We raise and partly answer the question: whether there exists a Markov system with respect to which the zeros of the Chebyshev polynomials are dense, but the maximum length of a zero free interval of the nth Chebyshev polynomial does not tends to zero. We also draw the conclu- tion that a Markov system, under an additional assumption, is dense if and only if the maxi- mum length of a zero free interval of the nth associated Chebyshev polynomial tends to zero.

ON SETS OF ZEROES OF CLIFFORD ALGEBRA-VALUED POLYNOMIALS

In this note, we study zeroes of Clifford algebra-valued polynomials. We prove that if such a polynomial has only real coefficients, then it has two types of zeroes： the real isolated zeroes and the spherical conjugate ones. The total number of zeroes does not exceed the degree of the polynomial. We also present a technique for computing the zeroes.

ON CONVERGENCE OF NOUREIN ITERATIONS FOR SIMULTANEOUS FINDING ALL ZEROS OF A POLYNOMIAL

Presents the first estimation conditions for Nourein iterations for simultaneous finding all zeros of a polynomial under which the iteration processes are guaranteed to converge. Computational formulas; Theorems and proofs.

ON NEWMAN-TYPE RATIONAL INTERPOLATION TO |x| AT THE CHEBYSHEV NODES OF THE SECOND KIND

Recently Brutman and Passow considered Newman-type rational interpolation to ｜x｜ induced by arbitrary set of symmetric nodes in [-1,1] and gave the general estimation of the approximation error.By their methods one could establish the exact order of approximation for some special nodes. In the present paper we consider the special case where the interpolation nodes are the zeros of the Chebyshev polynomial of the second kind and prove that in this case the exact order of approximation is O（1/n｜nn）

Orthogonal Laurent Polynomials and Their Zeros

In this note, we investigate the necessity for the measure dψ being a strong distribution, which is associated with the coefficients of the recurrence relation satisfied by the orthogonal Laurent polynomials. We also give out a representation of the greatest zeros of orthogonal Laurent polynomials in the case of dψ being a strong distribution.

ON THE COMPLEXITY OF A PL HOMOTOPY ALGORITHM FOR ZEROS OF POLYNOMIALS

A PL homotopy algorithm is modified to yield a polynomial-time result on its computational complexity.We prove that the cost of locating all zeros of a polynomial of degree n to an accuracy of ε(measured by the number of evaluations of the polynomial)grows no faster than O(max{n^4,n^3log_2(n/ε)}).This work is in response to a question raised in a paper by S.Smale as to the efficiency of piecewise linear methods in solving equations.In comparison with a few results reported,the algorithm under discussion is the only one providing correct multiplicities and the only one employing vector labelling.

ON COMPUTING ZEROS OF A BIVARIATE BERNSTEIN POLYNOMIAL

In this paper, the problem of computing zeros of a general degree bivariate Bernstein polynomial is considered. An efficient and robust algorithm is presented that takes into full account particular properties of the function considered. The algorithm works for rectangular as well as triangular domains. The outlined procedure can also be applied for the computation of the intersection of a Bezier patch and a plane as well as in the determination of an algebraic curve restricted to a compact domain. In particular, singular points of the algebraic curve are reliably detected.

A FAMILY OF HIGH-ODER PARALLEL ROOTFINDERS FOR POLYNOMIALS

Presents a family of parallel iterations for finding all zeros of a polynomial without evaluation of derivatives. Construction of iterations; Convergence of the iterations; Details on the numerical examples.

A Curious Identity on Multiple Sums over Fields with Applications

Let F be a field,and let e,k be integers such that 1≤e≤|F\{0}|and k≥0.We show that for any subset{a1,……,ae}■F\{0},the curious identity∑(i1+……ie)∈Z^(e)≥0,i1+……+ie=k a_(1)^(i1)…a_(e)^(ie)=∑i=1 e a_(i)^(k+e-1)/∏i≠j=1 e(a_(i)-a_(j))holds with Z≥0 being the set of nonnegative integers.As an application,we prove that for any subset{a_(1)…,a_(e)}■F_(q)\{0}with F_(q)being the finite field of q elements and e,l being integers such that 2≤e≤q-1 and 0≤l≤e-2,∑(i_(1),…,i_(e))∈Z^(e)≥0,i_(1)+…i_(e)=q-e+l a_(1)^(i1)…a_(e)^(ie)=0 Using this identity and providing an extension of the principle of cross-classification that slightly generalizes the one obtained by Hong in 1996,we show that if r is an integer with 1≤r≤q-2,then for any subset{a_(1),…a_(r)}■F_(q)^(*)we have x^(q-1)-1/∏i=1 r(x-a_(i))-∑i=1 q-1-r(∑i_(1)+…+i_(r)=q-1-r-i^(a_(1)^(i1)…a_(r)^(ir)))x^(i).This implies#{x∈Fq*|∑i=0 q-1-4(∑_(i1)+…+ir=q-1-r-i^(a_(1)^(i1)…a_(r)^(ir)))x^(i)=0}=q-1-r.