Fast N‐Body Methods: Why, What, and Which

Skeel, Robert D.

doi:doi:10.1063/1.3498450

Volume/Page
Keyword
Citation
Advanced

Volume: Page/Article:

Search Content Type

Citation:

AIP Conference Proceedings / Volume 1281

Previous Article | Next Article

LOG IN or SELECT A PURCHASE OPTION:

Buy PDF

Rent Article

Permissions / Reprints

Fast N‐Body Methods: Why, What, and Which

AIP Conf. Proc. 1281, pp. 27-30; doi:http://dx.doi.org/10.1063/1.3498450 (4 pages)

ICNAAM 2010: International Conference of Numerical Analysis and Applied Mathematics 2010

Date: 19–25 September 2010

Location: Rhodes (Greece)

Robert D. Skeel

Dept. of Computer Science, Purdue Univ., 305 N. University St., West Lafayette, Indiana 47907‐2107, USA

Alerts
- Alert Me When Cited
- Alert Me When Corrected
Tools
Share
- Email Abstract
- Connotea
- CiteULike
- del.icio.us
- BibSonomy
- Tweet this Article
- Add to Facebook

Abstract

Citing Articles (5)

Related Content

Why do they matter? Applications abound, even to the extent that fast N‐body methods merit a place in the core of numerical analysis. Why are they fast? The basis for all fast N‐body solvers is (i) a separable approximation for a pairwise interaction kernel and (ii) exploitation of the associativity (and distributivity) of linear transformations. What are the various N‐body methods? Kernel splitting and hierarchical clustering are the two fundamental paradigms. Which is the best N‐body method? For molecular biophysics and structural biology, multilevel summation is suggested.

KEYWORDS and PACS

Keywords

numerical analysis, quadrupole moments, mathematical operators, partial differential equations

PACS

02.60.Lj

Ordinary and partial differential equations; boundary value problems
33.15.Kr

Electric and magnetic moments (and derivatives), polarizability, and magnetic susceptibility
02.30.Tb

Operator theory
02.30.Jr

Partial differential equations