## NA Digest Sunday, March 12, 1995 Volume 95 : Issue 11

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

### Submissions for NA Digest:

Mail to na.digest@na-net.ornl.gov.

Mail to na.help@na-net.ornl.gov.

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

From: Robert Skeel <skeel@mac.cie.uva.es>
Date: Mon, 6 Mar 95 18:05:34 +0100
Subject: Spanish Science and Technology Prize to J.M. Sanz-Serna

March 3rd it was announced that J.M. Sanz-Serna is the winner of the

Third IBERDROLA SCIENCE AND TECHNOLOGY Prize

given annually to a Spanish researcher for contributions enriching
physics, chemistry, mathematics, or engineering. The selection of the winner
was made by an international committee that included three Nobel prize winners.
The award includes 12 million pesetas for the winner and a grant of
2 million pesetas to enable a student to start work on a research project
supervised by the winner. (Iberdrola is an electric power company of
Spain.)

Sanz-Serna works on stability and long-time behavior of numerical solutions of
ordinary and partial differential equations, especially Hamiltonian systems,
and, for example, has contributed heavily to a theory for symplectic methods of
general applicability.

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

From: Alan Karp <karp@hplahk2.hpl.hp.com>
Date: Wed, 8 Mar 1995 14:09:43 -0800

I am conducting a survey of those people who need more precision than
provided by IEEE double precision. I would appreciate any insight you
might have from your PERSONAL experience. (We've got lots of hearsay
evidence; I want something admissable in court.)

1. Is your need met by a 64-bit mantissa?

2. If you need more than 64 bits in the mantissa, how many more do you
need?

3. How important is the performance of the extra precision part of

