journal article·2005-04

The mean field plus approximation

T.R. Koehler

Publisher page

Abstract

Abstract A new algorithm for approximating the energy and fields between clusters of spatially distinct particles will be described. The case where the particles are magnetic grains will be the focus, but the method is more broadly applicable. This approximation accomplishes the same task as multipole expansions for computing cluster–cluster interactions, but it seems to be both faster and more accurate. It can be viewed as a generalization of a certain mean field approximation and so will be called the mean field plus approximation. The lowest-order version of the approximation will be described first and then a systematic way to improve the approximation will be given. Results of numerical experiments comparing the computational time and accuracy for the mean field approximation, the multipole expansion and the mean field plus approximation will be given.
Source: openaire · Quality: candidate unverified · Source record ↗

Research context

OpenAlex topics: Electromagnetic Scattering and Analysis · Geomagnetism and Paleomagnetism Studies · Characterization and Applications of Magnetic Nanoparticles

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

References (3)

Show source-provided references
1. A short course on fast multipole methods
2. Fredkin · IEEE Trans. Magn. · 1988 · 24 · 236210.1109/20.92110 ↗
3. Forster · IEEE Trans. Magn. · 2003 · 39 · 251310.1109/TMAG.2003.816458 ↗