- Today's Editor:
- Cleve Moler
- The MathWorks, Inc.
- moler@mathworks.com

- NA Digest Calendar
- Inversion of Elliptic Integral
- Change of Address for Magolu monga-Made
- Change of Address for I. Kaporin
- New Versions of SparseLib++ and IML++ Available
- Availability of ScaLAPACK, the PBLAS, and the BLACS
- Nominations for George Polya Prize
- Results of ILAS Elections
- Computational and Applied Mathematics at UT-Austin
- Conference on Real Numbers and Computers
- Numerical Methods and Computational Mechanics
- Workshop on Global Optimization
- Symposium on Discrete Algorithms
- East Coast Computer Algebra Day
- Computational Techniques and Applications Conference
- Summer Conference on Conjugate Gradient Methods
- Postdoc Position at University of Maryland
- Postdoc Position at University of Texas, Austin
- Positions at University of Sussex
- Position at Clemson University
- Contents, SIAM Scientific Computing
- Contents, SIAM Numerical Analysis
- Contents, IMA Numerical Analysis
- Contents, SIAM Review
- Contents, BIT
- Contents, Transactions on Mathematical Software

URL for the World Wide Web:
http://www.netlib.org/na-net/na_home.html
-------------------------------------------------------

From: NA Digest <na.digest@na-net.ornl.gov>

Date: Sun Mar 5 18:39:06 EST 1995

**Subject: NA Digest Calendar**

NA Digest Calendar

Date Topic Place NA Digest #

Mar. 2- 8 Scattered Data Fitting Cancun, Mexico 39

Mar. 13-16 Multidisciplinary Design Optimization Hampton, VA 46

Mar. 16-17 High Performance Computing Lugano, Switzerland 09

Mar. 17-18 Krylov Subspace Methods Raleigh, NC 29

Mar. 20-21 Nonconvex Energy Functions Rutgers, NJ 20

Mar. 20-22 Steltjes Conference Toulouse, France 39

Mar. 22-24 Nonlinear Partial Differential Eqns. Knoxville, TN 41

Mar. 24-25 SIAM Southeastern-Atlantic Section Charleston, SC 06

Mar. 29-31 Systems and Control Houthalen, Belgium 05

Mar. 28... Sci. Computation & Diff. Eqns. Stanford, CA 50

Mar. 29-31 Systems and Control Houthalen, Belgium 43

Apr. 2- 7 Multigrid Methods Copper Mountain, CO 07

Apr. 3- 5 Applied Mathematical Programming London, England 41

Apr. 3- 6 Numerical Methods for Fluid Dynamics Oxford, England 08

Apr. 4- 6 Real Numbers and Computers Saint-Etienne, France 10

Apr. 7 Carl Discrete Math Day Ottawa, Ontario 08

Apr. 8 Carl Analysis Day Ottawa, Ontario 08

Apr. 8 East Coast Computer Algebra Day Newark, DE 10

Apr. 10-12 Parameter Identification Karlsruhe, Germany 46

Apr. 17-18 Symposium in Memory of John A. Gregory Nicosia, Cyprus 06

Apr. 20-22 Computational and Applied Mathematics Austin, TX 09

Apr. 24-26 Boundary Element Technology Honolulu, Hawaii 06

Apr. 24-28 3rd INRIA-SIAM Wave Propagation Conf. Juan-les-Pins, France 19

Apr. 24-28 Multigrid Course Bad Honnef, Germany 03

Apr. 26-30 Numerical Analysis & Applied Math. Constanza,Romania 26

Apr. 27-29 Control and Its Applications St. Louis, MO 36

Apr. 28-30 Global Optimization Princeton, NJ 47

Apr. 29 Midwest NA Day Iowa City, Iowa 05

May 9-12 Agriculture & Bio-Industries Brussels, Belgium 42

May 14-17 Homogenization Theories Mierki, Poland 05

May 15-19 Graphics Interface '95 Quebec City, Canada 36

May 16-20 Domain Decomposition Methods Beijing, China 45

May 16-20 Applied Computer Algebra Albuquerque, NM 46

May 21-24 Object-Oriented Numerics Conference Jackson Lake, WY 32

May 21-26 Centenial Hurwitz on Stability Theory MonteVerita,Switzerland49

May 22-26 Flow through Porous Media Saint-Etienne, France 48

May 29... Haifa Matrix Theory Conference Haifa, Israel 05

May 29-31 Diffraction St.Petersburg, Russia 04

June 1- 3 ABS Methods Beijing, China 04

June 5- 9 Spectral And High Order Methods Houston, TX 44

June 5- 9 Control and Information Shatin NT, Hong Kong 33

June 6-10 Inertial Manifolds Xi'an, China 21

June 13-21 Nonlinear Optimization Erice, Sicily, Italy 44

June 17-20 IMACS Symposium on Iterative Methods Blagoevgrad, Bulgaria 46

June 17-20 Iterative Methods in Linear Algebra Blagoevgrad, Bulgaria 39

June 19-22 Intertial Manifolds Xi'an, China 04

June 19-20 Symposium in Honor of Herb Keller Pasadena, CA 04

June 20-24 Honoring G. I. Marchuk Novosibirsk, Russia 28

June 21-24 Interface Computing and Statistics Pittsburgh, PA 50

June 22-23 Nonlinear Optimization Capri 09

June 22-29 Finite Element Approximations St.-Petersburg, Russia 46

June 26-27 Stockholm Optimization Days Stockholm, Sweden 06

June 26-30 Systems Analysis and Simulation Berlin, Germany 50

June 26... Mechanics of Continuous Media St.Peterbourg, Russia 01

June 27-30 Numerical Analysis Dundee, Scotland 37

June 28-30 DSS/2 User Group Mons, Belgium 09

July 3- 7 Computational Techniques Melbourne, Australia 10

July 3- 7 ICIAM, Int'l Cong. Indust. Appl. Math. Hamburg, Germany 23

July 3- 7 Mathematics of Neural Networks Oxford, UK 48

July 9-12 Error Bounds for Numerical Algorithms Oldenburg, Germany 05

July 9-13 Conjugate Gradient Methods Seattle, WA 10

July 9-14 Ill-posed Inverse Problems San Diego, CA 48

July 9-14 Math Methods in Geophysical Imaging San Diego, CA 51

July 10-12 Linear Algebra and Its Applications Manchester, England 39

July 10-21 Nonlinear Waves Sapporo, Japan 43

July 10-12 South African N.A. Symposium Scottburgh, So. Africa 52

July 15-16 Matrix Methods for Statistics Montreal, Quebec 09

July 16... Mathematics of Numerical Analysis Park City, UT 48

