On Clenshaws's Method and a Generalisation to Faber Series.
The paper deals with the computation of Aden functions. It gives estimates of errors for the computation of Aden functions by downward reccurence.
The author investigates methods of nomographing functional relations among three complex variables which satisfy the equation (involving Massau’s complex chart determinant) det , in the line coordinates.
The paper analyses the biconjugate gradient algorithm and its preconditioned version for solving large systems of linear algebraic equations with nonsingular sparse complex matrices. Special emphasis is laid on symmetric matrices arising from discretization of complex partial differential equations by the finite element method.
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...