NA Digest Sunday, May 19, 1996 Volume 96 : Issue 20

Today's Editor:
Cleve Moler
The MathWorks, Inc.

Submissions for NA Digest:

Mail to

Information about NA-NET:

Mail to

URL for the World Wide Web: -------------------------------------------------------

From: Wai Sun Don <>
Date: Mon, 13 May 96 10:56:39 -0400
Subject: Library for Spectral Differentiation

Dear Colleagues,
A friend and I are considering writing a software library for
computing numerical derivatives via spectral methods.
Features might include code to compute
1) Chebyshev and Legendre derivatives using matrix multiplication
2) derivatives computed using FFT, cosine transform algorithms,
and even-odd decompositions.
3) Careful minimization of roundoff error.
4) (partially) automatic choice of different algorithms for
best efficiency on different computers.
5) use on parallel computers using MPI.

This would be a library for general public use.
Does anyone know if anything like this already exists?
If I wrote it, would anyone be interested in using it?

Wai Sun Don
Visiting Associate Professor (Research)


From: Dave Hart <>
Date: Mon, 13 May 1996 10:22:21 -0500
Subject: Statistics on Circles

I have a collection of [real positive] data collected at various angles
[nondirectional, as it happens, so f(theta)=f(theta + 180 degrees)].
I want to fit an ellipse to the data, and say something about the
quality of the fit, the improvement over fitting by the mean value, etc.

Has anyone done any work along these lines? I am especially interested
in discussions of the mathematical issues that arise.

Dave Hart <>
Center for Statistical and Mathematical Computing
812-855-2632 <>


From: Oh Jong Kwon <>
Date: Fri, 17 May 1996 21:16:00 +0900
Subject: High Order Runge-Kutta Method

I want to solve a differential equation describing a chaotic
system with no adaptive step size control routine.
The chaotic system is unstable at every point. The truncation
error, therefore, propagates exponentially. In another word, chopping
the stepsize more finely is not the best way to solve the equation at
I think that 8th order instead of 4th order Runge-Kutta may be a
solution since the truncation error in 8th order is much smaller than
that in 4th order.
As you know, the derivation of 8th order Runge-Kutta is a very
very tedious task.
I shall be much obliged if anyone who have the routine of 8th
order Runge-Kutta method send me it.


Ohjong Kwon


From: Apostolos Hadjidimos <>
Date: Thu, 16 May 1996 10:43:17 -0500 (EST)
Subject: Change of Address for Apostolos Hadjidimos

Change of address for Apostolos Hadjidimos

Dear Colleagues:

As of September 1, 1996, I will spend most of
my one year leave of absence from Purdue with
the University of Crete.

My postal address will be:
Department of Mathematics,
University of Crete,
PO Box 470
GR-711 10 Heraklion, GREECE

My email address will be:

Best regards,
Apostolos Hadjidimos

PS: You can always email me at my current address
at Purdue.


From: Stephen Wright <>
Date: Tue, 14 May 1996 16:48:54 -0500
Subject: NEOS Guide to Optimization Software

We're glad to announce an updated and revised Guide to Optimization Software
on the Web at URL

The Guide is based on the 1993 book "Optimization Software Guide"
by Jorge J. More' and Stephen J. Wright (information reproduced on the
Web by kind permission of SIAM Publications).

We have expanded and updated the guide to reflect recent changes in the
field. Please send comments (including suggested additions to the Guide)
to us at

The Software Guide is part of the NEOS Guide, an online source for
optimization info. NEOS is the core project of the Optimization Technology
Center (Argonne and Northwestern).

Steve Wright
Tim Wisniewski
Joe Czyzyk


From: Steve McCormick <>
Date: Mon, 13 May 1996 12:19:27 -0600
Subject: Proceedings of Copper Mountain Conference

