Author(s)

Daoud Mashat, Manal Alotibi

.

An algorithm is provided for the fast and accurate computation of the solution of the Bitsadze equation in the complex plane in the interior of the unit disk. The algorithm is based on the representation of the solution in terms of a double integral as it shown by Begehr [1,2], some recursive relations in Fourier space, and Fast Fourier Transforms. The numerical evaluation of integrals at points on a polar coordinate grid by straightforward summation for the double integral would require floating point operation per point. Evaluation of such integrals has been optimized in this paper giving an asymptotic operation count of per point on the average. In actual implementation, the algorithm has even better computational complexity, approximately of the order of per point. The algorithm has the added advantage of working in place, meaning that no additional memory storage is required beyond that of the initial data. This paper is a result of application of many of the original ideas described in Daripa [3].

Singular Integrals, Fast Algorithm, Bitsadze Equation

D. Mashat and M. Alotibi, "A Fast Algorithm to Solve the Bitsadze Equation in the Unit Disk," Applied Mathematics, Vol. 2 No. 1, 2011, pp. 118-122. doi: 10.4236/am.2011.21013.