Today : Tue, Dec 12 2017 .


Fast Multipole Methods (CTP)


References:

  • Strain, John Fast potential theory. II. Layer potentials and discrete sums. J. Comput. Phys. 99 (1992), no. 2, 251--270.
  • Gu, Ming; Eisenstat, Stanley C. A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. 16 (1995), no. 1, 172--191.
  • Rokhlin, Vladimir and Mark Tygert, "Fast algorithms for spherical harmonic expansions," SIAM Journal on Scientific Computing, 27 (6): 1903-1928, 2006.
  • Tygert, Mark, "Recurrence relations and fast algorithms," Technical Report 1343, Yale University, Department of Computer Science, December 2005.
  • Mark Tygert, "Fast algorithms for spherical harmonic expansions, II," Technical Report 1381, Yale University, Department of Computer Science, May 2007.
  • Michael O'Neal and Vladimir Rokhlin "A new class of analysis-based fast transforms" Technical Report 1384, Yale University, Department of Computer Science, August 2007.

This site has been visited 6941 times. Page: Main.T-FastAlgo - Last Modified : Tue, Oct 28 2008

NSF-National Science Foundation DOE-US Dept of Energy

Maintained by Jun Jia, Bo Zhang, and Jingfang Huang
Copyright 2008 FastMultipole.org