The parallelization of the incomplete LU factorization on AP1000

Takashi Nodera, Naoto Tsuno

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Using a finite difference method to discretize a two dimensional elliptic boundary value problem, we obtain systems of linear equations Ax = b, where the coefficient matrix A is a large, sparse, and nonsingular. These systems are often solved by preconditioned iterative methods. This paper presents a data distribution and a communication scheme for the parallelization of the preconditioner based on the incomplete LU factorization. At last, parallel performance tests of the preconditioner, using BiCGStab(ℓ) and GMRES (m) method, are carried out on a distributed memory parallel machine AP1000. The numerical results show that the preconditioner based on the incomplete LU factorization can be used even for MIMD parallel machines.

Original languageEnglish
Title of host publicationEuro-Par 1998 Parallel Processing - 4th International Conference, Proceedings
Pages788-792
Number of pages5
Publication statusPublished - 1998 Dec 1
Event4th International Conference on Parallel Processing, Euro-Par 1998 - Southampton, United Kingdom
Duration: 1998 Sept 11998 Sept 4

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1470 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Conference on Parallel Processing, Euro-Par 1998
Country/TerritoryUnited Kingdom
CitySouthampton
Period98/9/198/9/4

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'The parallelization of the incomplete LU factorization on AP1000'. Together they form a unique fingerprint.

Cite this