Complexity-optimal algorithms for the approximate solution of singular integral equations

Publication date 3 October 2001

Published in Differential Equations (Search for Journal in Brave)

algorithms optimal numerical method singular integral equations weakly singular integral equations

Integral equations with kernels of Cauchy type (45E05) Integral equations of the convolution type (Abel, Picard, Toeplitz and Wiener-Hopf type) (45E10) Numerical methods for integral equations (65R20) Complexity and performance of numerical algorithms (65Y20)

Review text

The author estimates the number of arithmetic operations necessary for the numerical solution of one- and multi-dimensional second kind weakly singular integral equations and of one-dimensional singular integral equations. For these classes of integral equations he proposes algorithms that are optimal with respect to the order of complexity. No numerical example is considered.

Recommendations

Cited in

(9)

This page was built for publication: Complexity-optimal algorithms for the approximate solution of singular integral equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2703912)