A method which finds simultaneously all the zeros of a polynomial, developed by H. Rutishauser, has been tested on a number of polynomials with real coefficients. This slowly converging method (the ...

Abstract: In this paper, we present an algorithm using the GPGPU machine to compute the interval solutions of isolated real zeros of multivariate polynomial functions in given ranges. To overcome the ...

Department of Material Science and Engineer, Southwest University of Science and Technology, Mianyang, China. Department of Mathematics, Southwest University of Science and Technology, Mianyang, China ...

This project implements numerical algorithms for the computation of zeros of holomorphic as well as the zeros, poles and residues of meromorphic functions. It aspires to be a successor to and an ...

The following results which is due to Enestrom and Kakeya [1] is well known in the theory of the location of the zeros of polynomials. The aim of this paper is to prove some extensions of ...

American Journal of Mathematics, Vol. 124, No. 1 (Feb., 2002), pp. 1-48 (48 pages) We consider zeta functions defined as Euler products of $W(p,p^{-s})$ over all ...

In mathematics and computing, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function f, from the real numbers to real numbers or ...

Asociatia SINUS is a Foundation that supports all kind of activities regarding encouragement of all kinds of mathematical activities.

Abstract: In this paper, we focus on finding positive invariants and Lyapunov functions to establish reachability and stability properties, respectively, of polynomial ordinary differential equations ...