Asymptotics of orthogonal polynomials and the numerical solution of ill-posed problems (Q1911450)

The paper reviews recent progress and open problems in connection with two iterative methods for the numerical solution of linear ill-posed problems, namely, Brakhage's \(\nu\)-method and the conjugate gradient method. Both methods can be defined in terms of real orthogonal polynomials. Basic results on such iterative methods are summarized and the asymptotics of Christoffel functions is shown to lead to a saturation result for the convergence rate of the \(\nu\)-method. Then iterative methods without saturation are discussed using fast decreasing polynomials; but certain necessary conditions suggest that no system of orthogonal fast decreasing polynomials may exist. Finally, some results on convergence rate estimates for the conjugate gradient method for compact operator equations are presented in the setting of two prototype problems related to the Tricomi-Carlitz polynomials and the modified Lommel polynomials.