July 17-19 Boundary Element Techniques Madison, WI 04

July 17-21 Distributed Parameter Systems Warsaw, Poland 25

July 17-21 Modelling and Optimization Warsaw, Poland 32

July 31... Rocky Mountain Numerical Analysis Salt Lake City, UT 32

Aug. 2- 4 Computer Methods in Water Resources Beirut, Lebanon 50

Aug. 16-19 International Linear Algebra Society Atlanta, GA 07

Aug. 19-22 Operations Research Beijing, China 05

Aug. 21-23 Workshop on Conservation Laws Trondheim, Norway 44

Aug. 23-27 Biology, Ecology and Medicine Sofia, Bulgaria 09

Aug. 24-29 Differential Equations Rousse, Bulgaria 06

Aug. 27-31 Circuit Theory and Design Istanbul, Turkey 42

Aug. 28-30 European Simulation Meeting Gyor, Hungary 07

Aug. 28... Computational and Applied Mathematics Curitiba, Brazil 03

Aug. 29... Parallel Statistics and Economics Trier-Mainz, Germany 41

Sep. 5-14 Computing Techniques in Physics Skalsky dvur, Czech. 08

Sep. 12-15 Parallel Computing in Russia St.-Petersburg, Russia 45

Sep. 17-21 Acoustics of Submerged Structures Boston, MA 22

Sep. 26-29 Computer Arithmetic Wuppertal, Germany 04

Sep. 27-30 Mathematical Tools in Metrology Oxford, UK 51

Oct. 9-15 Cubature Formulae Krasnoyarsk, Russia 08

Oct. 13-14 Differential Equations Raleigh, NC 08

Oct. 15-19 Parallel Algorithms Wuhan, China 08

Oct. 23-26 SIAM Annual Meeting Charlotte, NC 05

Nov. 1- 4 Complementarity Problems Baltimore, MD 05

Nov. 6- 9 Geometric Design Nashville, TN 04

Nov. 15-17 Simulation of Devices and Technologies Kruger, South Africa 01

Nov. 19-22 Pure and Applied Mathematics Isa Town, Bahrain 38

Dec. 10-14 Global Optimization Szeged, Hungary 10

Dec. 14-16 Dynamical Systems/Numerical Analysis Atlanta, GA 49

Dec. 14-20 Winter School on Iterative Methods Hong Kong 09

1996

Jan. 28-30 Discrete Algorithms Atlanta, GA 10

Feb. 12-14 Network Optimization Problems Gainesville, FL 47

Apr. 1- 4 State of the Art in Numerical Analysis York, England 06

June 17-21 Householder XIII Symposium Pontresina,Switzerland 44

July 8-12 Prague Mathematical Conference Prague, Czech Rep. 03

July 15-19 Computational Mechanics Miskolc, Hungary 10

July 27-30 Conference Honoring Mike Powell Cambridge, England 48

Aug. 25-31 Congress Theor. & Appl. Mechanics Kyoto, Japan 46

------------------------------

From: Joel Storch <Joel_Storch@qmlink.draper.com>

Date: 27 Feb 1995 11:54:32 -0500

**Subject: Inversion of Elliptic Integral**

Inversion of Elliptic Integral

Does anyone know how to invert an incomplete elliptic integral of the second

kind E(p;phi)? I need to obtain phi as a function of E. (This problem would

be very easy for the case of an integral of the first kind F(p;phi), I would

just use the Jacobian elliptic function sn). An expansion in the region where

the modulus p approaches unity and phi approaches pi/2 would be good enough.

Joel Storch

------------------------------

From: Magolu monga-Made <Monga-Made.Magolu@cerfacs.fr>

Date: Tue, 28 Feb 1995 14:48:46 +0100 (MET)

**Subject: Change of Address for Magolu monga-Made **

I moved from Cerfacs (France) to the University of Nijmegen

(The Netherlands). My new co-ordinates are :

University of Nijmegen

Department of Mathematics

Toernooiveld 1

Postbus 9010

6500 GL Nijmegen

The Netherlands

Tel : (31) 80 652 293

Fax : (31) 80 553 450

E_mail_address: magolu@sci.kun.nl

Magolu monga-Made

------------------------------

From: Igor Kaporin <kaporin@sci.kun.nl>

Date: Wed, 01 Mar 95 00:07:39 +0100

**Subject: Change of Address for I. Kaporin**

Dear na-netters,

please note my new addresses (valid since 3 Mar 1995):

Igor E. Kaporin

High-speed Rolling Stocks Scientific Research Center

Moscow State University off Railway Communications (MIIT)

Obraztsova Str. 15

103055 Moscow

RUSSIA

Fax: (7) (095) 284 5491

Phone: (7) (095) 284 2111

(7) (095) 284 2425

E-mail: kaporin@hsrs.miit.msk.su

Sincerely, I.Kaporin

------------------------------

From: Roldan Pozo <pozo@cam.nist.gov>

Date: Sun, 26 Feb 95 11:12:28 EST

**Subject: New Versions of SparseLib++ and IML++ Available**

New versions of C++ sparse matrix codes and iterative solvers are now available:

SparseLib++ v. 1.3: Numerical Sparse Matrix Classes in C++

SparseLib++ is a C++ class library for efficient sparse matrix computations

across various computational platforms. The software package consists of

matrix objects representing several sparse storage formats (in this release:

compressed row, compressed column and coordinate formats), providing basic

functionality for managing sparse matrices, together with efficient kernel

mathematical operations (e.g. sparse matrix-vector multiply) based on the

Level 3 Sparse BLAS. Included in the package are several preconditioners

commonly used in iterative solvers for linear systems of equations.

There is also support for sparse matrix I/O with files in either

free-form text or Harwell Boeing format.

IML++ v. 1.0 : Iterative Methods Library in C++

IML++ is a C++ templated library of iterative methods for solving

both symmetric and nonsymmetric linear systems of equations. The algorithms

are fully templated in that the same source code works for dense, sparse,

and distributed matrices. Methods for QMR, GMRES, CG, BiCG, BiCGSTAB,

Richardson, and Chebyshev iterations are provided. These codes can be

use with virtually _any_ C++ matrix/vector class; examples with SparseLib++

are provided.

SOURCE CODE AND DOCUMENTATION

SparseLib++ (v. 1.3) can be obtained

via WWW: http://larch.cam.nist.gov/~pozo/sparselib++.html

via ftp: (source code) gams.nist.gov:pub/pozo/src/sp.shar.Z

(documentation) gams.nist.gov:pub/pozo/docs/sparselib++.ps.Z

IML++ (v. 1.0) is also available

