Newsgroups: comp.parallel.pvm
From: am4a012@math.uni-hamburg.de (Thomas Schroeder)
Subject: PIM (Parallel Iterative Methods) under PVM
Summary: About the PIM package
Keywords: PIM
Organization: University of Hamburg, Germany
Date: 8 Sep 1994 13:14:11 GMT
Message-ID: <34n2n3$8lv@rzsun02.rrz.uni-hamburg.de>

To: marisa@ac.upc.es

Hi Marisa.

You ask about PIM.

<Thomas,
<I'm going to work on PVM and I'm wondering if you could send me information 
<about PIM. I haven't heard anything about it. What is it?

<Thanks in advance.

<Marisa Gil


PIM means 'Parallel Iterative Methods' and is a package to solve 
systems of linear equations by iterative methods (e.g. CG, BiCG, 
GMRES, ...). The programs work in sequential mode and in parallel mode
 on different architectures like PVM, p4, TCGMSG.

Here is the readme-file of the package:

PIM 1.1  
Parallel Iterative Methods package for Systems of Linear Equations  
(Fortran 77 version) 
------------------------------------------------------------------------------

Rudnei Dias da Cunha 
  Centro de Processamento de Dados, Universidade Federal do Rio Grande do Sul,
    Brasil
  Computing Laboratory, University of Kent at Canterbury, United Kingdom

Tim Hopkins 
  Computing Laboratory, University of Kent at Canterbury, United Kingdom
 
--

INTRODUCTION
The Parallel Iterative Methods (PIM) is a collection of Fortran routines
designed to solve systems of linear equations (SLEs) on parallel computers
using iterative methods.

PIM offers a number of iterative methods, including 
  - Conjugate-Gradients (CG), 
  - Bi-Conjugate-Gradients (Bi-CG), 
  - Conjugate-Gradients squared (CGS),
  - The stabilised version of Bi-Conjugate-Gradients (Bi-CGSTAB),
  - Generalised minimal residual (GMRES),
  - Generalised conjugate residual (GCR),
  - Conjugate-Gradients for normal equations with minimisation of the
    residual norm (CGNR),
  - Conjugate-Gradients for normal equations with minimisation of the
    error norm (CGNE), and
  - Transpose-free quasi-minimal residual (TFQMR).

The routines allow the use of preconditioners; the user may choose to use
left-, right- or symmetric-preconditioning. Several stopping criteria can also
be chosen.

PIM was developed with two main goals
  1. To allow the user complete freedom with respect to the matrix storage,
access and partitioning; 
  2. To achieve portability across a variety of parallel architectures
and programming environments. 

These goals are achieved by hiding from the PIM routines the specific details
concerning the computation of the following three linear algebra operations
  1. Matrix-vector (and transpose-matrix-vector) product 
  2. Preconditioning step 
  3. Inner-product and vector norm 

PIM has been tested on networks of workstations using PVM 3.1, p4 1.2, 
TCGMSG 4.02, on the Intel Paragon using the NX library and on the 
Cray Y-MP2E/233.
...

COMMENTS/SUGGESTIONS
The authors can be contacted via e-mail at either rdd@ukc.ac.uk or trh@ukc.ac.uk

The program is available from unix.hensa.ac.uk (129.12.43.16) file /misc/netlib/pim/pim.tar.Z 

Bye
Thomas

=====================================================
  Thomas Schroeder   tschroeder@math.uni-hamburg.de
  Kanalstrasse 6
  D-22085 Hamburg
  Germany            Tel.(priv.) 0049-40-2296149
=====================================================


