Back to search

Georgia Institute of Technology

Optimal partitions for the fast multipole method

Abstract

dc:description.abstract

The fast multipole method is an algorithm first developed to approximately solve the N-body problem in linear time. Part of the FMM involves recursively partitioning a region of source points into cells. Insight from studying lattices and covering problems leads to new, more efficient partitions for the FMM. New partitions are designed to reduce near-field and far-field calculations. Results from simulations show significant computation time reduction with little to no additional error in many cases.

Degree

thesis:*
Level thesis:degree_level
Masters
Department dc:contributor.department
Electrical and Computer Engineering
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wong, Lok S.
Advisor dc:contributor.advisor
  • Barnes, Christopher F.
Committee members dc:contributor.committeemember
  • Romberg, Justin
  • Lanterman, Aaron

Subjects

dc:subject × 2

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1853/56360

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Wong, Lok S.. Optimal partitions for the fast multipole method. Masters thesis, Georgia Institute of Technology, 2016. http://hdl.handle.net/1853/56360