Error and Complexity Analysis for a Collocation-Grid-Projection Plus Precorrected-FFT Algorithm for Solving Potential Integral Equations with LaPlace or Helmholtz Kernels

In this paper we derive error bounds for a collocation-grid-projection scheme tuned for use in multilevel methods for solving boundary-element discretizations of potential integral equations. The grid-projection scheme is then combined with a precorrected FFT style multilevel method for solving potential integral equations with 1/r and e(sup ikr)/r kernels. A complexity analysis of this combined method is given to show that for homogeneous problems, the method is order n natural log n nearly independent of the kernel. In addition, it is shown analytically and experimentally that for an inhomogeneity generated by a very finely discretized surface, the combined method slows to order n(sup 4/3). Finally, examples are given to show that the collocation-based grid-projection plus precorrected-FFT scheme is competitive with fast-multipole algorithms when considering realistic problems and 1/r kernels, but can be used over a range of spatial frequencies with only a small performance penalty.

[1]  A. D. McLaren,et al.  Optimal numerical integration on a sphere , 1963 .

[2]  Roger F. Harrington,et al.  Field computation by moment methods , 1968 .

[3]  D. A. Dunnett.  Classical Electrodynamics , 2020, Nature.

[4]  A. Ruehli,et al.  Efficient Capacitance Calculations for Three-Dimensional Multiconductor Systems , 1973 .

[5]  A. Mayo.  The Fast Solution of Poisson’s and the Biharmonic Equations on Irregular Regions , 1984 .

[6]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[7]  L. Greengard.  The Rapid Evaluation of Potential Fields in Particle Systems , 1988 .

[8]  V. Rokhlin.  Rapid Solution of Integral Equations of Scattering Theory , 1990 .

[9]  F. X. Canning,et al.  Transformations that Produce a Sparse Moment Method Matrix , 1990 .

[10]  R. Saleh.  FastCap : A Multipole Accelerated 3-D Capacitance Extraction Program , 1991 .

[11]  A. Brandt.  Multilevel computations of integral transforms and particle interactions with oscillatory kernels , 1991 .

[12]  Christopher R. Anderson,et al.  An Implementation of the Fast Multipole Method without Multipoles , 1992, SIAM J. Sci. Comput..

[13]  C. Loan.  Computational Frameworks for the Fast Fourier Transform , 1992 .

[14]  B. Engquist,et al.  Multigrid methods for differential equations with highly oscillatory coefficients , 1993 .

[15]  Kenneth Brackenridge,et al.  Multigrid and cyclic reduction applied to the Helmholtz equation , 1993 .

[16]  V. Rokhlin.  Diagonal Forms of Translation Operators for the Helmholtz Equation in Three Dimensions , 1993 .

[17]  Weng Cho Chew,et al.  Fast algorithm for solving hybrid integral equations , 1993 .

[18]  Frank Thomson Leighton,et al.  Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory , 1994, SIAM J. Sci. Comput..

[19]  J. R. Phillips,et al.  A precorrected-FFT method for capacitance extraction of complicated 3-D structures , 1994, ICCAD '94.

[20]  Jacob K. White,et al.  Comparing precorrected-FFT and fast multipole algorithms for solving three-dimensional potential integral equations , 1994 .

[21]  C. Leonard Berman.  Grid-Multipole Calculations , 1995, SIAM J. Sci. Comput..