Show simple item record

dc.contributor.advisorBarnes, Christopher
dc.contributor.authorWong, Lok S.
dc.date.accessioned2017-01-11T14:06:04Z
dc.date.available2017-01-11T14:06:04Z
dc.date.created2016-12
dc.date.issued2016-12-09
dc.date.submittedDecember 2016
dc.identifier.urihttp://hdl.handle.net/1853/56360
dc.description.abstractThe 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.
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherGeorgia Institute of Technology
dc.subjectFast multipole method
dc.subjectPartition
dc.titleOptimal partitions for the fast multipole method
dc.typeThesis
dc.description.degreeM.S.
dc.contributor.departmentElectrical and Computer Engineering
thesis.degree.levelMasters
dc.contributor.committeeMemberRomberg, Justin
dc.contributor.committeeMemberLanterman, Aaron
dc.date.updated2017-01-11T14:06:04Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record