Chebyshev polynomials for disjoint compact sets, in
Constr. Approx.,
8 , 309-329, 1992.
(Abstract)
An algorithm for complex
linear approximation based on semi-infinite programming,
with Jan Modersitzki, in
Numerical Algorithms,
5 , 287-299, 1993.
(Abstract)
The convergence rate of the minimal residual method for the
Stokes problem,
with Andy Wathen and David Silvester, in
Num. Math. , 71 , 121-134, 1995.
(Abstract)
The convergence of iterative methods for symmetric
and indefinite linear systems,
with Andy Wathen and David Silvester, in
Numerical Analysis 97 ,
D.F. Griffiths, D.J. Higham and G.A. Watson (eds.),
Longman, 230-244, 1998.
(Abstract)
(Postscript)(137kb)
Chebyshev approximation via polynomial mappings and the convergence
behaviour of Krylov subspace methods,
with Franz Peherstorfer,
ETNA , 12, 205-215, 2001.
(Abstract)
(Postscript)(150kb)
Associated Software:
to obtain MATLAB source codes
for computing the best Chebyshev approximation
to a given function on a region in the complex plane
with respect to a linear function space,
try
COCA (COmplex linear Chebyshev Approximation).
