Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
We consider a polynomial collocation for the numerical solution of a second kind integral equation with an integral kernel of Mellin convolution type. Using a stability result by Junghanns and one of the authors, we prove that the error of the approximate solution is less than a logarithmic factor times the best approximation and, using the asymptotics of the solution, we derive the rates of convergence. Finally, we describe an algorithm to compute the stiffness matrix based on simple Gauss quadratures and an alternative algorithm based on a recursion in the spirit of Monegato and Palamara Orsi. All together an almost best approximation to the solution of the integral equation can be computed with O(n^2[log n]^2) resp. O(n^2) operations, where n is the dimension of the polynomial trial space.