𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast algorithm for three-dimensional electrostatics analysis: fast Fourier transform on multipoles (FFTM)

✍ Scribed by E. T. Ong; K. H. Lee; K. M. Lim

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
715 KB
Volume
61
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fast algorithm for investigations on t
A fast algorithm for investigations on the three-dimensional Ising model
✍ Michael Creutz; P. Mitra; K.J.M. Moriarty πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 400 KB

## Nature of the physical problem Program available from: CPC Program Library, Queen's Uni- We wish to study the critical temperature and critical expoversity of Belfast, N. Ireland (see application form

Rotating a three-dimensional array in an
Rotating a three-dimensional array in an optimal position for vector processing: case study for a three-dimensional fast Fourier transform
✍ S. Goedecker πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 399 KB

We show, that a three-dimensional array of dimension n 1. n,, 113 can he rotated in such a way, that all the innermost loops have lengths, which are products of two dimensions, i.e. n1n,, n1n3, n,n3. This technique is then applied to rotate a parallelepiped of data in an optimal position for Fourier

Multilevel fast multipole algorithm for
Multilevel fast multipole algorithm for three-dimensional dielectric targets in the vicinity of a lossy half space
✍ Jiangqi He; Anders Sullivan; Lawrence Carin πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 130 KB πŸ‘ 1 views

## Abstract The multilevel fast multipole algorithm (MLFMA) is applied to the problem of a general three‐dimensional dielectric target above or below a lossy half space. The dyadic half‐space Green's function is evaluated rigorously for the β€œnear” MLFMA interactions, while an asymptotic Green's fun