An automatic learning system to derive multipole and local expansions for the fast multipole method

0Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7332 LNCS, pp. 1–10). https://doi.org/10.1007/978-3-642-31020-1_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free