NA Digest Sunday, February 25, 1996 Volume 96 : Issue 08

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: Cleve Moler <>
Date: Sat Feb 24 23:06:27 EST 1996
Subject: NA Digest Editorial Policy

This week's input queue contained six contributions that I felt were too
long and that I returned to their authors for editing. Last week's Digest
included three items that were corrections to earlier announcements that
I had damaged when I tried to edit them myself. So, it is again time to
remind everybody of the NA Digest editorial policy.

I try to keep each week's edition under 1000 lines of text. Please limit
individual contributions to a few dozen lines. If you have a longer
announcement, summarize it and include an e-mail, FTP or World Wide
Web address for the complete document.

For meeting announcements, most of our readers are not immediately interested
in the times for the coffee breaks or the special price at the local motel.
Please do not include a "fill in the blanks" registration form.

Announcements of relevant commercial products, like books or software, are
welcome, but please do not include details of price and payment methods.

The text should be ASCII characters, with at most 80 characters per line,
no tabs, Macintosh "special quotes" or other nonstandard characters. A
limited amount of Tex notation is certainly OK, but don't assume everybody
has a Tex viewer.

Contributions should be sent directly to:

Thanks for your support of the NA News Digest and for your brevity in future

-- Cleve


From: Cleve Moler <>
Date: Sun Feb 25 10:44:20 EST 1996
Subject: Who Invented the Thomas Algorithm?

As I understand it, the "Thomas Algorithm" is another name for the use of
Gaussian elimination to solve tridiagonal systems of linear equations.
Is this correct? Who is Thomas? How did he get his name attached to
this algorithm?


From: Marcin Paprzycki <>
Date: Mon, 19 Feb 1996 21:07:59 -0600 (CST)
Subject: ICIAM Proceedings Question

Dear Colleagues,

We would like to enquire if anyone who participated in the ICIAM'95
congress in Hamburg and has submitted a paper to the Proceedings has
heard anything from the ICIAM Organizers. We have submitted materials
for publication and have received no confirmation that our contributions
have been received. We have also tried to contact the ICIAM Organizers
over the e-mail and received no responses to our repeated messages.
We are ready to assume that this is our bad luck, but would like to confirm
this by asking those of you who have were more lucky then we were to
contact us and confirm our suspicion.

Pierluigi Amodio, University of Bari
Luigi Brugnano, University of Florence
Marcin Paprzycki, University of Texas of the Permain Basin
Przemyslaw Stpiczynski, Maria Curie Sklodowska University


From: Ken Turkowski <>
Date: Tue, 20 Feb 1996 12:15:55 -0800
Subject: A Triangular, Orthogonal Matrix Factorization

I would like to factor a 3x3 matrix into the form:

M = U Q V
where U and V are upper triangular, and Q is orthogonal, specifically a
rotation. This problem arises in the registration of images. Any
       | a b c |
U, V = | 0 d e |
       | 0 0 f |
With an ideal system, a=d=1, b=0, c~0, and e~0, but numerical issues may
require a, d, and b to be different.

Ken Turkowski
Apple Interactive Media Group


From: Paul Nevai <>
Date: Sat, 24 Feb 1996 12:07:08 -0500 (EST)
Subject: Announcing the Sensational "wjat"

ATTENTION lynx user:

Get "wjat" the jack-of-all-trades lynx interface to the databases of Journal of
Approximation Theory (JAT), with support of Constructive Approximation (CA),
East Journal on Approximations (EJA), Mathematical Reviews (MR), Spline
Bibliography Database (SPD), and (much) more from


This will be the smartest investment you have ever made or your money back.

Best regards, Paul

Paul Nevai
Department of Mathematics
The Ohio State University
231 West Eighteenth Avenue 1-614-292-3317 (Office)
Columbus, Ohio 43210-1174 1-614-292-5310 (Answering Machine)
The United States of America 1-614-292-1479 (Math Dept Fax)


From: Roland Vilsmeier <>
Date: Sun, 18 Feb 1996 15:13:37 +0100
Subject: Symposium on Finite Volumes for Complex Applications

We wish to announce a Symposium, to be held in July 1996 at INSA in
Rouen, France:


