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

In this paper a parallel shared memory Java multithreaded design and implementation of the explicit approximate inverse preconditioning is presented for solving efficiently arrow-type linear systems on symmetric multiprocessor systems. A new parallel algorithm for computing a class of optimized appr...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematics and computation Vol. 190; no. 1; pp. 255 - 270
Main Authors Gravvanis, George A., Epitropou, Victor N., Giannoutakis, Konstantinos M.
Format Journal Article
LanguageEnglish
Published New York, NY Elsevier Inc 01.07.2007
Elsevier
Subjects
Online AccessGet full text
ISSN0096-3003
1873-5649
DOI10.1016/j.amc.2007.01.024

Cover

More Information
Summary:In this paper a parallel shared memory Java multithreaded design and implementation of the explicit approximate inverse preconditioning is presented for solving efficiently arrow-type 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.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2007.01.024