via WWW: http://larch.cam.nist.gov/~pozo/iml++.html

via ftp: (source code) gams.nist.gov:pub/pozo/docs/iml++.ps.Z

(documentation) gams.nist.gov:pub/pozo/src/iml.shar

Please send questions, comments, and suggestions to pozo@cam.nist.gov.

Roldan Pozo Tel: (301) 975-4317

Research Computer Scientist Fax: (301) 990-4127

Computing and Applied Mathematics Laboratory Email: pozo@cam.nist.gov

National Institute of Standards and Technology

Gaithersburg, MD 20899 USA http://gams.cam.nist.gov/acmd/Staff/RPozo

------------------------------

From: Jack Dongarra <dongarra@cs.utk.edu>

Date: Thu, 2 Mar 1995 20:41:07 -0500

**Subject: Availability of ScaLAPACK, the PBLAS, and the BLACS**

Availability of ScaLAPACK, the PBLAS, and the BLACS

The first public release of ScaLAPACK, the PBLAS, and the BLACS is now

available on netlib. Version 1.0 of ScaLAPACK, the distributed memory

version of LAPACK, includes factorization and solve routines for LU, QR,

and Cholesky; reduction routines for Hessenberg form, tridiagonal form,

and bidiagonal form; QR with column pivoting, and RQ, LQ, and QL

factorizations; triangular inversion; and the symmetric eigenproblem.

With the exception of the symmetric eigenproblem, the current version of

ScaLAPACK is available in four precisions: single precision real, double

precision real, single precision complex, and double precision complex.

(At the present time, the symmetric eigenproblem is only available in double

precision real.)

The ScaLAPACK routines are built using the sequential BLAS, the BLACS,

and the PBLAS modules. ScaLAPACK has been ported to Intel i860/Paragon

machines, IBM SP series, Thinking Machines' CM-5, and PVM,

and an MPI version will be available in the near future.

ScaLAPACK is built on a set of routines called the PBLAS. The PBLAS

combine both the data communication and computation into one routine,

having a software interface that is very similar to the BLAS interface.

The data communication in the PBLAS is in turn provided by a set of

routines called the BLACS (Basic Linear Algebra Communication Subroutines).

The BLACS provides a portable message-passing interface targeted at

linear algebra computations with an user interface similar to that

of the BLAS. Several vendors are producing optimized versions of

the BLACS (e.g. Cray, IBM, and Meiko).

Please note that this "official" release is not compatible with

previous test releases. If you have retrieved a previous version,

we recommend that you download a fresh version.

For more information on the availability of each of these packages and

their documentation, consult the scalapack or blacs indexes on netlib.

echo "send index from scalapack" | mail netlib@www.netlib.org

echo "send index from blacs" | mail netlib@www.netlib.org

The URL is:

http://www.netlib.org/scalapack/

For further information on the BLACS, the URL is:

http://www.netlib.org/blacs/Blacs.html

Send comments to scalapack@cs.utk.edu or blacs@cs.utk.edu, respectively.

Regards,

Jack Dongarra Jim Demmel Jack Dongarra

Jaeyoung Choi Inderjit Dhillon David Walker

Susan Ostrouchov Ken Stanley

Antoine Petitet

Clint Whaley

Univ of Tenn., Knoxville Univ of Calif., Berkeley Oak Ridge Nat Lab

------------------------------

From: Alison Bogardo <bogardo@siam.org>

Date: Fri, 03 Mar 95 11:44:18 EST

**Subject: Nominations for George Polya Prize**

CALL FOR NOMINATIONS

for

GEORGE POLYA PRIZE

The Polya Prize

SIAM will present the award at the 1996 SIAM Annual Meeting in Kansas

City, Missouri, July 22-26. The award honors the memory of George

Polya and will be given for a notable application of combinatorial

theory.

Eligibility

There are no restrictions except that the prize is broadly intended to

recognize specific work.

Description of the Award

The award will consist of an engraved medal and a $20,000 cash prize.

Nominations

A letter of nomination, including a description of the achievement(s),

should be sent by July 1, 1995, to:

Dr. Paul Seymour

Chair, Polya Prize Selection Committee

Bell Communications Research

435 South Street

Morristown, NJ 07960

Supporting letters, or names of knowledgable persons from whom such

letters might be solicited, are also welcome.

------------------------------

From: Danny Hershkowitz <hershkow@techunix.technion.ac.il>

Date: Tue, 28 Feb 1995 07:14:07 +0200 (EET)

**Subject: Results of ILAS Elections**

On the basis of a report received from the ballot-counting subcommittee

of the Nominating committee for the recent ILAS elections, the following

have been elected to ILAS offices as of March 1, 1995:

Vice President:

Daniel Hershkowitz (three year term)

Board of Directors:

Robert C. Thompson (three year term)

Peter Lancaster (three year term)

Chi-Kwong Li (two year term)

Angelika Bunse-Gerstner (two year term)

In addition to the above, the following continue in their offices to

which they were previously elected:

Hans Schneider, President

James R. Weaver, Secretary/Treasurer

Richard A. Brualdi, member of Board of Directors

Thomas Laffey, member of Board of Directors

We wish to thank all candidates for agreeing to stand for election to

ILAS offices.

Hans Schneider

President, ILAS

------------------------------

From: Robert van de Geijn <rvdg@cs.utexas.edu>

Date: Tue, 28 Feb 1995 10:51:22 -0600

**Subject: Computational and Applied Mathematics at UT-Austin**

We would like to encourage exceptional prospective graduate students

with interests in Computational and Applied Mathematics (CAM) to apply

to the CAM graduate program at the University of Texas-Austin.

Support in form of RAships, TAships, and Fellowships are awarded on a

competitive basis. In particular, a number of $25,000 per year CAM

fellowships are available to US citizens in the program.

For more information, see our web page:

http://www.ticam.utexas.edu

or call (512) 471-3312

Robert A. van de Geijn rvdg@cs.utexas.edu

Associate Professor http://www.cs.utexas.edu/users/rvdg

Department of Computer Sciences (Work) (512) 471-9720

The University of Texas (Home) (512) 251-8301

Austin, TX 78712 (FAX) (512) 471-8885

------------------------------

From: Jean-Michel Muller <Jean-Michel.Muller@lip.ens-lyon.fr>

Date: Mon, 27 Feb 1995 08:35:09 +0100

**Subject: Conference on Real Numbers and Computers**

Real Numbers and Computers - Les nombres reels et l'ordinateur

Saint-Etienne, France, April 4-6, 1995

CALL FOR PARTICIPATION AND INFORMATION PACKAGE

Location and date:

