Skip to main content

An Automatic Learning System to Derive Multipole and Local Expansions for the Fast Multipole Method

  • Conference paper
  • 2156 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7332))

Abstract

This paper introduces an automatic learning method based on genetic programming to derive local and multipole expansions required by the Fast Multipole Method (FMM). FMM is a well-known approximation method widely used in the field of computational physics, which was first developed to approximately evaluate the product of particular N ×N dense matrices with a vector in O(N log N) operations. Later, it was applied successfully in many scientific fields such as simulation of physical systems, Computer Graphics and Molecular dynamics. However, FMM relies on the analytical expansions of the underlying kernel function defining the interactions between particles, which are not always obvious to derive. This is a major factor limiting the application of the FMM to many interesting problems. Thus, the proposed method here can be regarded as a useful tool helping practitioners to apply FMM to their own problems such as agent-based simulation of large complex systems. The preliminary results of the implemented system are very promising, and so we hope that the proposed method can be applied to other problems in different application domains.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rokhlin, V.: Rapid solution of integral equations of classical potential theory. Journal of Computational Physics 60(2), 187–207 (1983)

    Article  MathSciNet  Google Scholar 

  2. Greengard, L., Rokhlin, V.: A fast algorithm for particle simulations. Journal of Computational Physics 73(2), 325–348 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  3. Greengard, L., Rokhlin, V.: Rapid evaluation of potential fields in three dimensions. Lecture Notes in Mathematics. Springer, Berlin (1988)

    Google Scholar 

  4. Dongarra, J., Sullivan, F.: The top ten algorithms of the century 2(1), 22–23 (2000)

    Google Scholar 

  5. Hanrahan, P., Salzman, D., Aupperle, L.: A rapid hierarchical radiosity algorithm. In: SIGGRAPH (1991)

    Google Scholar 

  6. Singh, J.P., et al.: Load balancing and data locality in hierarchical N-body methods. Journal of Parallel and Distributed Computing (1992)

    Google Scholar 

  7. Razavi, S.N., et al.: Multi-agent based simulations using fast multipole method: application to large scale simulations of flocking dynamical systems. Artificial Intelligence Review 35(1), 53–72 (2011)

    Article  MathSciNet  Google Scholar 

  8. Razavi, S.N., et al.: Automatic Dynamics Simplification in Fast Multipole Method: Application to Large Flocking Systems. To be Published in the Journal of Supercomputing (2012)

    Google Scholar 

  9. Ying, L.: A kernel independent fast multipole algorithm for radial basis functions. Journal of Computational Physics 213(2), 451–457 (2006)

    Article  MATH  Google Scholar 

  10. Martinsson, P.G., Rokhlin, V.: An Accelerated Kernel-Independent Fast Multipole Method in One Dimension. SIAM Journal on Scientific Computing 29(3), 1160–1178 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Zhang, B., et al.: A Fourier-series-based kernel-independent fast multipole method. Journal of Computational Physics 230(15), 5807–5821 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. Greengard, L.: The Rapid Evaluation of Potential Fields in Particle Systems. ACM Press (1987)

    Google Scholar 

  13. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  14. Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guide to Genetic Programming (2008)

    Google Scholar 

  15. McPhee, N.F., Poli, R.: Using schema theory to explore interactions of multiple operators. In: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference. Morgan Kaufmann Publishers, New York (2002)

    Google Scholar 

  16. Eiben, A.E., Smith, J.E.: Introduction to evolutionary computing, 1st edn. Natural Computing Series. Springer (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Razavi, S.N., Gaud, N., Koukam, A., Mozayani, N. (2012). An Automatic Learning System to Derive Multipole and Local Expansions for the Fast Multipole Method. In: Tan, Y., Shi, Y., Ji, Z. (eds) Advances in Swarm Intelligence. ICSI 2012. Lecture Notes in Computer Science, vol 7332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31020-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31020-1_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31019-5

  • Online ISBN: 978-3-642-31020-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics