Show simple item record

dc.contributor.authorYokota, Rio
dc.contributor.authorIbeid, Huda
dc.contributor.authorKeyes, David E.
dc.date.accessioned2018-02-19T09:56:36Z
dc.date.available2018-02-19T09:56:36Z
dc.date.issued2017-10-04
dc.identifier.citationYokota R, Ibeid H, Keyes D (2017) Fast Multipole Method as a Matrix-Free Hierarchical Low-Rank Approximation. Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing: 267–286. Available: http://dx.doi.org/10.1007/978-3-319-62426-6_17.
dc.identifier.issn1439-7358
dc.identifier.issn2197-7100
dc.identifier.doi10.1007/978-3-319-62426-6_17
dc.identifier.urihttp://hdl.handle.net/10754/627144
dc.description.abstractThere has been a large increase in the amount of work on hierarchical low-rank approximation methods, where the interest is shared by multiple communities that previously did not intersect. This objective of this article is two-fold; to provide a thorough review of the recent advancements in this field from both analytical and algebraic perspectives, and to present a comparative benchmark of two highly optimized implementations of contrasting methods for some simple yet representative test cases. The first half of this paper has the form of a survey paper, to achieve the former objective. We categorize the recent advances in this field from the perspective of compute-memory tradeoff, which has not been considered in much detail in this area. Benchmark tests reveal that there is a large difference in the memory consumption and performance between the different methods.
dc.description.sponsorshipWe thank François-Henry Rouet, Pieter Ghysels, and Xiaoye, S. Li for providing the STRUMPACK interface for our comparisons between FMM and HSS. This work was supported by JSPS KAKENHI Grant-in-Aid for Research Activity Start-up Grant Number 15H06196. This publication was based on work supported in part by Award No KUK-C1-013-04, made by King Abdullah University of Science and Technology (KAUST). This work used the Extreme Science and Engineering Discovery Environment (XSEDE), which is supported by National Science Foundation grant number OCI-1053575.
dc.publisherSpringer Nature
dc.relation.urlhttps://link.springer.com/chapter/10.1007%2F978-3-319-62426-6_17
dc.rightsThe final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-62426-6_17
dc.titleFast Multipole Method as a Matrix-Free Hierarchical Low-Rank Approximation
dc.typeConference Paper
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentComputer Science Program
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentExtreme Computing Research Center
dc.identifier.journalEigenvalue Problems: Algorithms, Software and Applications in Petascale Computing
dc.conference.date2015-09-14 to 2015-09-16
dc.conference.name1st InternationalWorkshop on Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing, EPASA 2015
dc.conference.locationTsukuba, JPN
dc.eprint.versionPost-print
dc.contributor.institutionTokyo Institute of Technology, 2-12-1 O-okayama Meguro-ku, Tokyo, , Japan
dc.identifier.arxivid1602.02244
kaust.personIbeid, Huda
kaust.personKeyes, David E.
kaust.grant.numberKUK-C1-013-04
refterms.dateFOA2018-10-04T00:00:00Z
dc.date.published-online2017-10-04
dc.date.published-print2017


Files in this item

Thumbnail
Name:
revision.pdf
Size:
953.1Kb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record