The ADIFOR 2.0 automatic differentiation system is now available.
We are proud to mention that ADIFOR 2.0 recently won the 1995 Wilkinson
Prize for Numerical Software at the Int. Conf. on Industrial and Applied
Mathematics (ICIAM 95) in Hamburg, Germany.

To find out more about ADIFOR, in particular how to obtain the ADIFOR 2.0
system or documentation and reports pertaining to it, visit the ADIFOR web
sites at
http://www.mcs.anl.gov/adifor
or
http://www.cs.rice.edu/~adifor (note the tilde!)

ADIFOR is not in the public domain, but it is available for non-commercial
use or evaluation for commercial purposes free of charge.

The ADIFOR 2.0 system is a tool for the automatic differentiation of
Fortran 77 programs. Given a Fortran 77 source code and a user's
specification of dependent and independent variables, ADIFOR will generate
an augmented derivative code that computes the partial derivatives of all
of the specified dependent variables with respect to all of the specified
independent variables in addition to the original result.

Matrix re-ordering strategies are important in connection with direct
solution methods for sparse equations; e.g. /1/. What about matrix
re-ordering in connection with ILU-based iterative methods? I would be
interested to know of studies comparing the effectiveness of various
matrix orderings for the (non-symmetric) ILU-CG solution of sparse
systems. I am particularly interested in systems that come from the
discretization of an advection-diffusion equation.
/1/ I. S. Duff, A. M. Erisman and J. K. Reid: Direct Methods for Sparse
Matrices, Clarendon Press, Oxford, 1986.
-- Bas Braams (braams@cims.nyu.edu)

This is the fourth annual SCOTTISH COMPUTATIONAL MATHEMATICS SYMPOSIUM
organised by D.B. Duncan (Heriot-Watt University) and D.M. Sloan
(University of Strathclyde) with the aim of bringing together
mathematicians and others who develop and/or use computer algorithms to
solve mathematical problems. The meetings are open to everyone
interested and this one is supported by a grant from the London
Mathematical Society.

SPEAKERS

* M. Berzins (University of Leeds)
"Adaptive Solution Methods for Combustion and Atmospheric
Dispersion Problems using the Method of Lines"

Please register as soon as possible (deadline September 8th) by sending
a cheque for 20 pounds (15 for students) payable to Heriot-Watt
University. Include your address so that we can contact you. The fee
includes tea, coffee and lunch.

A Postdoctoral Associate position is available to work on a project
related to parallel sparse matrix computations. Applicants must have
a strong background in numerical linear algebra. Good knowledge of
partial differential equations, domain decomposition techniques,
sparse matrix techniques, and iterative methods, is desirable. A
Ph.D. in Computer Science or related field is required as well as an
extensive experience in parallel programming.

The project, supported by ARPA, involves the development of a library
for sparse matrix computations called P_SPARSLIB. A first version of
the library is currently available and part of the work consists of
adding functionality to the library, as well as improving performance
on specific platforms.

The university of Minnesota provides a state-of-the-art environment
for supercomputing and parallel computing. In addition to hardware
available to U of M researchers at the Minnesota Supercomputer Center,
the department of Computer Science also houses a cluster of SGI
workstations and a cluster of IBM workstations and is soon to receive
an IBM SP2.