An O(N) Method for Rapidly Computing Periodic Potentials Using Accelerated Cartesian Expansions

Physics – Computational Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

39 pages, 3 figures

Scientific paper

The evaluation of long-range potentials in periodic, many-body systems arises as a necessary step in the numerical modeling of a multitude of interesting physical problems. Direct evaluation of these potentials requires O(N^2) operations and O(N^2) storage, where N is the number of interacting bodies. In this work, we present a method, which requires O(N) operations and O(N) storage, for the evaluation of periodic Helmholtz, Coulomb, and Yukawa potentials with periodicity in 1-, 2-, and 3-dimensions, using the method of Accelerated Cartesian Expansions (ACE). We present all aspects necessary to effect this acceleration within the framework of ACE including the necessary translation operators, and appropriately modifying the hierarchical computational algorithm. We also present several results that validate the efficacy of this method with respect to both error convergence and cost scaling, and derive error bounds for one exemplary potential.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An O(N) Method for Rapidly Computing Periodic Potentials Using Accelerated Cartesian Expansions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An O(N) Method for Rapidly Computing Periodic Potentials Using Accelerated Cartesian Expansions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An O(N) Method for Rapidly Computing Periodic Potentials Using Accelerated Cartesian Expansions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-226393

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.