[Ed. note: Sorry, I erred in the Subject line for these two submissions
last week. -- Cleve]

Many thanks for putting my two submissions onto the na.digest about
lectureships and a studentship in UMIST.

Unfortunately, you altered "UMIST" in my subject heading to "University
of Manchester". I know that it is confusing, but UMIST is not the
same thing (indeed is now completely different from) the University
of Manchester. It is clearly too late now to change anything on the
e-mailed digest, but I wonder if you could correct the version that
is made available on the WWW. I'll try to make sure that the difference
is made clearer in any future submission.

Baltzer Science Publishers are pleased to announce the creation of our new
Homepage site on the World Wide Web at: http://www.nl.net/~baltzer/

The homepage provides full details of all our journals together with
ordering information, author instructions and a copy of the Baltzer Style
File for use by authors. There are also links to other useful sites.

Material covered includes a chapter on parallel computing in general,
2 chapters on sequential methods for ordinary differential equations,
a large chapter on parallel linear algebra methods, 2 chapters on parallel
methods for odes including delay equations and partial differential equations
and 3 chapters on waveform relaxation techniques including one on the parallel
implementation of a waveform relaxation code.

The book can be read by third year and graduate students in the field of
computational science, mathematics or engineering and is aimed at the research
community in not only ordinary differential equations but scientific
computing in general.

More information on this book including the Preface and table of contents as
well as recent papes by K. Burrage on this subject and others can be found
via the WWW at the URL

Hi, I was wondering if anyone familiar with shortest path problems
(Dijkstra, Dial, etc.) could answer my following questions:
(1) What is the most effiecint implementation to find k-shortest path
that is available?
(2) Is there a cite (ftp www) that I can retrieve the code to experiment
with?
Thanks.
S. Areibi
areibi1@ksla.nl

LIPSOL is a MATLAB-based package for solving linear programs by
interior-Point methods. For computational efficiency it uses a
Fortran package by Esmond Ng and Barry Peyton at ORNL to solve
large sparse linear systems. LIPSOL has been tested on the Netlib
set of linear programs and has effectively solved all 95 Netlib
problems.

What's New?

In version 0.3, we have
(1) implemented a dense-column handling strategy;
(2) added rules for early termination on infeasible problems;
(3) added support for a new LPP (LP-Plain) format for LP input;
(4) included all source, thus making v0.3 highly portable;
(5) included numerous improvements and bug fixes over the
previous release -- version beta-2.2 (we have changed
the version numbering system).

Where to get it?

LIPSOL 0.3 distribution is a compressed-tar file: lipsol03.tar.gz.
To get it, please visit the LIPSOL home page on the Web:
http://math.umbc.edu/~yzhang/lipsol/
It is also retrievable by anonymous FTP from:
ftp.math.umbc.edu:pub/zhang/lipsol/v0.3/

LIPSOL is free software and comes with no warranty. All files written
by this author are copyrighted under the terms of the GNU General Public
License as published by the Free Software Foundation.

LASPack, a package for solving large sparse systems of linear equations
like those arising from discretization of partial differential equations,
is now available in WWW.

Main features:

- The primary aim of LASPack is the implementation of efficient iterative
methods for the solution of systems of linear equations. All routines and
data structures are optimized for effective usage of resources especially
with regard to large sparse matrices. The package can be accessed from
an application through a straightforward interface defined in the form
of procedure calls.

All above solvers are applicable not only for the positive definite or
non-symmetric matrices, but are also adopted for singular systems
(e.g. arising from discretization of Neumann boundary value problems).

- The implementation is based on an object-oriented approach (although it
has been programmed in C). Vectors and matrices are defined as new data
types in connection with the corresponding supporting routines.
The basic operations are implemented so that they allow the programming
of linear algebra algorithms in a natural way.

- LASPack is extensible in a simple manner. An access to the internal
representation of vectors and matrices is not necessary and is, as required
of the object-oriented programming, avoided. This allows an improvement
of algorithms or a modification of data structures with no adjustment
of application programs using the package.

- LASPack is written in ANSI C and is thus largely portable.

The source code and the documentation of LASPack is available in WWW
at the following URLs:

Richard Lehoucq has been named recipient of the 1995 J. H. Wilkinson
Fellowship in Scientific Computing.
He will join the Mathematics and Computer Science (MCS) Division at
Argonne National Laboratory in September 1995.

Rich is the main developer of the current version of ARPACK.
This software, initially developed by Phuong Vu and
Danny Sorensen, is currently considered to be the best for solving
large-scale eigenvalue problems when storage is an issue.
Lehoucq received his Ph.D. in computational science and engineering from
Rice University in May 1995. His dissertation was concerned with an analysis
and implementation of an implicitly restarted Arnoldi iteration.
He has a strong background in numerical linear algebra, with an emphasis
on large-scale iterative methods. He also has extensive experience in
designing and implementing mathematical software on heterogeneous environments.

The Wilkinson Fellowship was created in memory of
James Hardy Wilkinson, F.R.S., who for many years acted as a
consultant and guiding spirit for such efforts as the EISPACK and
LINPACK projects. The fellowship is intended to assist a young
scientist who is actively engaged in state-of-the-art research in
scientific computing.

Dr. Sven Hammarling from Numerical Algorithms Group LTD in
Oxford, England is visiting UNI*C between July 24 and July 28, 1995.
We will install and test together the PVM NAG Library on the IBM SP2
and SGI Power Challenge computers.
Sven is one of the authors of the BLAS, BLACS, PBLAS, LAPACK
and ScaLAPACK packages. He has written many computational
numerical analysis (specially linear algebra) papers. Sven is one of
the designers of the NAG Library.