Ecole des Mines de Saint-Etienne,

Saint-Etienne, FRANCE

April 4-5-6 4-5-6 Avril 1995

Sponsored by:

- Ecole des Mines de Saint-Etienne

- Centre National de la Recherche Scientifique

- Laboratoire de l'Informatique du Parallelisme, Ecole Normale Superieure de

Lyon

Efficient handling of real numbers in a computer is not yet solved in a

satisfying way. The "floating point" formats most often used in scientific

computing usually give sufficient results, but some reliability problems

can occur. Program portability problems could imply some rewriting

costs: some programs which work well with a machine, could become

unreliable with another one. Users (from computer algebra, algorithmic

geometry, ...) may need results far more accurate (even "exact") than

the ones obtained with usual number systems. Many members of the scientific

community are concerned by this problem, they could share their knowledge and

come up with new solutions. But they do not have the opportunity to meet, they

do not belong to the same scientific fields (computer science, number

theory, numerical analysis, computer algebra...) and they have a different

vocabulary. The aim is to put them together during this meeting (the

"rule of the game" should be that everybody should speak a common language), in

order to establish some collaborations.

You can get more information at the html addresses:

http://www.emse.fr/english/stetienne.html

http://www.ens-lyon.fr/~jmmuller/conf_st_etienne/real_numbers.html

