Abstract
There 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.
| Original language | English (US) |
|---|---|
| Title of host publication | Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing |
| Publisher | Springer Nature |
| Pages | 267-286 |
| Number of pages | 20 |
| ISBN (Print) | 9783319624242 |
| DOIs | |
| State | Published - Oct 4 2017 |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01Acknowledged KAUST grant number(s): KUK-C1-013-04
Acknowledgements: We 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.