The latest release of the scientific programming library DSSLIB is now
available. DSSLIB comprises optimized and parallelized versions of
BLAS 1-3, LAPACK, FFTPACK, VFFTPACK, and LINPACK. The new version
includes:
o Significantly higher speed across the board derived from higher serial
speeds for many core subroutines together with many more parallelized
subroutines.
o An interface that allows users of Rogue Wave's LAPACK.h++ to link
DSSLIB with their applications. This can boost performance by a
factor of 10 on single-CPU machines, and can give greater performance
on MP machines because of the parallelization built into DSSLIB.
o Native C interfaces to all of the subroutines. This allows users to
use C naming conventions (no underscore required), typical C calling
conventions such as passing constants by value rather than reference,
and it will handle workspace allocation.

Principal Lecturers:
Christopher I. Byrnes, Washington University, title to be announced
Michael G. Crandall, University of California at Santa Barbara, On Fully
Nonlinear Elliptic Equations with Measurable Ingredients
Christine A. Shoemaker, Cornell University, Large Scale Nonlinear Optimal
Control of Systems Governed by Partial Differential Equations, with
Applications to Groundwater Remediation

On-Line Information:
The World-Wide Web site for the conference is
http://www2.ncsu.edu/math/Announcements/Searcde/
and searcde@math.ncsu.edu is the email address.

Registration:

Preregistration is advised and appreciated. For more information on
registration refer to one of the on-line addresses given above or
contact one of the conference organizers given at the end of this
announcement.

Contributed Talks:
If you want to present a 20 minute talk, please submit your title and
(brief) abstract by the deadline of September 1. You may submit your
title/abstract by email to searcde@math.ncsu.edu or by post with your
preregistration information.

Discrete mathematics is a relatively young branch of the
mathematical sciences, with a wide range of challenging research
problems and important applications in industry. It is a dynamic
and rapidly expanding field and is experiencing explosive growth
in both theory and applications. The conference seeks to bring
together participants from the many different environments where
discrete mathematics is developed and applied.

Contributed presentations in lecture or poster format are
invited in all areas of discrete mathematics consistent with the
conference themes. Each contributor must submit a brief abstract
not exceeding 75 words long.

For those interested in organizing a minisymposium, prospective
minisymposium organizers must provide a session title, a
description not exceeding one-hundred words long, a list of four
speakers, and titles of speakers presentations.

Electronic submission is encouraged. Submit your abstracts and
minisymposium proposals via e-mail to: (meetings@siam.org). LaTeX
macros for submitting your abstracts are available and will be
sent to you upon request, or you can access the macros via
gopher.siam.org or http://www.siam.org

DATES TO REMEMBER

November 1, 1995: Deadline for submission of minisymposium
proposals.
December 1, 1995: Deadline for submission of contributed
abstracts.

ELECTRONIC ACCESS

Additional information regarding the conference can be accessed
in electronic format via SIAM's Gopher Server: gopher.siam.org or
through the World Wide Web: http://www.siam.org

Conducted by SIAM in cooperation with the ACM Special Interest
Group on Numerical Mathematics (SIGNUM)

The Second International Workshop on Computational
Differentiation is intended to bring together researchers working
on constructive and accurate methods for differentiation and
their application to computational problems. The first meeting in
1991 in Breckenridge, Colorado, provided a forum for the diverse
group of researchers and formulated common themes and challenges.
Since then, significant progress has been made with respect to
speed, memory requirements, and user convenience of
differentiation tools. This workshop will assess these
developments in algorithmic design and software development and
their impact on applications to science and industry.

The organizing committee invites submissions of
contributed abstracts for presentation either in a lecture or
poster format. Each contributor must submit an extended abstract
not more than one-page in length on 8-1/2" x 11" sheet.
Electronic submission is encouraged. Submit your one page-
abstract to meetings@siam.org.

DEADLINE FOR SUBMISSION OF CONTRIBUTED ABSTRACTS

Abstracts should reach the SIAM office on or before OCTOBER 2,
1995.

ELECTRONIC ACCESS

Up-to-date information about this workshop and all of SIAM's
upcoming conferences is available electronically by accessing the
World Wide Web at (http://www.siam.org).

An international conference, entitled "Advances in Partial Differential Equations
and Applications", dedicated to Peter D.Lax and to Louis Nirenberg on their 70th
Birthday, will be held in Venice (downtown), Italy, between June 10 and 15, 1996.
There will be 16 main lecturers (McLaughlin, Cercignani, Chorin, da Prato,
De Giorgi, Deift, Gallavotti, Klainerman, Levermore, P.L. Lions, Majda, Mosco,
Papanicolaou, Sanz-Serna, Tadmor, and Venakides), and a few possible conributed
papers. Some of the speakers are definitely numerical analysts.
To get more information, send a message to

venice96 at ulam.dmsa.unipd.it

and read the automatic reply.
In case you have special qiestions, contact

The Department of Mathematics has been awarded funding by the
EPSRC Mathematics Programme for a project concerned with
the settling of spherical particles in
viscoelastic fluids using a moving spectral element
method. The project will start on 1 December 1995
or possibly at a later date to be mutually agreed.
Applicants should hold, or expect to obtain in the near
future, a PhD in applied mathematics or engineering.
An ability to write numerical software would be an
advantage.

Applications should be made by sending a curriculum vitae and names
of two academic referees to Dr. T.N. Phillips, Department
of Mathematics, University of Wales, Aberystwyth SY23 3BZ.
Informal enquiries are welcomed either by phone
+44 1970 622769, FAX +44 1970 622777
or by email (tnp@aber.ac.uk).