According to the title, a critical look at the subject is intended.
NEW IDEAS should be presented, even if they did not yet show full
success. The demonstration of LIMITS or ERRORS of methods is
explicitly welcome.

DEADLINE for abstracts: March, 15. 1996.

This is a new Symposium, held for the first time this year.

PROCEEDINGS will be printed and made available.

There will be around 40 lectures, eight of them INVITED.
Invited lectures will be given by:

A. Dervieux, INRIA Sophia Antipolis, France
T. Gallouet, ENS Lyon, France
M. Kr"oner, Inst. f. Angewandte Mathematik, Uni-Freiburg, Germany
M. Meinke, Aerodynamisches Institut, RWTH-Aachen, Germany
I. Toumi, CEA, Saclay, France
J. P. Vila, INSA de Toulouse, France
N. P. Weatherill, University of Swansea, UK
G. Wittum, Inst. f. Computeranwendungen, Uni-Stuttgart, Germany

INTERESTED? Please see our http-pages on the Internet:

(If, for any reason, you can not read our pages, please return a short
mail indicating your fax-number or address. We will fax or post you a
printed version of the announcement.)

Hoping to see you summer in Rouen.

Fayssal Benkhaldoun and Roland Vilsmeier

phone: +49 203 379 3111
fax: +49 203 379 3087


From: Bette Byrne <>
Date: Mon, 19 Feb 96 13:02:51 GMT
Subject: Computational Fluid Dynamics Workshop at Oxford


One-Day Workshop on Fluid Structure Interaction
Tuesday, 26th March, 1996
University of Oxford


This one-day workshop will discuss the important area of connections
between fluids and structures in a number of contexts.

The meeting will take place in the Computing Laboratory and is planned to
begin at 10.00 a.m. with coffee.

Speakers will include:

Prof P W Carpenter (University of Warwick)
Prof M Cross (University of Greenwich)
Dr M B Giles (University of Oxford)
Dr H Goyder (AEA Technology)
Mr A G Hutton (Nuclear Electric)
Dr M Imregun (Imperial College)
Dr P Macey (PASEC)

There will be a charge of 25 pounds for academics and 45 pounds for
non-academics to cover our expenses which will include coffee, lunch
and tea. If you require any further information please contact:

Mrs B C Byrne,Oxford University Computing Laboratory, Wolfson Building,
Parks Road, Oxford OX1 3QD. Tel: (01865) 273883, Fax: (01865) 273839,


From: Arieh Iserles <>
Date: Tue, 20 Feb 96 09:12:17 GMT
Subject: Foundations of Computational Mathematics

IMPA, Rio de Janeiro
January 5-12, 1997

The first meeting organised by the recently formed Foundations of
Computational Mathematics committee will be held at the Instituto
Mathematica Pura e Applicada in Rio de Janeiro. There will be twelve
plenary talks in the mornings from Monday January 6 to Saturday
January 11 and nine workshops in the afternoons of these same days.

The invited speakers are
o Charles BENNETT (IBM Yorktown Heights)
o Ronald COIFMAN (Yale University)
o Misha GROMOV (IHES and University of Maryland)
o Dick KARP (University of Washington)
o Robert MACKAY (Cambridge University)
o David MUMFORD (Harvard University)
o Yuri NESTEROV (University of Louvain)
o Jesus Maria SANZ-SERNA (University of Valladolid)
o Steve SMALE (City University of Hong Kong)
o Nick TREFETHEN (Cornell University)
o Greg WASILKOWSKI (University of Kentucky)
o Andrei ZELEVINSKII (Northeastern University)

