On the paths to the zeros of a polynomial.
Fast intersection methods for the solution of some nonlinear systems of equations.
The complexity of retina operators.
Deux espaces de Banach et leurs modèles étalés
Approximation des optima de Pareto
Estimates for H2 functions with concentration at low degrees and applications to complex symbolic computation.
Jensen's Inequality for Polynomials with Concentration at Low Degrees.
Banach-Saks properties and spreading models.
An operator on a separable Hilbert space with many hypercyclic vectors
An operator on a separable Hilbert space with all polynomials hypercyclic
Finding the roots of polynomial equations: an algorithm with linear command.
We show how an old principle, due to Walsh (1922), can be used in order to construct an algorithm which finds the roots of polynomials with complex coefficients. This algorithm uses a linear command. From the very first step, the zero is located inside a disk, so several zeros can be searched at the same time.
Oceano TeX
Page 1