Efficient scalable algorithms for hierarchically semiseparable matrices [electronic resource].
- Berkeley, Calif. : Lawrence Berkeley National Laboratory, 2011. and Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy.
- Physical Description:
- 21 : digital, PDF file
- Additional Creators:
- Lawrence Berkeley National Laboratory and United States. Department of Energy. Office of Scientific and Technical Information
- Restrictions on Access:
- Free-to-read Unrestricted online access
- Hierarchically semiseparable (HSS) matrix algorithms are emerging techniques in constructing the superfast direct solvers for both dense and sparse linear systems. Here, we develope a set of novel parallel algorithms for the key HSS operations that are used for solving large linear systems. These include the parallel rank-revealing QR factorization, the HSS constructions with hierarchical compression, the ULV HSS factorization, and the HSS solutions. The HSS tree based parallelism is fully exploited at the coarse level. The BLACS and ScaLAPACK libraries are used to facilitate the parallel dense kernel operations at the ne-grained level. We have appplied our new parallel HSS-embedded multifrontal solver to the anisotropic Helmholtz equations for seismic imaging, and were able to solve a linear system with 6.4 billion unknowns using 4096 processors, in about 20 minutes. The classical multifrontal solver simply failed due to high demand of memory. To our knowledge, this is the first successful demonstration of employing the HSS algorithms in solving the truly large-scale real-world problems. Our parallel strategies can be easily adapted to the parallelization of the other rank structured methods.
- Published through SciTech Connect., 09/14/2011., "lbnl-5238e", SIAM J. Scientific Computing FT, Wang, Shen; Xia, Jianlin; Situ, Yingchong; Hoop, Maarten V. de., and Computational Research Division
- Funding Information:
View MARC record | catkey: 13831480