For general information (how to reach Saint-Etienne, list of hotels, etc.

please call Dominique Michelucci (+33) 77 42 01 84, michelucci@emse.fr

or Jean-Michel Muller (+33) 72 72 82 29, jmmuller@lip.ens-lyon.fr

------------------------------

From: Aurel Galantai <matgal@gold.uni-miskolc.hu>

Date: Tue, 28 Feb 1995 18:51:48 +0100

**Subject: Numerical Methods and Computational Mechanics**

PRELIMINARY ANNOUNCEMENT AND CALL FOR PAPERS

NUMERICAL METHODS AND COMPUTATIONAL MECHANICS

IN SCIENCE AND ENGINEERING

15-19th July 1996

Miskolc, Hungary

Organizers:Janos Bolyai Mathematical Society, University of Miskolc,

Hungarian Academy of Sciences

This conference is a satellite conference prior to the 2nd European

Congress of Mathematics to be held in Budapest, July 21-27, 1996. The aim

of the conference is to bring together numerical analysts, specialists of

computational mechanics and numerical software developers. The conference

will focus on numerical methods used in mechanical and other engineering

applications. Special attention will be paid to the finite element method

and related techniques.

PLANNED SECTIONS

-- Numerical algebra (sparse and dense linear systems, eigenvalue problems,

nonlinear systems, parallel algorithms, etc.)

-- Numerical solution of differential equations (FEM, BEM, multigrid,

difference methods, spectral methods, parallel algorithms, etc.)

-- Computational mechanics (FEM, BEM, parallel algorithms)

One-hour plenary lectures and twenty minute talks are planned.

INTERNATONAL SCIENCE COMMITTEE

I.BABUSKA, chairman; University of Maryland

B.SZABO, co-chairman; Washington University in St. Louis

B.GUO, The University of Manitoba, Winnipeg, Canada

R.HABER, University of Illinois at Urbana-Champaign, USA

V.P.IL'IN, Computing Center, Russian Academy of Sciences, Novosibirsk, Russia

C.JOHNSON, Chalmers University of Technology, Sweden

M.KRIZEK, Czech Academy of Sciences, Prague

J.T.ODEN, The University of Texas, USA

J.PITKARANTA, Helsinki University of Technology, Finland

L.S.XANTHIS, Sir George CAYLEY Inst. for Computational Mechanics, London, UK

J.R.WHITEMAN, Brunel University, U.K.

M.F.WHEELER, Rice University Houston, USA

T.CZIBERE, University of Miskolc, Hungary

Z.GASPAR, Technical University of Budapest, Hungary

I.PACZELT, University of Miskolc, Hungary

P.ROZSA, Technical University of Budapest, Hungary

G.STOYAN, Eotvos Lorand University of Budapest, Hungary

The first announcement and call for papers is scheduled for the end of May,

1995. If you are interested in attending the conference and wish to be on

the mailing list, SEND NOW, please a message to

--A.GALANTAI or Gy.SZEIDL

--Institute of Mathematics or Department of Mechanics

--University of Miskolc

--3515 Miskolc-Egyetemvaros

--Hungary

Phone: 36-46-365111 Fax: 36-46-365174, 36-46-369554

e-mail: matnum@gold.uni-miskolc.hu (preferred)

matgal@gold.uni-miskolc.hu

mechszgy@gold.uni-miskolc.hu

------------------------------

From: Tibor Csendes <globopt@inf.u-szeged.hu>

Date: Sat, 4 Mar 95 10:58 MET

**Subject: Workshop on Global Optimization**

First Announcement

THIRD WORKSHOP ON GLOBAL OPTIMIZATION

Many technical, environmental and economic problems have challenging

optimizational aspects which require reliable and efficient solution

methods. A substantial part of such problems belongs to the class of

nonlinear and nonconvex optimization problems where standard

optimization methods fail since local optima different from the

global ones (which we aim to find) exists (global optimization).

The workshop focuses on theoretical, modelling and algorithmic issues

of global optimization problems with special emphasis to their

real-life applications. The workshop aims to discuss and develop

furthermost recent results in the wide range of the many diverse

approaches to global optimization problems.

After the first (1985) and the second (1990) Workshops held in

Sopron, Hungary, we are glad to announce the Third Workshop on Global

Optimization. From our preliminary discussions at various occasions

in the last two years we know that the overwhelming majority of the

earlier participants and many other colleagues are interested. Thus

we look forward to a meeting which is very likely to match or even

surpass the very successful two earlier meetings.

Program Committee

Pierre Hansen, Reiner Horst and Panos M. Pardalos

Organization Committee

Immanuel Bomze and Gabriele Danninger

University of Vienna, Vienna, Austria, bomze@eos.smc.univie.ac.at

Andras Erik Csallner and Tibor Csendes

Jozsef Attila University, Szeged, Hungary, csendes@inf.u-szeged.hu

Date and place

December 10-14, 1995, Szeged, Hungary.

Address of Organizing Committee

Tibor Csendes

Jozsef Attila University, Institute of Informatics

H-6701 Szeged, P.O. Box 652, Hungary

Phone: +36 62 310 011 (ext. 3839), Fax: +36 62 312 292

E-mail: globopt@inf.u-szeged.hu

URL: http://www.inf.u-szeged.hu/~globopt/

Ftp: ftp.jate.u-szeged.hu,

in the directory /pub/math/optimization/globopt

------------------------------

From: Trini Flores <flores@siam.org>

Date: Wed, 01 Mar 95 14:28:51 EST

**Subject: Symposium on Discrete Algorithms**

ANNOUNCING ...

Seventh Annual ACM-SIAM Symposium on Discrete Algorithms

(SODA), sponsored by ACM Special Interest Group on Algorithms and

Computation Theory and SIAM Activity Group on Discrete

Mathematics

January 28-30, 1996, Sheraton Colony Square Hotel

Atlanta, Georgia

CALL FOR PAPERS

This symposium concerns research on the use, design, and analysis

of efficient algorithms and data structures, in areas including,

but not limited to:

Combinatorial Structures; Computational Biology; Computational

Geometry; Databases and Information Retrieval; Discrete

Optimization; Graphs and Networks; Machine Learning; Number

Theory and Algebra; On-line Problems; Pattern Matching and Data

Compression; Random Structures; and Symbolic Computation.

The algorithms may be sequential, distributed, or parallel. They

may be analyzed either mathematically or by rigorous

computational experiments. In either case, the selection of

papers will be based on the extent to which the results yield new

insights for the design of efficient algorithms.

The program committee especially encourages submissions which

report on experimental and applied research. Special

consideration will be given to work that is motivated by

real-world problems. Experimental and applied papers are expected

to show convincingly that the algorithms or data structures

discussed are useful and efficient in a practical setting.

Program Committee

Eva Tardos (Chair), Cornell University; David Applegate, AT&T

Bell Laboratories; John Canny, University of California,

Berkeley; David Eppstein, University of California, Irvine;

Zvi Galil, Columbia University and Tel-Aviv University, Israel;

David R. Karger, Massachusetts Institute of Technology;

Anna R. Karlin, University of Washington; Nati Linial, Hebrew

University, Israel; Satish B. Rao, NEC Research Institute;

Jeffrey S. Vitter, Duke University; and Peter M. Winkler, AT&T

Bell Laboratories

Papers will be selected for presentation based on extended

abstracts. Authors wishing to submit a paper should send twelve

copies of an extended abstract (not a full paper) to:

SIAM Conference Coordinator, 3600 University City Science

Center, Philadelphia, PA 19104-2688, U.S.A.

Abstracts must be received at the SIAM office by July 14, 1995

(or postmarked by July 12, 1995 and sent airmail). This is

a firm deadline; submissions after the deadline will not be

considered. Letters of acceptance/rejection will be sent

by September 20, 1995.

Abstract Format. Abstracts should begin with the title of the

paper, each author's name, affiliation, and e-mail address,

followed by a succinct statement of the problems that are

considered in the paper, the main results achieved, an

explanation of the significance of the work, and a comparison to

past research. This material should be easily understood by

nonspecialists. Technical developments, directed toward the

specialist, should follow as appropriate. The entire extended

abstract must not exceed 10 pages (using 11 point or larger font,

with not less than one inch margins all around). Abstracts that

deviate significantly from these guidelines risk rejection

without consideration of their merits.

Electronic Access

Information regarding the Symposium can be accessed in electronic

format via SIAM's Gopher server: gopher.siam.org or through the

World Wide Web: http://www.siam.org

You can also contact SIAM by telephone: 215-382-9800; Fax: 215-

386-7999; E-Mail: meetings@siam.org

------------------------------

From: John Eccad <eccad@louie.udel.edu>

Date: Wed, 01 Mar 1995 16:09:48 -0500

**Subject: East Coast Computer Algebra Day**

1995 EAST COAST COMPUTER ALGEBRA DAY

Second Announcement and Call for Participation

The 1995 East Coast Computer Algebra day will be held in

Smith Hall on the University of Delaware campus in Newark, DE

on Saturday, April 8, 1995.

The purpose of this meeting is to stimulate interest in and enhance

understanding of the technical aspects of computer algebra by

providing a way for those in the region who are active or interested

in becoming more active in computer algebra to meet with each other in

an inexpensive and easily accessible way. This informal meeting will

provide ample time for unstructured interaction. The breadth of

computer algebra will be covered. The three invited speakers will

address topics in algorithms, software, and applications. Members of

the community are invited to submit abstracts for poster presentation

or software demonstrations. The deadline for poster or demo abstracts

is March 8, 1995. Graduate students are particularly encouraged to

contribute posters or demos. Thanks to tentatively approved NSF

support, contributors will be eligible for travel support up to

a maximum of $400. Preference will be given to graduate students,

recent graduates, and their advisors.

Invited Speakers

Michael F. Singer

North Carolina State, Raleigh, NC

Galois Theory of Difference Equations

Sabine Stifter

Research Institute for Symbolic Computation, Linz, Austria

Experiences with Algebraic Solutions in Industrial Applications

Stephen M. Watt

IBM Watson Research Center, Yorktown Heights, NY

The Five W's of Symbolic-Numeric Computation

Participants are encouraged to prepare a poster or software

demonstration of their current work for the poster/demo sessions.

Graduate students are particularly encouraged to take part.

Those who present a poster/demo and their advisors are eligible

to apply for travel support. The deadline for submission of poster

abstracts and application for travel support is March 8, 1995.

Organizing committee

David Saunders (general chair), Bob Caviness (program chair),

Jamil Baddoura, Juan Soto, Andrew Wack, David H. Wood,

all of U. Delaware, email: <last-name>@cis.udel.edu

Bruce Char, email: bchar@king.mcs.drexel.edu

Further information is available from eccad@cis.udel.edu or

B. David Saunders

Department of Computer and Information Sciences

University of Delaware, Newark, DE 19716

email: saunders@cis.udel.edu,

telephone: (302) 831-6238, fax: (302) 831-8458

------------------------------

From: Nian LI <nian@rodney.ma.swin.edu.au>

Date: Thu, 2 Mar 1995 15:50:51 +1100

**Subject: Computational Techniques and Applications Conference**

The Seventh Biennial Computational Techniques and Applications Conference

Swinburne University of Technology, Melbourne, Australia

3 July - 7 July 1995.

CTAC95 is the seventh biennial Computational Techniques and

Applications Conference organised by the Computational

Mathematics Group of Australian and New Zealand Industrial and

Applied Mathematics (ANZIAM), a Division of the Australian

Mathematical Society. It will provide an opportunity for the

interaction between developers and users of computational

methods applied to problems in engineering and science.

The first three days, Monday 3 July to Wednesday 5 July 1995,

will consist of standard conference presentations. It is intended

that at least one session will be devoted to industrial

applications. The conference will be followed by two days of

workshops on Thursday 6 July and Friday 7 July 1995, which

will provide in-depth treatment of important recent

developments in particular areas of computational mathematics

and computing technology.

Invited Speakers

% Frank de Hoog (CSIRO, DMS) Industrial applications

% Charles Micchelli (IBM, NY) Neural networks

% Tad Murty (National Tidal Facility, Flinders University) Long gravity waves.

% Mike Powell (Cambridge University, UK) Linear algebra and approximation

% Brian Spalding (CHAM, UK) Computational fluid dynamics

(MFP invited lecturer)

Workshops

The two days of workshops on Thursday 6 July and Friday 7 July

1995 will consist of presentations in the following five areas of specific interest.

W1 Computational fluid dynamics and the use of packages

such as Fastflo, CFDSFlow3d, Phoenics, Fidap.

W2 Finite element methods and the use of packages such as

STRAND, NASTRAN, ABAQUS, Dyna3D, Pafec.

W3 Particle methods.

W4 Surface fitting techniques and mesh generation.

W5 Computational mathematics in the classroom.

Conference Information

Information on the conference is held in the ftp directory

pub/CTAC95 on edna.swin.edu.au and is available for access

by anonymous ftp.

For further information please contact

Assoc Prof Alan Easton,

Director CTAC95,

School of Mathematical Sciences,

Swinburne University of Technology,

PO Box 218, Hawthorn,

Melbourne, Victoria, 3122

Australia

Tel: +61 3 214 8283

Fax: +61 3 819 0821

email: ctac95@swin.edu.au

------------------------------

From: Larry Nazareth <nazareth@amath.washington.edu>

Date: Thu, 2 Mar 1995 17:19:48 -0800

**Subject: Summer Conference on Conjugate Gradient Methods**

SUMMER RESEARCH CONFERENCE ON CG-RELATED METHODS

An AMS-IMS-SIAM Joint Summer Research Conference on Linear and

Nonlinear Conjugate Gradient-Related Methods

will be held on the campus of the University of

Washington in Seattle, Washington, USA from

Sunday, July 9, 1995 through Thursday, July 13, 1995. The purpose

of this meeting is to bring together researchers and practitioners

from the linear and nonlinear conjugate gradient (CG) communities

for an exchange of ideas and to foster communication.

Invited speakers for one-hour talks include A.R. Conn (IBM, Watson),

A. Greenbaum (NYU), T. Manteuffel (Colorado), S. Mehrotra (Northwestern),

J. Nocedal (Northwestern), D. O'Leary (Maryland), M.A. Saunders (Stanford),

D.P. Young (Boeing).

The meeting will seek to maintain a balance between

formal presentations of research (a substantial number of

1/2 hour slots will be available to participants)

and the opportunity for informal and more

spontaneous interaction. There will be no parallel sessions.

A proceedings will be published by SIAM or AMS.

Additional detail can be found in the Notices of the American

Mathematical Society, Vol. 41, No. 8, pp 1014-1017, October, 1994.

Researchers/practitioners who are interested in participating

and have not yet been in touch with one of the co-chairs:

Larry Nazareth(nazareth@amath.washington.edu) and

Loyce Adams(adams@amath.washington.edu),

or with Wayne Drady (wsd@math.ams.org) at AMS

who will handle the administrative details of the meeting,

should do so before April 15, 1995.

------------------------------

From: Dianne O'Leary <oleary@cs.UMD.EDU>

Date: Wed, 1 Mar 1995 12:17:20 -0500

**Subject: Postdoc Position at University of Maryland**

Postdoc Position at University of Maryland

Howard Elman, Pete (G.W.) Stewart, and I are seeking a postdoctoral

researcher to assist us in a project sponsored by the U.S. Office of

Naval Research. Our goal is to to develop effective computational

algorithms for iterative solution of linear systems of equations

arising from finite element models of problems in underwater acoustics.

The starting date would be Summer 1995, and the duration would be

approximately 2 years.

Experience with finite element models, parallel computing, and

iterative methods would be helpful. If you are interested in the

position, please send a curriculum vitae, a summary of research

experience and plans, and names and addresses of three references to:

oleary@cs.umd.edu

Dianne O'Leary

Computer Science Department

University of Maryland

College Park, MD 20742

------------------------------

From: Robert van de Geijn <rvdg@cs.utexas.edu>

Date: Fri, 3 Mar 1995 15:29:05 -0600

**Subject: Postdoc Position at University of Texas, Austin**

We were recently awarded an NSF grant for "Application of High

Performance Computational Methods to Micromechanical Characterization

of Composite Materials." This project is interdisciplinary, involving

researchers from engineering mechanics (Greg Rodin and Tinsley Oden)

and computer sciences (J.C. Browne and Robert van de Geijn). We are

seeking a qualified individual to fill a postdoctoral position that is

part of the project.

Job Description: The individual is expected to coordinate the

development of a user-friendly toolbox for micromechanical analysis

and design of composites. The toolbox will include parallel adaptive

PDE solvers (finite element, domain decomposition, multigrid, and fast

multipole methods) supported by relevant data structure and graphic

interfaces. Components of the toolbox will be developed from similar

codes written for other applications, as well as new codes. Code

development will involve a mixture of C++, C, and Fortran. Platforms

include MPP systems and networks of workstations.

Requirements: PhD in a relevant field (applied mathematics, computer

sciences, engineering, physics), hands-on experience with the

development of large computer codes, fluency in numerical methods that

work in three dimensions. Experience with parallel computing is highly

desirable. Good communication skills and ability to work as part of a

team are essential.

The position is for two years, with a possibility for one additional

year. The position will be filled as soon as possible. Competitive

salary.

To apply, send your CV with three references, and one paper most

relevant to the project (post-script) to Greg Rodin,

(gjr@max.ae.utexas.edu) or Robert van de Geijn, (rvdg@cs.utexas.edu).

------------------------------

From: Christine Coles <C.Coles@sussex.ac.uk>

Date: Thu, 2 Mar 1995 10:39:12 +0000 (GMT)

**Subject: Positions at University of Sussex**

UNIVERSITY OF SUSSEX

TWO LECTURESHIPS IN MATHEMATICS

Applications are invited for two permanent lectureships in Mathematics,

in the area of Analysis and its Applications, including Partial

Differential Equations and their applications in physical applied

mathematics, their mathematical and numerical analysis, nonlinear

analysis and scientific computation. The appointments will be

associated with the 'Centre for Mathematical Analysis and Its

Applications', and may be at Lecturer A or B level. It is expected that

the successful candidates will take up their posts on 1 October 1995.

Further particulars and application forms may be obtained from:

The Personnel Office

Sussex House

University of Sussex

Falmer, Brighton BN1 9RH

Completed applications should be returned by 3rd April.

Informal enquiries to:

C.M. Elliott (01273 678111 Email: C.M.Elliott@sussex.ac.uk)

or D.G. Vassiliev (01273 678781 Email: D.Vassiliev@sussex.ac.uk) are welcome.

------------------------------

From: M. J. Saltzman <mjs@hubcap.clemson.edu>

Date: Thu, 2 Mar 1995 14:27:37 -0500

**Subject: Position at Clemson University**

CLEMSON UNIVERSITY

Clemson, SC

Applicants are invited for anticipated tenure-track positions at the

assistant professor level. Temporary positions will also be available.

The department encompasses the areas of algebra/combinatorics,

analysis, computational math, operations research and statistics. The

Department seeks applicants with expertise in applied analysis,

discrete mathematics and statistics with a focus on time series

analysis. Desirable attributes for candidates include an

interdisciplinary research orientation in the mathematical sciences

and an interest in innovative applications. Candidates should have

strong potential or demonstrated capability for effective research and

teaching. Applications will be considered at anytime after May 1,

1995, as funding becomes available. Applicants should indicate in the

cover letter their research specialties. Vita and names of three

references should be sent to address below. Reference letters should

only be sent when requested. CU is an AA/EO employer.

Professor R. E, Fennell, Head

File A, Box 341907

Department of Mathematical Sciences

Clemson University

Clemson, SC 29634-1907

Please reply to the above address, and not to me. Thank you.

Matthew Saltzman

Clemson University Math Sciences

mjs@clemson.edu

------------------------------

From: SIAM <tschoban@siam.org>

Date: Tue, 28 Feb 95 10:06:20 EST

**Subject: Contents, SIAM Scientific Computing**

SIAM Journal on Scientific Computing

MAY 1995, Volume 16, Number 3

CONTENTS

Three-Dimensional Flow in a General Tube Using a Combination of

Finite and Pseudospectral Discretisations

Roland Hunt

An Algorithm with Polylog Parallel Complexity for Solving Parabolic

Partial Differential Equations

G. Horton, S. Vandewalle, and P. Worley

The ODE Formulation of Hyperbolic PDEs Discretized by the Spectral

Collocation Method

Morten Bjorhus

Temporal Error Control for Convection-Dominated Equations in Two

Space Dimensions

M. Berzins

Fast Multiresolution Algorithms for Solving Linear Equations: A

Comparative Study

Francesc Arandiga, Vicente F. Candela, and Rosa Donat

A Fast Multigrid Algorithm for Isotropic Transport Problems I: Pure

Scattering

T. Manteuffel, S. McCormick, J. Morel, S. Oliveira, and G. Yang

Overlapped Multicolor MILU Preconditioning

Takumi Washio and Ken Hayami

Piecewise Polynomial Collocation for Boundary Integral Equations

Kendall E. Atkinson and David Chien

Analysis of Preconditioning Techniques for Ill-Conditioned Toeplitz

Matrices

Fabio Di Benedetto

GMBACK: A Generalised Minimum Backward Error Algorithm for

Nonsymmetric Linear Systems

Ebrahim M. Kasenally

Iterative Algorithms for Orthogonal Spline Collocation Linear

Systems

W. Sun

On Computing Objective Function and Gradient in the Context of

Least Squares Fitting a Dynamic Errors-In-Variables Model

Jan M. ten Vregelaar

------------------------------

From: SIAM <tschoban@siam.org>

Date: Tue, 28 Feb 95 10:22:10 EST

**Subject: Contents, SIAM Numerical Analysis**

SIAM Journal on Numerical Analysis

APRIL 1995, Volume 32, Number 2

CONTENTS

Preconditioning Legendre Spectral Collocation Approximations to

Elliptic Problems

Seymour V. Parter and Ernest E. Rothman

On Error Estimates of the Penalty Method for Unsteady Navier-Stokes

Equations

Jie Shen

A Characteristics-Mixed Finite Element Method for Advection-

Dominated Transport Problems

Todd Arbogast and Mary F. Wheeler

A Galerkin-Characteristic Algorithm for Transport-Diffusion

Equations

Rodolfo Bermejo

Finite Element Analysis of the One-Dimensional Full Drift-

Diffusion Semiconductor Model

Zhangxin Chen

A Simple Proof of Convergence for an Approximation Scheme for

Computing Motions by Mean Curvature

Guy Barles and Christine Georgelin

A Fast Multilevel Algorithm for Integral Equations

C. T. Kelley

A Multilevel Technique for the Approximate Solution of Operator

Lyapunov and Algebraic Riccati Equations

I. G. Rosen and Chunming Wang

Convergence of Vortex Methods for Three-Dimensional Euler Equations

in Bounded Domains

Ying Lung-An

On the Fundamental Solutions for the Difference Helmholtz Operator

Adam Zemla

Stepwise Stability for the Heat Equation with a Nonlocal Constraint

Baruch Cahlon, Devadatta M. Kulkarni, and Peter Shi

Approximate Solution of Second Kind Integral Equations on Infinite

Cylindrical Surfaces

Andrew T. Peplow and Simon N. Chandler-Wilde

On Optimal Solution of Interval Linear Equations

Sergey P. Shary

A Practical Geometrically Convergent Cutting Plane Algorithm

M. A. H. Dempster and R. R. Merkovsky

C^1-Surface Splines

Jorg Peters

Cubature for the Sphere and the Discrete Spherical Harmonic

Transform

Mark Taylor

Order-Preserving Mesh Spacing for Compound Quadrature Formulas and

Functions with Endpoint Singularities

P. Kohler

------------------------------

From: Iain Duff <I.Duff@letterbox.rl.ac.uk>

Date: Tue, 28 Feb 95 16:26:15 GMT

**Subject: Contents, IMA Numerical Analysis**

IMA JOURNAL OF NUMERICAL ANALYSIS --- Volume 15, Number 2.

Angermann L

Error estimates for the finite-element solution of an elliptic

singularly perturbed problem.

Sun G and Stynes M

Finite-element methods for singularly perturbed high-order elliptic

two-point boundary value problems II: convection-diffusion-type problems.

Garcia-Archilla B and de Frutos J

Time integration of the non-linear Galerkin method.

Moore G

Computation and parameterization of periodic and connecting orbits.

Janovsky V and Plechac P

Numerical analysis of subspace-breaking Takens-Bogdanov points

Glunt W K

An alternating projections method for certain linear problems in a

Hilbert space.

------------------------------

From: SIAM <nelson@siam.org>

Date: Tue, 28 Feb 95 12:25:09 EST

**Subject: Contents, SIAM Review**

Articles Mathematical Morphology: A Modern Approach in Image

Processing Based on Algebra and Geometry

Henk J. A. M. Heijmans

A Chaotic Exploration of Aggregation Paradoxes

Donald G. Saari

Anti-plane Shear Deformations in Linear and Nonlinear Solid Mechanics

C. O. Horgan

Case Study from Industry

Optimizing Continuous Caster Product Dimensions: An Example

of a Nonlinear Design Problem in the Steel Industry

Francis J. Vasko and Kenneth L. Stott

Classroom Notes in Applied Mathematics

Sensible Rules for Remembering Duals--the S-O-B Method

Arthur T. Benjamin

How Many Shuffles to Mix a Deck?

Joseph B. Keller

A Resonant Line Structure Consisting of Rational Right Triangles

Sid Deutsch

A Unified Proof for the Convergence of Jacobi and Gauss-Seidel Method

Roberto Bagnara

Problems and Solutions

Book Reviews

Global Behavior of Nonlinear Difference Equations (V. L.

Kocic and G. Ladas) Ravi P. Agarwal

Network Flows (R. K Ahuja, T. L. Magnanti, and J. B. Orlin)

Michael O. Ball

Catalan's Conjecture (P. Ribenboim) J. W. S. Cassels

Evolutionary Integral Equations and Applications (J. Pruss)

C. Corduneanu

Catastrophe Theory (Domenico P. L Castrigiano and Sandra A.

Hayes) David Chillingworth

Moving-Grid Methods for Time-Dependent Partial Differential

Equations (P. A. Zegeling) Thomas K. DeLillo

Schur's Algorithm and Several Applications (M. Bakonyi and

T. Constantinescu) A. E. Frazho