4. At what ratio of performance to double precision would you consider
using higher precision more often - never, only if the performance
were the same as double precision, 2x slower, 10x slower, up to
100x slower (e.g., I can't do without it)?

A brief, 100 words or less, summary of your application, why more
precision is needed, and where the extra precision is needed (if not
throughout) would be appreciated.

If I get enough responses, I'll post a summary.

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

Date: Mon, 6 Mar 95 15:03:30 MET
Subject: Looking for Brezis's Operateurs Maximaux Monotones

I would like to buy a copy of

Operateurs Maximaux Monotones et Semi-Groupes de Contractions dans
les Espaces de Hilbert

by Haim Br\'ezis, North Holland, 1973, which is out of print. If anyone
has a copy they would be willing to part with, please e-mail me.

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

From: Jiming Liu <jiming@seas.gwu.edu>
Date: Sun, 5 Mar 1995 13:43:45 -0500 (EST)
Subject: Survey in Sensitivity Analysis

Dear Colleagues:

We are conducting a brief survey of activity in optimization
methodology sensitivity analysis, both in theory and practice.
Your response to the following items would be of great interest
and is requested by 25 March 1995.

Anthony V. Fiacco Jiming Liu
Department of Operations Research AT&T Bell Laboratories
George Washington University RM 2L-320
Washington DC 20052 101 Crawfords Corner
Holmdel, NJ 07733-3030

e-mail: jiming@seas.gwu.edu, jiming@kingfish.att.com
^^^^^^

Survey on sensitivity analysis in optimization

3. Specific area of your personal interest
4. Your relevant works + reference list
5. Most important theoretical results obtained in the area, in
6. Most useful practical results and applications that you know
7. Future research needed
8. Software available or needed and expected impact
9. Major impediments to widespread practical + commercial use of
optimization techniques and sensitivity analysis

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

From: S. S. Ravindran <ravindra@cs.sfu.ca>
Date: Mon, 6 Mar 95 07:50:47 PST
Subject: 3-D Finite Element Programs

Dear Subscribers:

I am looking for a 3-D Finite element Navier Stokes
Solver and a 3-D Grid generation program.

Could someone please tell me where I can get
any these programs.

Regards,
Ravindran, S. S.
Center for Research in Scientific Computation
North Carolina State University
Raleigh, NC27695 - 8205

Email: ravi@crsc1.math.ncsu.edu
Ph: 919 515 3310

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

From: Jie Shen <shen_j@math.psu.edu>
Date: Thu, 9 Mar 1995 12:24:26 -0500
Subject: Fast Algorithm Sought for (Eigen) Matrix-vector Product

Dear Colleagues,

I am looking for a fast algorithm/software for computing the product
of the matrix, formed by the eigenvectors of a symmetric tridiagonal
matrix, with an arbitrary vector. Let N be the order of the matrix, are
there any O(N) or O(N log N) algorithms available for this purpose ?

Jie Shen

Department of Mathematics (office) 814-863-2036
Penn State University (fax) 814-865-3735
University Park, PA 16802 (e-mail) shen_j@math.psu.edu

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

From: Robert van de Geijn <rvdg@cs.utexas.edu>
Date: Tue, 7 Mar 1995 16:43:35 -0600
Subject: InterCom Release R2.0.0 for Paragon

It is our pleasure to announce the second release of the
Interprocessor Collective Communications (InterCom) Library, iCC
release R2.0.0. This library is the result of an ongoing
collaboration between David Payne (Intel SSD), `Lance Shuler (Sandia
National Laboratories), Robert van de Geijn (University of Texas at
Austin), and Jerrell Watts (California Institute of Technology),
funded by the Intel Research Council, and Intel SSD. Other
collaborators on this project have included Mike Barnett (University
of Idaho), Satya Gupta (Intel SSD), Prasenjit Mitra (now with Oracle)
and Rik Littlefield (PNL).

The library implements a comprehensive approach to collective
communication. The results are best summarized by the following
performance table, representative of improvements obtained on a 16 X
32 Paragon, running under R1.2 of the O/S, with iCC R2.0.0:

vector NX InterCom ratio
Operation length (sec) (sec) (NX/InterCom)
_________________________________________________________________
Broadcast 8 bytes 0.0017 0.0014 1.21
64K bytes 0.0356 0.0069 5.18
1M bytes 0.5788 0.0493 11.75

Global Sum 8 bytes 0.0032 0.0029 1.10
to all 64K bytes 0.3780 0.0195 19.35
1M bytes 5.9353 0.1791 33.15

Similar, or better, improvement is obtained under OSF R1.3, iCC
R2.0.0. Attaining the improvement in performance is as easy as
linking in a library that automatically translates NX collective
communication calls to iCC calls. Furthermore, the iCC library gives
additional functionality like scatter and gather operations, and more
general "gopf" combine operations. As had been planned, an MPI-like
group interface to iCC is now also available.

or check netlib, directory intercom

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: Jerome Laurens <laurens@u-bourgogne.fr>
Date: Thu, 9 Mar 1995 12:56:11 +0000
Subject: Linear Hyperbolic Systems of PDE's

Dear NA-Neters,

I am interested in references (books, articles, reports..) to any theoretical
result about linear hyperbolic systems of PDE's like

E.dW/dt + A1.dW/dx1 + A2.dW/dx2+...+An.dW/dxn = 0

where W is the unknown vector of functions of t and x=(x1,...,xn), E,
A1, ... An are square matrices.
My purpose is to collect any information about the solutions (existence,
uniqueness for the Cauchy problem...) especially in a weak sense (in the space
of distributions for example) and/or when the coefficients E, Ai are non smooth
functions of t and x. I will first consider the free space, with no boundary
conditions (in space).

Yours,

LAURENS Jerome
Analyse Appliquee & Optimisation tel: (33) 80 39 58 76
Departement de Mathematiques fax: (33) 80 39 58 90
Universite de Bourogogne e-mail:laurens@satie.u-bourgogne.fr
BP 134
F-21004 DIJON Cedex
FRANCE

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

From: Peter Pacheco <peter@mobydick.usfca.edu>
Date: Wed, 8 Mar 95 13:34:31 PST
Subject: Numerical Linear Algebra on Parallel Processors

Reminder:
NSF-CBMS Regional Conference in the
Mathematical Sciences:

Numerical Linear Algebra on Parallel Processors

University of San Francisco
June 12-16, 1995

The principal lecturer will be Professor James Demmel of the University of
California, Berkeley. For further information, contact Peter Pacheco,
Department of Mathematics, University of San Francisco, 2130 Fulton Street,
San Francisco, CA 94117, email: peter@usfca.edu, phone: (415) 666-6630,
fax: (415) 666-2346.

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

From: Chris Walshaw <C.Walshaw@greenwich.ac.uk>
Date: Fri, 10 Mar 1995 16:07:26 +0000 (GMT)
Subject: JOSTLE - Unstructed Mesh Partitioning Software

We would like to announce the release of the JOSTLE software package
for partitioning unstructured meshes for use on distributed memory
parallel computers. Executables of the software are freely available
for academic and research purposes, but interested users are required
to sign a licencing agreement.

The code is designed to partition unstructed meshes (for example,
finite element or finite volume meshes) and can also be used to
repartition existing partitions (such as those deriving from adaptive
refined meshes).

You can get a copy of the licence either via the WWW from
http://www.gre.ac.uk/~wc06/jostle/licence.ps.gz

or I can email you a (gzipped uuencoded postscript) copy or I can put
a hardcopy in the post. Although the licence may seem a bit stringent,
its purpose is to prevent resale or commercial exploitation.
We strongly want to encourage the use of the software, however, and
would be keen to work on collaborations, etc. We are also interested
in supporting commercial exploitation, although under different licencing
arrangements. Send the completed licence to me and I will mail you
a copy of the package.

Executables are available for various machines including Suns
(SPARC compiler), Suns (sun4 compiler), Silicon Graphics Indigo and IBM
RS6000. Please let me know which version(s) you require (you can have
more than one under the same licence).

You can find out more about the underlying algorithms from the technical
report:

C. Walshaw, M. Cross, and M. Everett.
A Parallelisable Algorithm for Optimising Unstructured Mesh Partitions.

The paper can be obtained via WWW from the URL:
http://www.gre.ac.uk/~wc06/papers/ps/Walshaw95.ps.gz

although if you have any difficulty in obtaining it, I'll be happy
to send you a copy, either by post or electronically.

Two other papers on the same topic and with further results are:--

C. Walshaw, M. Cross, S. Johnson, and M. Everett.
A Parallelisable Algorithm for Partitioning Unstructured Meshes.
In: Proc. Irregular '94: Parallel Algorithms for Irregularly
Structured Problems (in press), 1994.

C. Walshaw, M. Cross, S. Johnson, and M. Everett.
JOSTLE: Partitioning of Unstructured Meshes for Massively Parallel
Machines.
(submitted for the Proceedings, Parallel CFD'94, Kyoto), 1994.

Chris Walshaw

Dr. C. H. Walshaw,
School of Maths, Stats and Computing, email:- C.Walshaw@gre.ac.uk
The University of Greenwich, Tel:- (UK) + 181-331 8142
Wellington Street, Woolwich, FAX:- (UK) + 181-331 8665
London, SE18 6PF.
United Kingdom

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

From: Jose D. P. Rolim <rolim@cui.unige.ch>
Date: Mon, 13 Mar 1995 10:59:04 +0100
Subject: Special Issue on Parallelism and Irregularly Structured Problems

CALL FOR PAPERS
THEORETICAL COMPUTER SCIENCE JOURNAL
Special Issue on
PARALLELISM AND IRREGULARLY STRUCTURED PROBLEMS

Extensive research has been carried out concerning different ways for
the automatic extraction of parallelism of several problems. Acceptable
solutions have been found to many problems but others still lack efficient
and automatic methods for their solution and remain open to research in
parallel algorithms. Among this latter category, we can often recognize
irregularly structured problems that resist both automatic and manual
parallelization.

Aiming to foster research in this challenging domain, the journal
Theoretical Computer Science} is planning the publication of a special
issue on Parallelism and Irregularly Structured Problems before the
end of 1995.

Papers describing original results and high quality survey papers are
solicited in all areas related to parallelism and irregular problems,
such as (non-exhaustive):

* approximated algorithms
* automatic synthesis
* branch and bound
* combinatorial optimization
* compiling
* computer vision
* computational molecular biology
* parallel data structures
* randomized methods
* sparse matrix computation
* scheduling and mapping
* symbolic computation

Papers will be carefully refereed to meet the high standard of publication
of Theoretical Computer Science.
Contributions must be submitted in 6 copies and reach one of the editors at
the addresses below before March 31st, 1995.

Afonso Ferreira Jose Rolim
TCS Guest Editor TCS Guest Editor
LIP CUI
ENS Lyon Universite de Geneve
46 allee d'Italie 24 rue General Dufour
F 69364 Lyon Cedex 07 CH 1211 Geneve 4
France Switzerland

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

From: Donna DiLisi <ddilisi@siam.org>
Date: Mon, 06 Mar 95 10:20:03 EST
Subject: The Richard C. DiPrima Prize

CALL FOR NOMINATIONS
FOR
THE RICHARD C. DiPRIMA PRIZE

The DiPrima Prize

SIAM will present the award at the SIAM Annual Meeting in July 1996. The award
honors the memory of Richard C. DiPrima, long-time Chair of the Department of
Mathematical Sciences at Rensselaer Polytechnic Institute and past-president and
energetic supporter of SIAM. The award, to be given to a young scientist, will
be based on an outstanding doctoral dissertation in applied mathematics.

Nominations

Nominations, along with a copy of the dissertation (in English), should be sent
by December 31, 1995 to:

Richard C. DiPrima Prize
c/o Donna DiLisi
Society for Industrial and Applied Mathematics
3600 University City Science Center

Eligibility

The award based on Ph.D. research in applied mathematics (defined as those
topics covered in SIAM journals or series) is made to a young scientist . The
Ph.D. thesis and all other Ph.D. requirements should have been completed in the
time period from July 1, 1993 to June 30, 1995. The Ph.D. degree must be
awarded by December 31, 1995.

Description of the Award

The award will consist of a certificate and a cash prize of \$1,000, which will
be awarded when a paper based on the Ph.D. thesis is accepted for publication by
the editors of a SIAM journal or series. The president will notify the
recipient of the award in advance of the award date and invite the recipient to
attend the annual meeting to receive the award.

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

From: Owe Axelsson <axelsson@sci.kun.nl>
Date: Sun, 5 Mar 1995 16:29:50 +0100
Subject: Algebraic Multilevel Iteration Methods

Special Issue of NLA
Announcement of a conference and
call for papers

ALGEBRAIC MULTILEVEL ITERATION METHODS
WITH APPLICATIONS

University of Nijmegen, The Netherlands
June 13-15, 1996

Prof. Owe Axelsson
Faculty of Mathematics and Informatica
Toernooiveld 1, NL-6525 ED Nijmegen
The Netherlands
e-mail: axelsson@sci.kun.nl
neytchev@sci.kun.nl
fax: 31(0)80652140

PROGRAM COMMITTEE:
Owe Axelsson, Nijmegen, The Netherlands
Dietrich Braess, Bochum, Germany
Tony F. Chan, Los Angeles, California
Richard E. Ewing, College Station,Texas
Wolfgang Hackbusch, Kiel, Germany
Piet Hemker, Amsterdam, The Netherlands
Yuri A. Kuznetsov, Moscow, Russia
Ulrich Langer, Linz, Austria
Jean-Francois Maitre, Lyon, France
Panayot S. Vassilevski, Sofia, Bulgaria
David M. Young, Austin, Texas , honorary member
Harry Yserentant, Tubingen, Germany

Local Organization Committee:
Owe Axelsson, Maya Neytcheva, Mariana Nikolova, Ben Polman.

SCOPE:
The purpose of the conference is to provide a forum for the presentation
and the discussion of recent progress in the analysis, implementation and
applications in various fields of algebraic multilevel iteration methods in
a broad sense. This includes their implementation on massively parallel
computers.

Topics covered include Algebraic Multilevel Iteration methods for
- second and fourth order elliptic scalar equations and systems of
equations,
- mixed variable variational problems,
- nonselfadjoint problems and indefinite matrix problems,
- inner-outer iteration methods,
- parallel implementations, efficiency measures, scalability,
- robust implementations, i.e. convergence uniform with respect to meshsize
parameter and singular perturbation parameters,
- applications for Navier's equations and Stokes problem,
- applications outside partial differential equation problems,
- applications for nonlinear problems, such as electromagnetic field,
plastic flow, Navier-Stokes, and Miscible displacement problems.

CALL FOR PAPERS
Papers intended for presentation at the conference should be submitted to
Owe Axelsson. All papers should be delivered in a LaTeX format preferably
using the style file macros provided by the publisher (Wiley) of the
journal of Numerical Linear Algebra with Applications and submitted either
by electronic mail or on a floppy disk. The submission should be
accompanied by a printout sent by ordinary mail. The papers accepted for
presentation at the conference are planned to appear in a proceedings
volume ready for the conference. Authors who are unable to produce a paper
in LaTeX format are requested to contact the organizers.
Some selected papers of original content will be considered for publication
in a special issue of Numerical Linear Algebra with Applications.
All papers will be refereed according to the editorial policy of the journal.
Papers accepted for the journal are planned to appear in an issue three to
six months after the conference.

CALENDER:
Deadline for submission of full papers: August 31, 1995
Referee reports due: December 15, 1995
Notification of acceptance: December 21, 1995
Deadline for submission of amended manuscripts: February 29, 1996
Notification of final acceptance: April 15, 1996

GENERAL INFORMATION:
The conference will take place from June 13-15, 1996 at the University of
Nijmegen, Nijmegen, The Netherlands.
The conference language will be English.
The registration fee will be 600,- (currently \$ 350) and includes a copy
of the conference proceedings, two lunches and coffee and tea during breaks.

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

From: S. P. Shary <Shary@intra.krasnoyarsk.su>
Date: Mon, 6 Mar 1995 13:19:36 +0300
Subject: Siberian School on Computational Mathematics

Siberian Department
Krasnoyarsk Computer Center
Novosibirsk Computer Center

IX ALL - SIBERIAN SCHOOL ON COMPUTATIONAL MATHEMATICS

Krasnoyarsk Computer Center and Novosibirsk Computer Center organize
IX-th All-Siberian School on Computational Mathematics in the settlement
of Shushenskoe (the south of Krasnoyarsk region), July 10-14, 1995.

At the School, both lectures and regular talks are planned on the following
subjects:

1. Numerical solution of multidimensional boundary-value problems

2. Processing of the digital signals

3. Setting up an open telecommunication server on numerical analysis

All communications, requests, claims for the participation (with the titles
of potential presentations) should be directed to

Prof. Sergey M. Bersenev
Krasnoyarsk Computer Center
660036 Krasnoyarsk
Russia
Phone: (3912) 494-835
E-mail: shush9@intra.krasnoyarsk.su
shush9@cckr.krasnoyarsk.su

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

From: Laura Varpula <iss5@tukki.jyu.fi>
Date: Mon, 6 Mar 1995 15:12:48 +0200 (EET)
Subject: Summer School in Finland

The University of Jyvaskyla, Finland, is organizing

THE 5th INTERNATIONAL SUMMER SCHOOL

31 July - 25 August 1995.

What is the International Summer School?

The aim of the International Summer School is to offer

What is the programme of the Summer School?

The programme of the 5th International Summer School
consists of courses on the following topics:

Applied mathematics:
Nonlinear systems and optimal control
Finite element method for PDEs
Optimal control of elliptic systems and applications
Neural networks and pattern recognition
Nonlinear dynamical systems, fractals and chaos
Stability and control of dynamical systems

Computer science
Mathematics
Statistics
Biology
Physics
Chemistry

How to apply for the Summer School?

To apply for the 5th International Summer School
please fill in the application form
(http://www.math.jyu.fi/summerschool.html)
and send it to the organizers by 31 March 1995.

What are the costs?

There is no tuition fee for the Summer School.
Housing and living expenses and travel costs
are the responsibility of each participant.

The 5th International Summer School
Faculty of Mathematics and Natural Sciences
P.O. Box 35
FINLAND

Phone: +358 41 602 205
Fax: +358 41 602 201
E-mail: iss5@tukki.jyu.fi
WWW: http://www.math.jyu.fi/summerschool.html

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

From: Gene Golub <golub@sccm.Stanford.EDU>
Date: Tue, 7 Mar 95 11:57:48 PST
Subject: Summer Conference in Utah

This is an update to the Park City Conference
on Real Number Algorithms July 17 - Aug 11.

Previous information was given in the Notices of the
Amer. Math. Soc. in Sept, Oct, Nov, 1994.

To: Participants in the AMS-SIAM Summer Seminar on Mathematics of
Numerical Analysis: Real Number Algorithms

Here is some information for those interested in reserving a room for
the seminar. Official letters of invitation, including offers of
support where applicable, and brochures of the hotel and Park City
area are scheduled to be mailed around April 1.

Hotel or studio rooms are \$45 single/double, \$50/triple, and
\$55/quadruple (prices are per room NOT per person) and include one or
two queen-sized beds. Hotel rooms include a microwave oven and
mini-refrigerator; studio units have kitchenettes. All units have
coffee makers. NOTE: if you cancel your reservation after JUNE 16,
1995 or if you do not show up for your reservation, YOU MUST PAY THE
FULL AMOUNT OF THE ROOM CHARGE FOR THE RESERVED PERIOD (it will be

One-, two-, or three-bedroom condominium units may be reserved on a
space-available basis. Most condominium units are on the third (top)
floor of the eight buildings that form the hotel complex. Actual
availability will not be known until mid-April, when condo owners will
make commitments. Condo units will be available only for the full
four weeks of the seminar.
The flat 28-day rates are:      1-bedroom: \$1,400
2-bedroom: \$1,680
3-bedroom: \$1,820
For condominium units, if you do not cancel and do not show, a penalty
of one night's lodging plus tax will be assessed against your credit
card. If you cancel at least one day ahead of your scheduled arrival,
there is no cancellation penalty.

Note that there will be 10.13% tax added to hotel, studio, and
condominium rates. (Any participant who stays for 30 days or longer
will not be charged tax). Daily maid service is not included. Linen
change for hotel rooms is twice weekly. All reservations must be
guaranteed by credit card. Please call the Inn at Prospector Square
at 800-453-3812 or 801-649-7100 and ask for Cindy in group
reservations. Be sure to mention that the reservation is for the
Mathematics of Numerical Analysis seminar and the group rate applies.
You may also fax your reservation to 801-649-8377 (be sure to include
payment must be made upon checkout. Partial reimbursement of
travel/subsistence expenses will be made approximately four weeks
after the conclusion of the seminar for those for whom funds have been
authorized by the organizing committee.

A list of those who have requested roommates is being compiled; names
and addresses of all of these individuals will be circulated with the
official letter of invitation so that you may contact each other to
make arrangements. Roommates will NOT be assigned by the hotel or by
the Seminar coordinator in Providence. Again, letters of invitation
should be mailed around April 1.

Let me know if you have any problems or need more information.
Regards,
Donna Salter
Seminar Coordinator

Week 1 refers to July 17-22; Week 2 refers to July 23-29;
Week 3 refers to July 30- August 5; Week 4 refers to August 6-11.

Week Topic Organizers

1 Algebra for solving real polynomials P.Pedersen and J.Renegar

2 Theory of continuous optimization H.Th.Jongen and J.Renegar

2 Statistics D.Donoho and H.Wozniakowski

3 Numerical linear algebra J.Demmel and G.Golub

3 Continuation E.Allgower and H.Keller

3 Real number machines F.Cucker and M.Shub

3 Interaction of numerical analysis A.Iserles
and non-linear dynamical systems

3 Information-based complexity J.Traub and H.Wozniakowski

4 Approximation theory R.DeVore and H.Wozniakowski

4 Fast algorithms and quadrature V.Rokhlin and J.Strain

4 Numerical algorithms with automatic U.Kulisch
result verification

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

From: Trini Flores <flores@siam.org>
Date: Wed, 08 Mar 95 13:13:47 EST

SIAM
Society for Industrial and Applied Mathematics
3600 University City Science Center
Telephone: 215-382-9800
Fax: 215-386-7999
Gopher: gopher.siam.org
World Wide Web: http://www.siam.org
Conferences E-Mail: meetings@siam.org

DATES TO REMEMBER:

March 24, 1995: Deadline for Hotel Reservations
for attendees and participants --
Third SIAM Conference on Control and Its
Applications, April 27-29, 1995, St. Louis, MO
Tel. 314-241-7400 Fax: 314-241-9839

Third SIAM Conference on Control and Its
Applications, April 27-29, 1995, St. Louis. MO

April 14, 1995: Deadline for submission of Short Course
proposals for the 1995 SIAM Annual Meeting,
October 23-26, 1995, Charlotte, NC.

April 14, 1995: Deadline for submission of Minisymposium
proposals for the 1995 SIAM Annual Meeting,
October 23-26, 1995, Charlotte, NC.

April 28, 1995: Deadline for Hotel Reservations
for attendees and participants --
Third SIAM Conference on the Applications
of Dynamical Systems, May 21-24, 1995,
Snowbird, UT.
Contact Snowbird Ski and Summer Resort
Tel. 800-453-3000 (U.S. only), or
801-742-2222
Fax: 801-742-3300

SIAM. Telephone: 215-382-9800, E-Mail: meetings@siam.org

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

From: Gianni Di Pillo <erice@peano.dis.uniroma1.it>
Date: Thu, 9 Mar 1995 17:58:15 -0600
Subject: Optimization Conference in Sicily

Ettore Majorana Centre for Scientific Culture
International School of Mathematics "G. Stampacchia"
Erice, Italy

Final Announcement
21st workshop
NONLINEAR OPTIMIZATION AND APPLICATIONS
13 - 21 June 1995.

OBJECTIVES
The workshop aims to review and discuss recent advances and promising research
trends concerning theory, algorithms and innovative applications in the field
of Nonlinear Optimization. Both the finite and the infinite dimensional case
will be of interest.

TOPICS
Topics include, but are not limited to,

Constrained and unconstrained optimization
Convex analysis
Global optimization
Interior point techniques for linear and nonlinear programming
Large scale optimization
Linear and nonlinear complementarity problems
Nonsmooth optimization
Neural networks and optimization
Applications of nonlinear optimization

LECTURES
The workshop will include invited lectures and contributed lectures.
The invited lecturers are:

V. F. Demyanov
Y. G. Evtushenko
M. Fukushima
L. Grippo
J. J. Judice
O.L. Mangasarian
J. J. More'
J. Nocedal
J.-S. Pang
P. M. Pardalos
L. Qi
S. M. Robinson
R. T. Rockafellar
E. Spedicato
Ph. L. Toint
C. Zalinescu

HOW TO PARTICIPATE
Persons wishing to attend the workshop should write to:

Prof. Gianni Di Pillo
Dipartimento di Informatica e Sistemistica
Universita' di Roma "La Sapienza"
Via Buonarroti 12
00185 Roma, Italy
E-mail: erice@peano.dis.uniroma1.it

Closing date for application: 30 April 1995

Franco Giannessi Gianni Di Pillo
Director of the School Director of the Course

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

From: Nick Higham <higham@ma.man.ac.uk>
Date: Fri, 10 Mar 95 14:55:52 GMT
Subject: Manchester Linear Algebra Conference

THE INSTITUTE OF MATHEMATICS & ITS APPLICATIONS
In conjunction with the Manchester Centre for Computational Mathematics

Linear Algebra and Its Applications

Monday 10th to Wednesday 12th July, 1995
University of Manchester

The conference aims to cover the latest developments in numerical
linear algebra, matrix theory and applications of linear algebra.
It immediately follows ICIAM 95 in Hamburg.
The conference consists of two and a half days of invited and contributed
talks and posters, with an excursion on the Tuesday afternoon and a conference
dinner on Tuesday evening.

ORGANIZING COMMITTEE
N. J. Higham (Chairman, University of Manchester),
I. S. Duff (Rutherford Appleton Laboratory and CERFACS),
R. Fletcher (University of Dundee), T. L. Freeman (University of Manchester),
S. J. Hammarling (NAG Ltd., Oxford), N. K. Nichols (University of Reading).

INVITED SPEAKERS AND PROVISIONAL TITLES INCLUDE
40 MINUTE TALKS:
J. W. Demmel (Berkeley), ``Recent progress in serial and parallel algorithms
for the algebraic eigenvalue problem and singular value decomposition'';
G. H. Golub (Stanford);
P. C. Hansen (UNI.C, Denmark), ``Regularization of large-scale
discrete ill-posed problems'';
R. A. Horn (Utah), ``Hadamard products, unitarily invariant norms,
and perturbation bounds for the polar decomposition'';
G. Strang (MIT), ``Teaching of linear algebra'';
H. van der Vorst (Utrecht), ``A generalized Jacobi-Davidson iteration method
for linear eigenvalue problems'';
P. Van Dooren (CESAME, Louvain la Neuve), ``The Schur algorithm for Toeplitz
matrices'';
A. J. Wathen (Bristol), ``Iterative solution of large, sparse
linear systems arising in PDEs'';
M. H. Wright (AT&T Bell Labs), ``Something old, something new,
something borrowed: Connections between linear algebra and optimization''.

30 MINUTE TALKS:
Z. Bai (Kentucky), ``Adaptive block Lanczos algorithm for large scale
non-Hermitian eigenvalue problem'';
A. Edelman (MIT), ``From dense numerical linear algebra to
materials science to Riemannian geometry'';
N. I. M. Gould (Rutherford Appleton Lab.), ``Linear algebra in optimization'';
D. J. Higham (Dundee);
N. Mackey (Western Michigan University, Kalamazoo),
``Convergence of Jacobi-like methods for the symmetric eigenproblem'';
R. Mathias (College of William & Mary), ``Accurate eigenvalue computations'';
D. Ruiz (CERFACS),, ``Preconditioners for the block conjugate gradient
algorithm'';
B. Smith (UCLA);
G. Starke (Karlsruhe), ``Multilevel minimal residual methods''.

An application form to attend the conference is now available, from several
sources:

(1) The conference World-Wide Web page, with URL
http://www.ma.man.ac.uk/MCCM/laa95.html

(2) Anonymous ftp, with URL
ftp://vtx.ma.man.ac.uk/pub/laa95/applic.txt

(3) Mrs Pamela Bye, The Conference Officer,
The Institute of Mathematics and its Applications,
Catherine Richards House,
16 Nelson Street,
Southend-on-Sea, Essex, SS1 1EF, UK.
TEL. (01702) 354020. FAX. (01702) 354111.
EMAIL: IMACRH@V-E.ANGLIA.AC.UK

Note that all queries concerning the application form should be addressed to
the IMA at the address in (3).

Nick Higham

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

From: J. Barrett <j.barrett@ic.ac.uk>
Date: Mon, 6 Mar 95 18:26:58 GMT
Subject: Postdoctoral Position at Imperial College, London

Imperial College of Science, Technology and Medicine
(University of London, UK)

Department of Electrical & Electronic Engineering

Postdoctoral Research Assistantship in Computational Fluid Dynamics.

The Optical and Semiconductor Devices group requires a postdoctoral
researcher to contribute to a growing programme in microengineering.

The post is for the application of computational fluid dynamics to the
deposition of 'spin-on' glasses and ceramics (sol-gel). Experience in
numerical modelling is essential; knowledge of other relevant topics is

The appointment will be for 7-9 months approx, dependent on salary.
Starting salary in the range of #16890-#17700 per annum,including London
allowance. Successful applicants will join a well-equipped team in a
research area with an exciting future. Applications, to include a CV and
names of 2 referees, to be sent to:

Dr K.D.Leaver, Dept of Electrical & Electronic Engineering, Imperial
College, London SW7 2BT, tel: (+44) 0171 5946202, email:
k.leaver@ee.ic.ac.uk

This post was first advertised in a national journal in Dec 1993.

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

From: Panos Pardalos <pardalos@math.ufl.edu>
Date: Mon, 6 Mar 1995 14:58:58 -0500
Subject: Contents, Global Optimization

JOURNAL OF GLOBAL OPTIMIZATION (Kluwer Academic Publishers)
Vol. 6 No. 1 (Jan. 1995)

A.E.W. JONES and W. FORBES / An Adaptive Simulated Annealing Algorithm
for Global Optimization over Continuous Variables
1-37.

I. QUESADA and I.E. GROSSMANN / A Global Optimization Algorithm
for Linear Fractional and Bilinear Programs
39-76.

E. CARRIZOSA, E. CONDE, M. MUNOZ-MARQUEZ and J. PUERTO / Planar
point-Objective Location problems with Nonconvex Constraints: A
Geometric Construction
77-86.

T.Q. PHONG, P.D. TAO and L.T.H. AN / A Method for Solving DC Programming
Problems. Application to Fuel Mixture Nonconvex Optimization Problem
87-105.

Book Reviews
D.-Z. DU and J. SUN / Advances in Optimization and Approximation
(S.A. VAVASIS)
107-108.

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

From: SIAM <young@siam.org>
Date: Mon, 06 Mar 95 15:50:35 EST
Subject: Contents, SIAM Computing

SIAM Journal on Computing
Volume 24, Number 3
June 1995
Contents

\$O(M\cdotN)\$ Algorithms for the Recognition and Isomorphism Problems on
Circular-Arc Graphs
Wen-Lian Hsu

When Trees Collide: An Approximation Algorithm for the Generalized Steiner
Problem on Networks
Ajit Agrawal, Philip Klein, and R. Ravi

Rectilinear Path Problems among Rectilinear Obstacles Revisited
Chung-Do Yang, D. T. Lee, and C. K. Wong

Evaluation of Polynomials Using the Structure of the Coefficients
Jurg Ganz

When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman
Problem?
Alan Frieze, Richard M. Karp, and Bruce Reed

Scaling Algorithms for the Shortest Paths Problem
Andrew V. Goldberg

Counterexamples for Directed and Node Capacitated Cut-Trees
Andras A. Benczur

Tree Reconstruction from Partial Orders
Sampath K. Kannan and Tandy J. Warnow

A Generalization of the Suffix Tree to Square Matrices, with Applications
Raffaele Giancarlo

Efficient Algorithms for the Hitchcock Transportation Problem
Takeshi Tokuyama and Jun Nakano

Approximate Max-Flow on Small Depth Networks
Edith Cohen

A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a
Given Graph
Richard A Duke, Hanno Lefmann, and Vojtech Rodl

A Variational Method for Analysing Unit Clause Search
Henri-M. Mejean, Henri Morel, and Gerard Reynaud

A General Approach to Removing Degeneracies
Ioannis Z. Emiris and John F. Canny

A Priori Bounds on the Euclidean Traveling Salesman
Timoth Law Snyder and J. Michael Steele

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

From: Carlos A. de Moura <demoura@zeus.funceme.br>
Date: Tue, 7 Mar 95 10:51:42 EST
Subject: Contents, Computional and Applied Mathematics

COMPUTATIONAL AND APPLIED MATHEMATICS
VOL.13 N.3 '94

Special Issue honoring the memory of
LEOPOLDO NACHBIN

C.L.da S.DIAS, C.S.HONIG & L.A. da J.MEDEIROS
Leopoldo Nachbin

J.HORVATH
The late works of Leopoldo Nachbin

C.BOYD & S.DINEEN
Locally bounded subsets of holomorphic functions

J.B.PROLLA & M.S.M.ROVERSI
On the Choquet-Deny theory for the strict topology

C.S.HONIG
Functional Analytic axioms and Set Theory

J.L.LIONS
Hierarchical pointwise controllability

L.A.MEDEIROS
On some nonlinear perturbation of
Kirchhoff-Carrier operator

A.NACHBIN & G.C.PAPANICOLAOU
Water waves in disordered media

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

From: Richard Brualdi <brualdi@math.wisc.edu>
Date: Wed, 8 Mar 1995 12:40:24 -0600 (CST)
Subject: Contents, Linear Algebra and its Applications

LINEAR ALGABRA AND ITS APPLICATIONS
Contents Volume 216

E. E. Tyrtyshnikov (Moscow, Russia)
Circulant Preconditioners With Unbounded Inverses 1

Jianming Miao and Adi Ben-Israel (New Brunswick, New Jersey)
The Geometry of Basic, Approximate, and Minimum-Norm
Solutions of Linear Equations 25

Georg Heinig (Safat, Kuwait)
Generalized Inverses of Hankel and Toeplitz Mosaic Matrices 43

Jonathan Goodman (New York, New York) and Neal Madras
Random-Walk Interpretations of Classical Iteration Methods 61

Juriaan Simonis (Delft, the Netherlands)
MacWilliams Identities and Coordinate Partitions 81

Roy Meshulam (Haifa, Israel)
On Two-Parameter Families of Symmetric Matrices 93

G. A. Watson (Dundee, Scotland)
Estimating Hadamard Operator Norms, With Application to
Triangular Truncation 97

Hernan G. Abeledo and Uriel G. Rothblum
(New Brunswick, New Jersey)
Courtship and Linear Programming 111

Jose A. Hermida-Alonso and Miriam Pisonero (Valladolid, Spain)
What Polynomial Satisfies a Given Endomorphism? 125

J. Kovac-Striko (Zagreb, Croatia) and K. Veselic (Hagen, Germany)
Trace Minimization and Definiteness of Symmetric Pencils 139

and S. Kounias (Athens, Greece)
A-Optimization of Exact First-Order Saturated Designs
for N=1"mod"4 Observations 159

Joseph J. Rushanan (Bedford, Massachusetts)
Eigenvalues and the Smith Normal Form 177

Jian Shen (Hefei, Anhui, People's Republic of China)
Proof of a Conjecture About the Exponent of Primitive Matrices 185

Boris Kimelfeld (New Brunswick, New Jersey)
A Generalization of Muirhead's Theorem 205

Dasong Cao (Gainesville, Florida) and Hong Yuan
(Shanghai, People's Republic of China)
The Distribution of Eigenvalues of Graphs 211

C. S. Karuppanchetty and S. Maria Arulraj (Tiruchirappalli, India)
Permanental Mates and Hwang's Conjecture 225

Seung-Hyeok Kye (Seoul, Korea)
Positive Linear Maps Between Matrix Algebras Which Fix Diagonals 239

Arnold Neumaier (Freiburg, Germany)
Hybrid Norms and Bounds for Overdetermined Linear Systems 257

Keith Bourque and Steve Ligh (Hammond, Louisiana)
Matrices Associated With Multiplicative Functions 267

Author Index 277

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

From: Richard Brualdi <brualdi@math.wisc.edu>
Date: Fri, 10 Mar 1995 07:27:32 -0600 (CST)
Subject: Contents, Linear Algebra and its Applications

LINEAR ALGEBRA AND ITS APPLICATIONS
Contents Volume 217

Special Issue: Proceedings of a Conference on Graphs
and Matrices in Honor of John Maybee

A Brief History of John Maybee's Career 1

Loop and Cyclic Niche Graphs 5

LeRoy B. Beasley and Shumin Ye (Logan, Utah)
Linear Operators Which Preserve
Sign-Nonsingular Matrices 15

Elizabeth D. Boyer and Bryan L. Shader (Laramie, Wyoming)
On Biclique Decompositions of Complete
t-partite Graphs 31

R. C. Brigham (Orlando, Florida),
F. R. McMorris (Louisville, Kentucky),
and R. P. Vitray (Winter Park, Florida)
Tolerance Competition Graphs 41

Karen Casey Dargen and Kathryn Fraughnaugh
Conditional Chromatic Numbers With
Forbidden Cycles 53

Ronald D. Dutton, Sirisha R. Medidi, and
Robert C. Brigham (Orlando, Florida)
Changing and Unchanging of the Radius
of a Graph 67

David C. Fisher and Richard B. Reeves (Denver, Colorado)
Optimal Strategies for Random Tournament Games 83

David C. Fisher and Jennifer Ryan (Denver, Colorado)
Tournament Games and Condorcet Voting 87

D. A. Gregory (Kingston, Ontario, Canada),
and N. J. Pullman (Kingston, Ontario, Canada)
A Bound on the Exponent of a Primitive Matrix
Using Boolean Rank 101

Matrix Trigonometry 117

Douglas Hale (Washington, D.C.) and
Qualitative Comparative Statics and Audits
of Model Performance 141

Charles R. Johnson (Williamsburg, Virginia),
D. Dale Olesky, and P. van den Driessche
Sign Determinancy in LU Factorization
of P-matrices 155

Suh-Ryung Kim (Staten Island, New York),
Terry A. McKee (Dayton, Ohio),
F. R. McMorris (Louisville, Kentucky),
and Fred S. Roberts (New Brunswick, New Jersey)
p-Competition Graphs 167

Spectral Radii of Tournament Matrices Whose
Graphs Are Related by an Arc Reversal 179

J. Richard Lundgren, Sarah K. Merz (Denver, Colorado),
John S. Maybee (Boulder, Colorado), and
Craig W. Rasmussen (Monterey, California)
A Characterization of Graphs With Interval
Two-Step Graphs 203

J. Richard Lundgren, Sarah K. Merz (Denver, Colorado),
and Craig W. Rasmussen (Monterey, California)
Chromatic Numbers of Competition Graphs 225

Thomas Lundy (Victoria, British Columbia, Canada),
John S. Maybee (Boulder, Colorado), and
Asok K. Sen (Indianapolis, Indiana)
S-Inverse Matrices 241

Fred S. Roberts (New Brunswick, New Jersey)
On the Problem of Consistent Marking of a Graph 255

Author Index 265

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

End of NA Digest

**************************
-------