Parallel Preconditioning with Sparse Approximate Inverses
SIAM Journal on Scientific Computing
A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
SIAM Journal on Scientific Computing
Three-dimensional elasto-static analysis of 100 million degrees of freedom
Advances in Engineering Software
MSP: A Class of Parallel Multistep Successive Sparse Approximate Inverse Preconditioning Strategies
SIAM Journal on Scientific Computing
GeoFEM: High Performance Parallel FEM for Solid Earth
HPCN Europe '99 Proceedings of the 7th International Conference on High-Performance Computing and Networking
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Parallel SSOR preconditioning implemented on dynamic SMP clusters with communication on the fly
Future Generation Computer Systems
Hi-index | 0.00 |
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.