On the performance of parallel approximate inverse preconditioning using Java multithreading techniques

George A. Gravvanis

doi:10.1016/j.amc.2007.01.024

2007-07-01

PRE

George A. Gravvanis *

Victor N. Epitropou

Konstantinos M. Giannoutakis

DOI：10.1016/j.amc.2007.01.024

原文链接

原文求助

摘要

En 中文

In this paper a parallel shared memory Java multithreaded design and implementation of the explicit approximate inverse preconditioning is presented for solving efficiently arrow-typc linear systems on symmetric multiprocessor systems. A new parallel algorithm for computing a class of optimized approximate inverse matrix is introduced. The performance on a symmetric multiprocessor system, using Java multithreading, is investigated by solving characteristic arrow-type linear systems and numerical results are given, considering the parallel performance of the construction of the optimized approximate inverse and the explicit preconditioned generalized conjugate gradient square scheme. (C) 2007 Elsevier Inc. All rights reserved.

Keyword:

arrow-type matrix

parallel approximate inverse matrix algorithm

preconditioning

parallel conjugate gradient type methods

object oriented methodology

Java multithreading

symmetric multiprocessor systems