The Proceedings of the 1995 Copper Mountain Conference on Multigrid Methods
should go to the printer very soon. To receive a copy (or copies),
please send e-mail to N. Duane Melson at the NASA Langley Research Center
( and specify how many copies you want and your
complete mailing address. Please include your phone number and e-mail
address in case there is a need to contact you.
There is no charge for the Proceedings.

N. Duane Melson
(804) 864-2227

Mail Stop 128
NASA Langley Research Center
Hampton, VA


From: Jack Dongarra <>
Date: Sat, 18 May 1996 10:06:15 -0400
Subject: ScaLAPACK Software Update

The ScaLAPACK project is a collaborative effort between:
Oak Ridge National Laboratory Rice University
University of Tennessee University of California, Berkeley
University of California, Los Angeles University of Illinois

The ScaLAPACK project is made up of 4 components:
dense matrix software (ScaLAPACK)
large sparse eigenvalue software (PARPACK)
sparse direct systems software (CAPSS)
preconditioners for large sparse iterative solvers (PARPRE)

ScaLAPACK, version 1.2, includes routines for the solution of linear
systems of equations, symmetric positive definite banded linear systems
of equations, condition estimation and iterative refinement, for LU and
Cholesky factorization, matrix inversion, full-rank linear least
squares problems, orthogonal and generalized orthogonal factorizations,
orthogonal transformation routines, reductions to upper Hessenberg,
bidiagonal and tridiagonal form, reduction of a symmetric-definite
generalized eigenproblem to standard form, the symmetric, generalized
symmetric and the nonsymmetric eigenproblem.

Software is available in single precision real, double precision real,
single precision complex, and double precision complex. The software has
been written to be portable across a wide range of distributed-memory
environments such as the Cray T3, IBM SP, Intel series, TM CM-5,
clusters of workstations, and any system for which PVM or MPI is available.
A draft ScaLAPACK Users' Guide and a comprehensive Installation Guide is
provided, as well as test suites for all ScaLAPACK, PBLAS, and BLACS routines.

Future releases of ScaLAPACK will include routines for the solution of
general banded linear systems, general and symmetric positive definite
tridiagonal systems, rank-deficient linear least squares problems,
generalized linear least squares problems, and the singular value
decomposition. Also available will be the full-index PBLAS, which will
have the majority of alignment restrictions removed, as well as the
ability to operate on partial first blocks. The next release of
ScaLAPACK is slated for Fall, 1996.

PARPACK (Parallel ARPACK) is an extension of the ARPACK software package
used for solving large scale eigenvalue problems on distributed memory
parallel architectures. The message passing layers currently supported
are BLACS and MPI. Serial ARPACK must be retrieved and installed prior to
installing PARPACK. All core ARPACK routines are available in single
precision real, double precision real, single precision complex, and double
precision complex. An extensive set of driver routines are available
for ARPACK and a subset of these are available for parallel computation with
PARPACK. These may be used as templates that are easily modified to construct
a problem specific parallel interface to PARPACK.

CAPSS is a fully parallel package to solve a sparse linear system of the form
Ax=b on a message passing multiprocessor; the matrix A is assumed to be
symmetric positive definite and associated with a mesh in two or three
dimensions. This version has been tested on the Intel Paragon and makes
possible efficient parallel solution for several right hand side vectors.

PARPRE is a package of parallel preconditioners for general sparse
matrices. It includes classical point/block relaxation methods,
generalized block SSOR preconditioners (this includes ILU), and domain
decomposition methods (additive and multiplicative Schwarz, Schur
complement). The communication protocol is MPI, and low level
routines from the Petsc library are used, but installing the complete
Petsc library is not necessary.

Funding for this effort comes in part from DARPA, DOE, NSF, and CRPC.
For more information on the availability of each of these packages and
their documentation, consult the scalapack index on netlib.
The URL is:
or type:
echo "send index from scalapack" | mail

Comments/suggestions may be sent to

Jack Dongarra


From: Evgeny Glushkov <>
Date: Tue, 14 May 96 16:27:38 +0300 (MSD)
Subject: Numerical Modelling in Solid Mechanics

Novel Computer Simulation Technique for Solid Mechanics

The proposed computer model is built upon the generalized theory of
irreversible deformation and fracture of the viscous/ elastic/
plastic/ brittle/ porous materials with local structure defects,
having its origin in the academician Novozhilov's basic ideas. The
theory is in accordance with the fundamental principles of Mechanics
but differs essentially from the usual approaches. It was shown that
infinite diversity of the material properties can be reduced to a
combinative variety of a finite number of possible mechanisms.
Namely, there are elasticity, visco-plasticity, fracture (i.e. cracks
appearance and domain partition), interface sliding, and interface
contact with joining (restoration of continuity). This set of
mechanisms made it possible, for example, to describe from the
general position both crack formation under tension and (being a
crucially new) multiple crushing under compression. Moreover, self
organization of microfractures phenomena were also discovered and
studied within the model. All deformation phenomena are considered
without any limitation on the displacement and rotation values
allowing one to compute both static and dynamic loading and to
examine non-stability phenomena in materials and constructions as

The model is notable for its physical clearness and comparative
mathematical simplicity. The first versions of the model realized as
a C++ code at the 486 PC were successfully verified with a number of
typical 2D and 3D samples and loading. For improving numerical
convergence and accuracy the so-called singular elements, carrying
required behavior at 2D and 3D (polyhedral) corner points, are
incorporated in the FEM/BEM schemes now. In the near future it is
supposed to adapt the code for Civil Engineering purposes
(antiseismic construction and reliability prognosis). The field of
application may be naturally extended, for example, to soil and rock
mechanics, ceramic engines and high-pressure vessels design,
stomatology, bone surgery, and so on.

Additional information in English may be found in the paper
Stoyan V.P. "Fracture surfaces as self organization of
microfractures", in Fractal reviews in the Natural and Applied
Sciences/ edited by Miroslav M. Novak, Charman & Hall, London -
Glasgow, 1995, 121-132.

and obtained directly from

Drs. Vladimir Stoyan and Evgeny Glushkov
Institute for Mechanics and Applied Mathematics
Kuban State University
P.O. Box 4102
350080, Krasnodar, RUSSIA
E-mail: evg@


From: Gunter Faust <>
Date: Mon, 13 May 1996 11:40:53 +0100
Subject: European Multigrid Conference

Fifth European Multigrid Conference (EMG'96)
October 1 - 4, 1996, University of Stuttgart, Germany

Chairmen: Wolfgang Hackbusch, Kiel
Gabriel Wittum, Stuttgart

Topics: Multigrid Methods:
robustness, adaptivity, wavelets, parallel methods and software,
applications in computational fluid dynamics, porous media flow,
optimisation, computational mechanics and statical physics.

Invites speakers:
R. Bank (La Jolla), W. Dahmen (Aachen), P. Deuflhard (Berlin),
M. Griebel( Munich), P.W. Hemker (Amsterdam), R. Kormhuber (Berlin),
U. Langer (Linz), G. Mack (Hamburg), J. Mandel (Boulder),
D.Mavriplis (Ames), A. Reusken (Eidhoven), K. Stueben (Bonn)

Abstracts: Please send an abstract of your proposed lecture by June 1st, 1996.
The collection of abstracts will be available at the conference.
Notice of acceptance will be given by July 15th, 1996.

Please register via
Registration is valid only after full payment of the conference fee.

Conference fee:
DM 400,- payable by Aug. 1st 1996 or
DM 500,- after this date.

Further information and registration at URL:

Thank you in advance

Gunter Faust
Tel.: ++49-711-685 3668


From: Michel Fortin <>
Date: Tue, 14 May 96 09:02:32 EDT
Subject: Summer Seminar Plates and Shells

Summmer Seminar on Plates and Shells,
July 22 to July 26,
Laval University,
Quebec city, Canada.

The preliminary programme is now available on the web site

We recall that invited speakers are D. N. Arnold, K.J. Bathe, M. Bernadou,
F. Brezzi, M. Delfour, G. Dhatt, F. el Khebi, J. Pitkaranta,A. Raoult,

For any information, contact


From: Are Magnus Bruaset <>
Date: Wed, 15 May 1996 16:00:13 +0200
Subject: Workshop on Modern Software Tools

International Workshop on Modern Software Tools
for Scientific Computing


This workshop will be arranged by SINTEF Applied Mathematics and the
University of Oslo. It will take place September 16-18, 1996 in Oslo,
Norway. A book based on carefully selected contributions to the workshop
is planned for publication by Birkhauser.

For further information, see the workshop home page at

or the announcement in NA Digest (vol. 96, issue 13) dated March 31.

Deadline for submission of abstract: Jun 1, 1996
Deadline for registration: Jun 25, 1996

Email address:

On behalf of the Organizing Committee

Are Magnus Bruaset
SINTEF Applied Mathematics


From: Jerzy Wasniewski <>
Date: Fri, 17 May 1996 17:00:58 +0200 (METDST)
Subject: Workshop on Applied Parallel Computing

August 18-21, 1996
Lyngby, Copenhagen, Denmark

The PARA96 Website has been updated, introduced several new paragraphs.
General information, on-line registration, on-line hotel reservation are
added. See the www address, please:

There are still possibility to submit a short abstract either for a 20
minutes communication or for a poster. The dead line, June 15 is very
close. The ASCII registration and hotel reservation document can be sent
on request.

Best regards,


From: Pekka Neittaanmaki <>
Date: Tue, 14 May 1996 14:33:09 +0300
Subject: Position at University of Jyvaskyla, Finland

Call for Professorship in Telecommunication

The University of Jyvaskyla in cooperation with Telecom Finland seeks
Professor position for its new Telecommunications Program (TP) for
teaching, research and development. The successful candidate must
demonstrate a strong commitment to graduate education and research
projects in Master School in Information Technology. Additionally, he/she
is expected to develop a skillful research program in partnership with
Telecom Finland. This is due to the fact that Telecom Finland has created
a telecommunications environment which represents the state of the art by
any comparison and acts as a pioneer and "field laboratory" in European
telecommunications. Telecom Finland's optic trunk network covers the
whole country while broadband SDH technology enables the construction of
the Information Super-highway with fast ATM services. The company's
representatives also participate in important quality standardisation
organisations like ISO 9000, EOQ and EFQM. Telecom Finland experts have
developed new ATM specifications, which are applied internationally.
Telecom Finland's digital mobile network is growing fast and already
offers short message and data transfer services.
The mobile network will also become broadband. Among the achievements of
Telecom Finland, it could be counted:

Intelligent, customer oriented services;
Centralised network management (Network Management Centre is in


From: Fabian Wirth <>
Date: Fri, 17 May 1996 16:32:33 +0200 (MET DST)
Subject: Positions at University of Bremen, Germany

Subject to funding three positions will be advertised by the
University of Bremen, Germany. The following texts are preliminary and
do not constitute the official advertisement of the positions. Those
interested should check the job search services of "Die Zeit" or
"Times Higher Education Supplement" in the near future. Both are
available on the net.

For further information contact Fabian Wirth, email:

The Department of Mathematics and Computer Science at the University
of Bremen is going to establish a Center for Technomathematics and
applications are invited for three full
professorships at the level C3 or C4 to teach this subject in the areas:

Technomathematics (C4) (Reference number: P 140/96)

Numerics of partial differential equations (C3) (Reference number: P

Methods of mathematical modelling (C3) (Reference number: P 142/96)

The successful applicants will become members of the Center for
Technomathematics. They will be expected to join in the development of
the curriculum in Technomathematics as well as initiate cooperation
with industry and other research institutions.

Duties include participation in teaching at both elementary and
advanced level, guidance of students during their practical projects
and the supervision of thesis projects in Technomathematics. The
language of instruction is German and it is expected that lectures
will be given in German after an appropriate time.

A. Technomathematics

The appointee should have substantial experience in research and
teaching in the area of Technomathematics and should have a tangible
record of successful cooperation with industry. Special
consideration will be given to applicants who have backgrounds in
systems and control theory or signal processing.

B. Numerics of partial differential equations

Applicants should most preferably have a strong research record in
the area of numerics for partial differential equations. In view of
the intended cooperation with the departments of Electrical
Engineering, Mechanical Engineering or Geosciences special
consideration will be given to applicants who have backgrounds in
the areas of computational fluid dynamics or computational

C. Methods of mathematical modelling

The appointee should have a strong research record in the
development and application of mathematical models for technical
problems. Special consideration will be given to applicants who
have backgrounds in the areas of partial differential equations or

Apart from regulations determined by German law necessary
qualifications for all three positions consist of a relevant
habilitation or equivalent scientific achievements as well as teaching

The university intends to raise the proportion of female scientific
personnel and therefore especially encourages qualified women to

Written applications quoting reference number, telephone number,
qualifications and experience should be sent to Universitaet Bremen,
Fachbereich 3, Postfach 330440, 28334 Bremen, Germany.


From: Teresa Head-Gordon <>
Date: Thu, 16 May 1996 12:53:37 -0700
Subject: Postdoctoral Position at Lawrence Berkeley Laboratory

We seek a postdoctoral candidate with a Ph.D. within the last four years in
computer science, math, or chemistry to work on global optimization approaches
to protein structure prediction. Candidate will be responsible for parallel
programming on a T3E, scientific input in the areas of neural networks and new
optimization methods, as well as scientific writing and presentations. Fluency
in C++ or Fortran, and parallel programming skills required. Knowledge of
chemistry is preferred. Candidate will interact with groups from LBNL/NERSC,
UCB Math dept., and U. Colorado, Boulder CS dept. Start date is October 1,
1996. Please contact Dr. Teresa Head-Gordon, Life Sciences Division, E. O.
Lawrence Berkeley National Laboratory, Berkeley, California 94720


From: SIAM <>
Date: Mon, 13 May 96 09:09:30 EST
Subject: Contents, SIAM Control and Optimization

Control and Optimization
JULY 1994 Volume 34, Number 4
Infinite-Horizon Variational Problems with Nonconvex Integrands
Arie Leizarowitz and Alexander J. Zaslavski
Copositivity and the Minimization of Quadratic Functions with Nonnegativity and
Quadratic Equality Constraints
J. C. Preisig
Perturbed Optimization in Banach Spaces I: A General Theory Based on a Weak
Directional Constraint Qualification
J. Frederic Bonnans and Roberto Cominetti
Perturbed Optimization in Banach Spaces II: A Theory Based on a Strong
Directional Constraint Qualification
J. Frederic Bonnans and Roberto Cominetti
On Finite-Gain Stabilizability of Linear Systems Subject to Input Saturation
Wensheng Liu, Yacine Chitour, and Eduardo Sontag
On Some Relations Between Chaney's Generalized Second-Order Directional
Derivative and That of Ben-Tal and Zowe
L. R. Huang and K. F. Ng
Consistent Approximations for Optimal Control Problems Based on Runge-Kutta
A. Schwartz and E. Polak
On L^2 Sufficient Conditions and the Gradient Projection Method for Optimal
Control Problems
J. C. Dunn
Large-Time Local Controllability via Homogeneous Approximations
Henry Hermes
Equivalent Subgradient Versions of Hamiltonian and Euler-Lagrange Equations in
Variational Analysis
R. Tyrrell Rockafellar
An A Priori Estimate for Discrete Approximations in Nonlinear Optimal Control
Asen L. Dontchev
A Nevanlinna-Pick Approach to Time-Domain Constrained H_infinity Control
Hector Rotstein
Partially Observed Differential Games, Infinite-Dimensional
Hamilton-Jacobi-Isaacs Equations, and Nonlinear H_infinity Control
M. R. James and J. S. Baras
Inverse Optimality in Robust Stabilization
R. A. Freeman and P. V. Kokotovic
The Structured Singular Value for Linear Input/Output Operators
Hari Bercovici, Ciprian Foias, and Allen Tannenbaum
A Turnpike Theory for Infinite-Horizon Open-Loop Competitive Processes
D. Carlson and A. Haurie
The Generalized Solutions of Nonlinear Optimization Problems with Impulse
Boris M. Miller
A Differential Game with Two Players and One Target
Pierre Cardaliaguet
Information Capacity of Channels with Partially Unknown Noise. II.
Infinite-Dimensional Channels
C. R. Baker and I.-F. Chao


From: E. B. Saff <>
Date: Thu, 16 May 1996 12:18:51 -0400
Subject: Contents, Consttructive Approximation

Table of Contents: Const. Approx., Vol. 12, No. 2, 1996

161 F. Peherstorfer
A Special Class of Polynomials Orthogonal on the Unit Circle
Including the Associated Polynomials

187 E. B. Belinskii
Strong Summability of Fourier Series of the Periodic Functions
from H^p (0 < p <= 1)

197 M. Gugat
An Algorithm for Chebyshev Approximation by Rationals with
Constrained Denominators

223 P. Borwein, E. A. Rakhmanov, and E. B. Saff
Rational Approximation with Varying Weights I

241 Z. Ditzian
Polynomial Approximation in L_p(S) for p > 0

271 B. Della Vecchia
Direct and Converse Results by Rational Operators

287 A. B. J. Kuijlaars
The Role of the Endpoint in Weighted Polynomial Approximation
with Varying Weights


303 A. P. Magnus
Painleve Equations for Semiclassical Recurrence Coefficients:
Research Problems 96-2


From: Arieh Iserles <>
Date: Fri, 17 May 96 16:54:09 BST
Subject: Contents, Acta Numerica

The contents of Acta Numerica 5 (1996) are

Randolph E. Bank
"Hierarchical bases and the finite element method"

Walter Gautschi
"Orthogonal polynomials: Applications and computation"

William D. Henshaw
"Automatic grid generation"

Adrian Lewis and Michael L. Overton
"Eigenvalue optimization"

Mitchell Luskin
"On the computation of crystalline microstructure"

Ulla Miekkala and Olavi Nevanlinna
"Iterative solution of systems of linear differential equations"

James A. Sethian
"Theory, algorithms, and applications of level set methods for
propagating interfaces"

Further information is available at the WWW home page of Acta


End of NA Digest