Affiliation:
1. Technische Universität, Fakultät für Mathematik, Chemnitz, Germany
Abstract
We describe an algorithm for the numerical solution of an integral equation
of the form ? 1/? ?1?1 [(y ? x) ln |y ? x| ? h(x, y)] u(y) dy/?1?y2 =
f(x), ?1 < x < 1, which is based on a collocation-quadrature method and
which has the same convergence rate as this method, but only O(n log n)
complexity. This integral equation turns out to be an ill-posed problem in
(the best possible choice of) a pair of non-periodic Sobolev-like spaces.
The present paper presents the technique, how to overcome this peculiarity
in the investigation of the fast algorithm.
Publisher
National Library of Serbia
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献