Parallel Iterative Methods (PIM) Package <description><url>http://www.mat.ufrgs.br/pim-e.html</url> <abstract> PIM is a collection of Fortran routines designed to solve systems of linear equations (SLEs) on parallel computers using iterative methods. 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. <keywords>parallel numerical library; iterative method; conjugate gradient method; sparse linear systems <category>numerical-linalg <environment> 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. <author>Rudnei Dias da Cunha / rdd@ukc.ac.uk Tim Hopkins / trh@ukc.ac.uk </urc>

ftp://unix.hensa.ac.uk/misc/netlib/pim/pim20.tar.Z Parallel Iterative Methods (PIM) Package <description><url>http://www.mat.ufrgs.br/pim-e.html</url> <abstract> PIM is a collection of Fortran routines designed to solve systems of linear equations (SLEs) on parallel computers using iterative methods. 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. <keywords>parallel numerical library; iterative method; conjugate gradient method; sparse linear systems <category>numerical-linalg <environment> 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. <author>Rudnei Dias da Cunha / rdd@ukc.ac.uk Tim Hopkins / trh@ukc.ac.uk </urc>