Uniform convergence of a fast algorithm for Cauchy singular integral equations (Q1307212)

\textit{D. Berthold}, \textit{W. Hoppe} and \textit{B. Silbermann} [J. Comput. Appl. Math. 43, No. 1-2, 185-219 (1992; Zbl 0761.65102)] and \textit{M. R. Capobianco}, \textit{G. Criscuolo} and \textit{P. Junghanns} [ibid. 77, No. 1-2, 103-128 (1997; Zbl 0870.65135)] introduced and analyzed fast algorithms for the approximate solution of operator equations containing Cauchy singular integral operators on an interval. These algorithms exploit the stability and convergence properties of a collocation-quadrature method and are based on a modification which permits the application of fast discrete sine or cosine transformations. In contrast to error estimates in a scale of weighted Sobolev spaces derived in those papers, the authors now show how, for equations with regular perturbation kernel, \[ {1\over \pi}\int^1_{-1} {u(t)\over t-x} \sqrt{{1+ t\over 1-t}} dt+ {1\over \pi} \int^1_{-1} h(x,t) u(t) \sqrt{{1+ t\over 1- t}} dt= f(x),\quad x\in (-1,1), \] where \(h\) and \(f\) are continuous (complex-valued) functions, the convergence of the fast algorithm can be analyzed in weighted uniform norms. Three numerical examples illustrate the theoretical results.