Loading...
Please wait, while we are loading the content...
Similar Documents
Parallel threshold-based ILU factorization
| Content Provider | CiteSeerX |
|---|---|
| Author | Karypis, George Kumar, Vipin |
| Abstract | Factorization algorithms based on threshold incomplete LU factorization have been found to be quite effective in preconditioning iterative system solvers. However, their parallel formulations have not been well understood and they have been considered to be unsuitable for distributed memory parallel computers. In this paper we present a highly parallel formulation of such factorization algorithms. Our algorithm utilizes parallel multilevel k-way partitioning and independent set computation algorithms to effectively parallelize both the factorization as well as the solution of the resulting triangular systems, used in the application of the preconditioner. Our experiments on Cray T3D show that significant speedup can be achieved in both operations; thus, allowing threshold incomplete factorizations to be successfully used as preconditioners in parallel iterative solvers for sparse linear systems. 1 |
| File Format | |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Parallel Threshold-based Ilu Factorization Parallel Formulation Factorization Algorithm Parallel Iterative Solver Iterative System Solver Distributed Memory Parallel Computer Significant Speedup Threshold Incomplete Factorization Sparse Linear System Independent Set Computation Algorithm Parallel Multilevel K-way Partitioning Cray T3d Triangular System Threshold Incomplete Lu Factorization |
| Content Type | Text |
| Resource Type | Technical Report |
