Fast Multipole-Based Preconditioner for Sparse Iterative Solvers

Handle URI:
http://hdl.handle.net/10754/624937
Title:
Fast Multipole-Based Preconditioner for Sparse Iterative Solvers
Authors:
Ibeid, Huda ( 0000-0001-5208-5366 ) ; Yokota, Rio ( 0000-0001-7573-7873 ) ; Keyes, David E. ( 0000-0002-4052-7224 )
Abstract:
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxed global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, it is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity architecture supercomputers.
KAUST Department:
Computer, Electrical and Mathematical Sciences & Engineering (CEMSE)
Conference/Event name:
SHAXC-2 Workshop 2014
Issue Date:
4-May-2014
Type:
Poster
Appears in Collections:
Posters; Scalable Hierarchical Algorithms for eXtreme Computing (SHAXC-2) Workshop 2014

Full metadata record

DC FieldValue Language
dc.contributor.authorIbeid, Hudaen
dc.contributor.authorYokota, Rioen
dc.contributor.authorKeyes, David E.en
dc.date.accessioned2017-06-12T10:24:00Z-
dc.date.available2017-06-12T10:24:00Z-
dc.date.issued2014-05-04-
dc.identifier.urihttp://hdl.handle.net/10754/624937-
dc.description.abstractAmong optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxed global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, it is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity architecture supercomputers.en
dc.titleFast Multipole-Based Preconditioner for Sparse Iterative Solversen
dc.typePosteren
dc.contributor.departmentComputer, Electrical and Mathematical Sciences & Engineering (CEMSE)en
dc.conference.dateMay 4-6, 2014en
dc.conference.nameSHAXC-2 Workshop 2014en
dc.conference.locationKAUSTen
kaust.authorIbeid, Hudaen
kaust.authorYokota, Rioen
kaust.authorKeyes, David E.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.