.png){kind=icon}
.png){kind=icon}
Return
High Performance Inverse Preconditioning
.png){kind=icon}
PRE
AI
DOI：10.1007/s11831-008-9026-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The derivation of parallel numerical algorithms for solving sparse linear systems on modern computer systems and software platforms has attracted the attention of many researchers over the years. In this paper we present an overview on the design issues of parallel approximate inverse matrix algorithms, based on an anti-diagonal wave pattern approach and a fish-bone computational procedure, for computing explicitly various families of exact and approximate inverses for solving sparse linear systems. Parallel preconditioned conjugate gradient-type schemes in conjunction with parallel approximate inverses are presented for the efficient solution of sparse linear systems. Applications of the proposed parallel methods by solving characteristic sparse linear systems on symmetric multiprocessor systems and distributed systems are discussed and the parallel performance of the proposed schemes is given, using MPI, OpenMP and Java multithreading.
Keywords:
BOUNDARY-VALUE-PROBLEMS
ITERATIVE METHODS
LINEAR-SYSTEMS
APPROXIMATE
MATRIX
EIGENVALUES
ALGORITHMS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12.1
Papers:
1.8K
Citations:
1.2W
Organization
No organization information available