Abstract
We investigate and compare a few parallel preconditioning techniques in the iterative solution of large sparse linear systems arising from solid Earth simulation with and without using contact information in the domain partitioning process. Previous studies are focused on using static or matrix pattern-based incomplete LU (ILU) preconditioners in a localized preconditioner implementation. Our current studies are concerned about preconditioner performance for solving two different problem configurations with and without known contact information. For the cases with contact information, we use localized threshold value-based ILU (ILUT) preconditioner to improve efficiency. For the cases without contact information, we use a global sparse approximate inverse preconditioner with a static sparsity pattern to achieve robustness. Numerical results from simulating ground motion on a parallel supercomputer are given to compare the effectiveness of these parallel preconditioning techniques.
| Original language | English |
|---|---|
| Pages (from-to) | 443-456 |
| Number of pages | 14 |
| Journal | Future Generation Computer Systems |
| Volume | 19 |
| Issue number | 4 |
| DOIs | |
| State | Published - May 2003 |
| Event | CCGrid 2002 - Berlin, Germany Duration: May 21 2002 → May 24 2002 |
Bibliographical note
Funding Information:This research work was supported in part by the Japanese Research Organization for Information Science and Technology (RIST), in part by the US National Science Foundation under grants CCR-9902022, CCR-9988165, CCR-0092532, and ACI-0202934, in part by the US Department of Energy under grant DE-FG02-02ER45961, and in part by the University of Kentucky Research Committee.
Keywords
- Fault contact problem
- Preconditioning techniques
- Solid Earth simulation
- Sparse matrices
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications