A multipole based treecode using spherical harmonics for potentials of the form r(-lambda) Conference Paper uri icon

abstract

  • In this paper we describe an efficient algorithm for computing the potentials of the form r- where 1. This treecode algorithm uses spherical harmonics to compute multipole coefficients that are used to evaluate these potentials. The key idea in this algorithm is the use of Gegenbauer polynomials to represent r- in a manner analogous to the use of Legendre polynomials for the expansion of the Coulomb potential r-1. We exploit the relationship between Gegenbauer and Legendre polynomials to come up with a natural generalization of the multipole expansion theorem used in the classical fast multipole algorithm [2]. This theorem is used with a hierarchical scheme to compute the potentials. The resulting algorithm has known error bounds and can be easily implemented with modification to the existing fast multipole algorithm. The complexity of the algorithm is O(p3N log N) and has several advantages over the existing Cartesian coordinates based expansion schemes. Springer-Verlag Berlin Heidelberg 2005.

published proceedings

  • COMPUTATIONAL SCIENCE - ICCS 2005, PT 1, PROCEEDINGS

author list (cited authors)

  • Kasthuri, S., Mahawar, H., & Sarin, V.

citation count

  • 5

complete list of authors

  • Kasthuri, S||Mahawar, H||Sarin, V

publication date

  • October 2005