Numerical Solution of Ordinary Differential Equations (L.F.

Shampine) I. Gladwell

Partial Differential Equations in Classical Mathematical

Physics (I. Rubinstein and L. Rubinstein) Ronald B. Guenther

Viscous Vortical Flows (L. Ting and R. Klein) Max D. Gunzburger

Codes, Puzzles, and Conspiracy (Dennis Shasha) Glen Richard Hall

Computational Geometry in C (J. O'Rourke) Christoph M. Hoffmann

The Essence of Chaos (E. N. Lorenz) Philip Holmes

Operator-Limit Distributions in Probability Theory (Z. J.

Jurek and J. D. Mason) W. N. Hudson

Introduction to Maple (Andre Heck) Wolfram Koepf

Singularity Theory and Equivariant Symplectic Maps (Thomas

Bridges and Jacques E. Furter) Kenneth R. Meyer

Random Series and Stochastic Integrals: Single and Multiple

(Stanislaw Kwapien and Wojbar A. Woyczynski) Philip Protter

Ray Methods for Nonlinear Waves in Fluids and Plasmas (A. M.

Anile, J. K. Hunter, P. Pantano, and G. Russo) Jeffrey Rauch

A First Course in Discrete Dynamical Systems (R. A.

Holmgren) James T. Sandefur

Completeness of Root Functions of Regular Differential

Operators (S. Yakubov) Hans Triebel

Selected Collections

Chronicle

------------------------------

From: Ake Bjorck <akbjo@math.liu.se>

Date: Wed, 1 Mar 95 18:01:44 +0100

**Subject: Contents, BIT**

CONTENTS BIT Volume 35, No. 1 (1995)

ISSN 0006-3835

Comparing stability properties of three methods in DAEs or

ODEs with invariants

Anders Barrlund, pp. 1--18

On the numerical stability of Volterra integral equations with

a lagging argument

Baruch Cahlon, pp. 19--29

Weighted graph based ordering techniques for preconditioned conjugate

gradient methods.

S.~S. Clift and W.-P. Tang, pp. 30--47

Approximate inverses of multidiagonal matrices and application

to the block PCG method

D. J. Evans and Guang-Yao Lei, pp. 48--63

Some error expansions for Gaussian quadrature

D. B. Hunter, pp. 64--82

The maximal accuracy of stable difference schemes for the wave equation.

Rolf Jeltsch, Rosemary A. Renaut and Kosie J.H. Smit, pp. 83--115

On the cubic convergence of the Paardekooper method

Noah H. Rhee and Vjeran Hari, pp. 116--132

Parameter error estimate of near alternation approximation

Chang Zhong Zhu and Charles B. Dunham, pp. 133--142

%%BIT now accepts papers in LaTeX. For information send email to the Editor:

{\AA}ke Bj\"orck

Department of Mathematics

Link\"oping University

S-581 83 Link\"oping, Sweden

email: akbjo@math.liu.se

FAX: +46-13 100 746

------------------------------

From: Ronald Boisvert <boisvert@cam.nist.gov>

Date: Fri, 3 Mar 95 14:25:40 EST

**Subject: Contents, Transactions on Mathematical Software**

News from the ACM Transactions on Mathematical Software (TOMS)

* The December 1994 issue of TOMS experienced processing delays,

but should be distributed in a few weeks. The March issue is

already well into production and should appear soon after.

* Reminder: Information on TOMS, including complete searchable

Table of Contents of all volumes and upcoming papers, is

available on the World Wide Web at http://gams.nist.gov/toms/.

Table of Contents

ACM Transactions on Mathematical Software (TOMS)

Volume 21, Number 1 (March 1995)

Mark T. Jones and Paul E. Plassmann,

An Improved Incomplete Cholesky Factorization.

Mark T. Jones and Paul E. Plassmann

Algorithm: Fortran Subroutines to Compute Improved Incomplete

Cholesky Factorizations.

Ralph B. Kearfott

A Fortran 90 Environment for Research and Prototyping of Enclosure

Algorithms for Nonlinear Equations and Global Optimization.

Richard D. Ray

Algorithm: Least Squares Solution of a Linear Bordered,

Block-diagonal System of Equations.

Richard J. Fateman, Kevin A. Broughan, Diane K. Willcock and Duane Rettig

Fast Floating Point Processing in Common Lisp.

Jack Dongarra and Tom Rowan and Reed Wade

Software Distribution using XNETLIB.

Eric Grosse

Repository Mirroring.

I. C. Demetriou

Algorithm: L2CXFT: A Fortran Subroutine for Least Squares Data

Fitting with Nonnegative Second Divided Differences.

Ken Weber

The Accelerated Integer GCD Algorithm.

I. Bongartz and A.R. Conn and Nick Gould and Ph.L. Toint

CUTE: Constrained and Unconstrainted Testing Environment.

------------------------------

End of NA Digest

**************************

-------