On the fourth order root finding methods of Euler's type.
On the guaranteed convergence of the Japanese zero-finding method.
On the Irreducibility of Polynomials Taking Small Values.
On the Mahler measure of Jones polynomials under twisting.
On the power-series expansion of a rational function
Introduction. The problem of determining the formula for , the number of partitions of an integer into elements of a finite set S, that is, the number of solutions in non-negative integers, , of the equation hs₁ s₁ + ... + hsk sk = n, was solved in the nineteenth century (see Sylvester [4] and Glaisher [3] for detailed accounts). The solution is the coefficient of[(1-xs₁)... (1-xsk)]-1, expressions for which they derived. Wright [5] indicated a simpler method by which to find part of the solution...
On the Sharpness of Theorems Concerning Zero-Free Regions for Certain Sequences of Polynomials.
On the shifted QR iteration applied to companion matrices.
On the Various Bisection Methods Derived from Vincent’s Theorem
In 2000 A. Alesina and M. Galuzzi presented Vincent’s theorem “from a modern point of view” along with two new bisection methods derived from it, B and C. Their profound understanding of Vincent’s theorem is responsible for simplicity — the characteristic property of these two methods. In this paper we compare the performance of these two new bisection methods — i.e. the time they take, as well as the number of intervals they examine in order to isolate the real roots of polynomials — against that...
On tolerance analysis