The workshops and their organisers are
GEOMETRY: Thomas Lickteig ( and
Marie-Francoise Roy (
and Herb Keller (
and Henryk Wozniakowski (
Alan Edelman (
* APPROXIMATION and PDEs: Wolfgang Dahmen (
and Ron DeVore (
* OPTIMIZATION: Clovis Gonzaga ( and Mike Todd
( and Andrew Stuart (
and Imre Simon (
* COMPUTER VISION: Jean-Michel Morel ( and
David Mumford (

The conference fee is US$ 150 (US$ 30 for students). The local organising
committee will assist participants with accomodation in Rio de Janeiro.

The Foundations of Computational Mathematics committee consists of
Mike Shub (chair), Steve Smale (ex-chair), Arieh Iserles (secretary),
Jim Renegar (treasurer), Felipe Cucker (publications), Wolfgang Dahmen;
Narendra Karmarkar and Marie-Francoise Roy (members-at-large).

The local organising committee comprises Teresa Krick (,
Gregorio Malajovich (, Benar Fux Svatier
(, Martin Tygel ( and Jorge Zubelli
Contact address for the local organising committee: Gregorio Malajovich,
Departamento de Matematica Aplicada da UFRJ Caixa Postal 68530 - CEP
21945, Rio de Janeiro - RJ - BRASIL (fax: +55 21-529-5129, attn Jorge Zubelli)

Contact addresses for local information, registration and accomodation:
email --, fax -- +55 21-512-4115 (attn Sra Suely).

Prospective participants are encouraged to contact directly workshop
organisers if they intend to submit a talk.

The temporary WWW home page of FoCM97 resides at


From: Marcin Paprzycki <>
Date: Wed, 21 Feb 1996 17:09:01 -0600 (CST)
Subject: Structured Linear Systems -- Call for Papers

High Performance Algorithms for Structured Linear Systems
edited by: Peter Arbenz, Marcin Paprzycki, Ahmed Sameh

A volume in the series "Advances in the Theory of Computation and
Computational Mathematics" (published by ABLEX, Norwood, New Jersey).

In recent years, knowledge about the high performance solution of
structured linear systems has grown rapidly. By structured linear systems
we mean large sparse systems assembled from relatively small dense or
sparse blocks. Examples of such systems abound in many applications; they
can be bidiagonal, tridiagonal, banded, block tridiagonal, almost block
diagonal, or arrowhead systems. Our understanding of high performance
computing is rather broad and includes vector, RISC as well as parallel
architectures. Parallel computers considered can be those of shared or
distributed memory architectures, or cluster-based that combine
characteristics of both.

The volume has three goals. First, it is to summarize the state of the
art in the area of high performance solution of structured linear systems.
Second, it is supposed to indicate what research directions are perceived
as the most important ones for the future. The third and final goal is to
provide a collection of algorithms and ideas that may enhance future
algorithm development in this area.

In the volume, we hope to cover direct as well as iterative methods. We
also hope that a wide spectrum of high performance architectures will be
reviewed. It needs to be pointed out that even though we are primarily
interested in parallel algorihtms for the solution of structured linear
systems, high performance algorithms for a single-processor system (each
node of a multiprocessor system) are crucial for realizing high
performance on parallel platforms. Thus, we will also accept papers with
emphasis on single-processor performance (as related to parallel

It is our goal to present the results in a more unified way than merely
assembling papers into a collection. This means, among other things, that
the authors of accepted papers may be requested to present their
experiments on equivalent linear systems and/or using similar performance

To contribute, please send 6 hard copies of the paper (or PREFERABLY,
submit your paper electronically -- prepared in plain LaTeX or PostScript)

August 31st, 1996

to one of the volume editors. The volume is expected to be published in
early 1997.

Peter Arbenz Marcin Paprzycki Ahmed Sameh
Inst. of Sci. Comp. Dept. of Math. & CS Dept. of Comp. Sci.
ETH Zurich UTPB Univ. of Minnesota
8092 Zurich Odessa, TX 79762 Minneapolis, MN 55455
Switzerland USA USA


From: Bruce A Wade <>
Date: Fri, 23 Feb 1996 10:07:30 -0600 (CST)
Subject: Midwest Numerical Analysis Day

Midwest Numerical Analysis Day

Second Call for Participants

University of Wisconsin-Milwaukee
Department of Mathematical Sciences
PO Box 413
Milwaukee, WI 53201-0413

The 1996 Midwest Numerical Analysis Day will be held on
Saturday, April 27, 1996 at the University of Wisconsin--
Milwaukee. There will be presentations in the morning and
afternoon. If you are interested, please notify us by sending
an e-mail message to,
or by writing to David Schultz at the the above address.

If you would like to give a talk, please send a title and,
if possible, an abstract by March 31, 1996. If you would like
to organize a special session, please contact us as soon as possible.

Information concerning the conference is available on the
World Wide Web at,
or through anonymous ftp at
in the subdirectory pub/Math/NAday.

There will be a reception on Friday, April 26, at 6:30 p.m.
at the Hefter Conference Center, 3271 N. Lake Drive.
Refreshments will be provided.

The conference will be held in the Business Administration
Building, rooms S151, S191 and S195 between 9:00 a.m. and
5:00 p.m. Parking is available underneath the Business
Building or the adjacent Student Union. The Business
Administration Building is located at 3202 N. Maryland Ave.
and the Student Union is at 2200 E. Kenwood Blvd.

If you have any questions, please feel free to contact us
(phone: (414) 229-4836).


From: Brynjulf Owren <>
Date: Tue, 20 Feb 1996 16:21:41 +0100
Subject: PhD Scholarship at NTNU, Norway


The Norwegian Research Council (NFR) has granted a 3 year PhD
scholarship to the Department of Mathematical Sciences, Numerics
group, NTNU. The scholarship is linked to the project SYNODE
(SYmmetries in Numerical Ordinary Differential Equations).
The successful applicant will conduct his/her research within the
field of numerical analysis and method development for ordinary
differential equations. The topic of the thesis will be among the
- Numerical solution of differential equations where
it is known that the solution lives on a manifold, (e.g. a Lie
group or a homogeneous space).
- Numerical solution of differential-algebraic equations
- Numerical solution of Hamiltonian systems
The successful applicant may be asked to spend parts of the time at
the University of Bergen.
Applicants should have a MSc or a similar degree in numerical
analysis, mathematics or physics.
In order to receive the scholarship, the student must apply for and be
accepted in the PhD program at NTNU.
The application should contain a list of priorities among the topics
listed above, a resume, and up to 3 letters of
recommendation. References to previous work, if any, should be
included. The application must be labelled SYNODE. Applications are
accepted until April 15, 1996 and should be sent to: SYNODE,
Department of Mathematical Sciences, NTNU, N-7034 Trondheim, Norway.
For more information, contact one of
- Brynjulf Owren, tlf 73 59 35 18, email:,
- Syvert P. Noersett, tlf 73 59 35 45, email:,
- Hans Munthe-Kaas, tlf 55 54 41 79, email:

Additional information about the SYNODE project can be
found at

NTNU has few women in scientific positions, therefore women are
encouraged to apply.

The successful applicant is hired for a minimum of three years, paid
by the NFR. The Department of Mathematical Sciences will provide
another 6 months salary in exchange for 250 hours of work (typically
as teaching assistent). The student can apply for an extension of
these 6 months to 12 months, in which case there will be a total of
450 hours work for the department.
PhD scholarship: NOK 205193, per year (= ca 0.8 times salary of
Two percent will be taken from the above sum to the Governments pension
fund. Work experience that is relevant to the position may be credited.


From: Chris Bischof <>
Date: Fri, 23 Feb 1996 14:25:05 -0600
Subject: Postdoctoral Position at Argonne Laboratory


Argonne National Laboratory invites outstanding candidates to apply for an
open postdoctoral position in the Mathematics and Computer Science Division.
Candidates should have a Ph.D. in applied mathematics, computer science,
computational chemistry or a related discipline and comprehensive knowledge
in numerical linear algebra, parallel computing, and software design and

The successful candidate will participate in the development of algorithms
and software tools for large-scale dense eigenvalue and orthogonal reduction
problems under the umbrella of the PRISM (Parallel Research in Invariant
Subspace Methods) project. See for
information on the PRISM project. This project is interdisciplinary in
nature and interfaces with efforts in computational chemistry.

The Mathematics and Computer Science Division supports an excellent
computational environment that includes access to high-performance
scientific workstations, a scientific visualization and virtually reality
laboratory, and state-of-the-art parallel computers.

Argonne is located in the southwestern Chicago suburbs, offering the
advantages of affordable housing and good schools, as well as easy access to
the cultural attractions of the city.

Applicants must have received their Ph.D. not more than three years prior to
the beginning of the appointment. The appointment is available immediately
and for a one-year term (renewable). Applications should be addressed to
Walter McFall, Box mcs-prism, Employment and Placement, Argonne National
Laboratory, 9700 S. Cass Avenue, Argonne, IL 60439, and must include a
resume and the names and addresses of three references. For additional
information, contact Chris Bischof (

Argonne is an affirmative action/equal opportunity employer.


From: Bill Hager <>
Date: Tue, 20 Feb 1996 13:31:05 -0500
Subject: Contents, Computational Optimization

Computational Optimization and Applications has increased its
publication frequency from 4 issues to 6 issues/year. I have some
extra copies of the the latest issue, dedicated to Richard Cottle.
(Simply send your mailing address to "").
The contents of recent issues follow.


Table of Contents

Volume 5, Number 2, March 1996

Special Issue Dedicated to Richard Cottle

O.L. Mangasarian: Dedication

Chunhui Chen and O.L. Mangasarian: A Class of Smoothing
Functions for Nonlinear and Mixed Complementarity Problems

Jong-Shi Pang, Jeffrey C. Trinkle and Grace Lo: A
Complementarity Approach to a Quasistatic Multi-Rigid-Body
Contact Problem

Carl Geiger and Christian Kanzow: On the Resolution of
Monotone Complementarity Problems

Anna Altman and Krzysztof C. Kiwiel: A Note on Some Analytic
Center Cutting Plane Methods for Convex Feasibility and Break
Minimization Problems

Volume 5, Number 1, January 1996

Masao Fukushima, Mounir Haddou, Van Hien Nguyen, Jean-Jacques
Strodiot, Takanobu Sugimoto and Eiki Yamakawa: A Parallel
Descent Algorithm for Convex Programming

Reiner Horst and Nguyen Van Thoai: A New Algorithm for Solving
the General Quadratic Programming Problem

L. Fernandes, J. Judice and J. Patricio: An Investigation of
Interior-Point and Block Pivoting Algorithms for Large-Scale
Symmetric Monotone Linear Complementarity Problems

M.R. Emamy-K. and A.I. Ramirez: A Special Class of Set Covering

Volume 4, Number 4, October 1995

Kaj Holmberg: Efficient Decomposition and Linearization
Methods for the Stochastic Transportation Problem

Michele Breton: Algorithms for the Solution of Stochastic
Dynamic Minimax Problems

Jeffery L. Kennington and Farin Mohammadi: The Singly
Constrained Assignment Problem, An AP Basis Algorithm

Shirish Chinchalkar and Thomas F. Coleman: Parallel
Structural Optimization Applied to Bone Remodeling on
Distributed Memory Machines

Volume 4, Number 3, July 1995

S. Ito, C. T. Kelley, and E. W. Sachs: Inexact Primal-Dual Interior
Point Iteration for Linear Programs in Function Spaces

Le Dung Muu, Thai Quynh Phong, and Pham Dinh Tao: Decomposition
Methods for Solving a Class of Nonconvex Programming Problems Dealing
with Bilinear and Quadratic Functions

Walter Alt and Kazimierz Malanowski: The Lagrange-Newton Method for
State Constrained Optimal Control Problems

Zhi Wang, I. M. Navon, X. Zou, and F. X. Le Dimet: A Truncated Newton
Optimization Algorithm in Meteorology Applications with Analytic
Hessian/Vector Products

Gautam Mitra, Bjarni Kristjansson, Cormac Lucas, and Shirley Moody:
Sets and Indices in Linear Programming Modelling and their Integration
with Relational Data Models

Volume 4, issue 2, April 1995

Bertsekas/Pallottino/Scutella: Polynomial Auction Algorithms for
Shortest Paths

Marcotte/Zhu: Global Convergence of Descent Processes for
Solving Non Strictly Monotone
Variational Inequalities

Tuncel: On the Convergence of Primal-Dual Interior-Point Methods
with Wide Neighborhoods

Drezner: Lower Bounds Based on Linear Programming for the
Quadratic Assignment Problem

Chinneck: Analyzing Infeasible Nonlinear Programs


End of NA Digest