A parallel version of a fast algorithm for singular integral transforms

The mathematical foundation of an algorithm for fast and accurate evaluation of singular integral transforms was given by Daripa [9,10,12]. By construction, the algorithm offers good parallelization opportunities and a lower computational complexity when compared with methods based on quadrature rules. In this paper we develop a parallel version of the fast algorithm by redefining the inherently sequential recurrences present in the original sequential formulation. The parallel version only utilizes a linear neighbor-to-neighbor communication path, which makes the algorithm very suitable for any distributed memory architecture. Numerical results and theoretical estimates show good parallel scalability of the algorithm.

[1]  Louis Nirenberg,et al.  On nonlinear elliptic partial differential equations and hölder continuity , 1953 .

[2]  Peter S. Pacheco.  Parallel programming with MPI , 1996 .

[3]  Chris R. Jesshope,et al.  Parallel Computers 2: Architecture, Programming and Algorithms , 1981 .

[4]  Prabir Daripa.  On applications of a complex variable method in compressible flows , 1990 .

[5]  장훈,et al.  [서평]「Computer Organization and Design, The Hardware/Software Interface」 , 1997 .

[6]  Francisco Argüello,et al.  FFTs on Mesh Connected Computers , 1996, Parallel Comput..

[7]  Prabir Daripa,et al.  An efficient and novel numerical method for quasiconformal mappings of doubly connected domains , 1998, Numerical Algorithms.

[8]  Kai Hwang,et al.  Advanced computer architecture - parallelism, scalability, programmability , 1992 .

[9]  L Howarth,et al.  Mathematical Aspects of Subsonic and Transonic Gas Dynamics , 1959 .

[10]  Prabir Daripa,et al.  Singular integral transforms and fast numerical algorithms , 1998, Numerical Algorithms.

[11]  Charles B. Morrey,et al.  On the solutions of quasi-linear elliptic partial differential equations , 1938 .

[12]  Christophe Calvin,et al.  Implementation of Parallel FFT Algorithms on Distributed Memory Machines with a Minimum Overhed of Communication , 1996, Parallel Comput..

[13]  R. Courant,et al.  Methods of Mathematical Physics , 1962 .

[14]  P. Daripa.  A fast algorithm to solve the Beltrami equation with applications to quasiconformal mappings , 1993 .

[15]  William L. Briggs,et al.  Multiprocessor FFT Methods , 1985, PPSC.

[16]  Prabir Daripa.  A Fast Algorithm to Solve Nonhomogeneous Cauchy-Riemann Equations in the Complex Plane , 1992, SIAM J. Sci. Comput..

[17]  Quasiconformal Mappings in the Plane: Parametrical Methods , 1983 .