NA Digest Sunday, December 5, 1999 Volume 99 : Issue 48

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: Christophe Rabut <>
Date: Thu, 02 Dec 1999 19:30:41 MET
Subject: Pierre Bezier

Pierre BEZIER died on November 25, 1999.

The following short biography has been published in volume 22, number 9
(november 1990) of "Computer Aided Design", a special issue devoted to
Bezier techniques.

Pierre Etienne Bezier was born on September 1, 1910 in Paris. Son and
grandson of engineers, he chose this profession too and enrolled to study
mechanical engineering at the Ecole des Arts et Metiers and received his
degree in 1930. In the same year he entered the Ecole Superieure
d'Electricite and earnt a second degree in electrical engineering in 1931.
In 1977, 46 years later, he received his DSc degree in mathematics from the
University of Paris.

In 1933, aged 23, Bezier entered Renault and worked for this company for 42
years. He started as Tool Setter, became Tool Designer in 1934 and Head of
the Tool Design Office in 1945. In 1948, as Director of Production
Engineering he was responsable for the design of the transfer lines
producing most of the 4 CV mechanical parts. In 1957, he became Director of
Machine Tool Division and was responsable for the automatic assembly of
mechanical components, and for the design and production of an NC drilling
and milling machine, most probably one of the first machines in Europe.
Bezier become managing staff member for technical development in 1960 and
held this position until 1975 when he retired.

Bezier started his research in CADCAM in 1960 when he devoted a substantial
amount of his time working on his UNISURF system. From 1960, his research
interest focused on drawing machines, computer control, interactive
free-form curve and surface design and 3D milling for manufactoring clay
models and masters. His system was launched in 1968 and has been in full
use since 1975 supporting about 1500 staff members today.

Bezier's academic career began in 1968 when he became Professor of
Production Engineering at the Conservatoire National des Arts et Metiers.
He held this position until 1979. He wrote four books, numerous papers and
received several distinctions including the "Steven Anson Coons" of the
Association for Computing Machinery and the "Doctor Honoris Causa" of the
Technical University Berlin. He is an honorary member of the American
Society of Mechanical Engineers and of the Societe Belge des Mecaniciens,
ex-president of the Societe des Ingenieurs et Scientifiques de France,
Societe des Ingenieurs Arts et Metiers, and he was one of the first
Advisory Editors of "Computer-Aided Design".

Christophe Rabut,
Departement de Genie Mathematique
Institut National des Sciences Appliquees
135, avenue de Rangueil
F-31077 TOULOUSE Cedex 4 (France)


From: Martin Berzins <>
Date: Mon, 29 Nov 1999 08:10:11 +0000
Subject: Re: Is Scientific Computing part of Computer Science?

Re: is Scientific Computing part of Computer Science?

Many thanks to all those who responded to my call for comments.
The thirty responses came from a cross section of people
ranging from those working in the field
since its beginings to undergraduate students of today.

On reflection the question should have been worded.
"Does an important part of the multi-disciplinary subject of
Scientific Computing reside in Computer Science?"

Almost all who responded felt that the answer to this was yes.
Many made the point that Scientific Computing is spread across
CS, Maths and Engineering Departments to name but a few and
that local politics and history were often responsible for the
precise location.

Several replies made the point that mainstrean CS has moved a long
way from its numerical roots and that the main CS journals
no longer have an interest in matters relating to Scientific Computing.
The view was also expressed that some CS departments no longer
understand the nature of scientific computing and hence don't think
it belongs within their remit. Two of the 30 correspondents thought that
CS had moved so far that Scientific Computing was no longer part of CS.

John Gluckenheimer and Stratis Gallopoulos provided short papers
on this issue -links to these papers can be found at

Chuck Koebel (NSF) and Jim Crowley (SIAM) both expressed concerns about
the fact that if Scientific Computing didn't belong in CS then where
did it belong and who would train future researchers in this area?

Thanks again to those who responded. Several asked about the definition
that the panel assessing Computer Science in the UK will be using so here
it is:

The coverage of the Computer Science unit of assessment
includes, but is not limited to, the theoretical and practical study of
the following: algorithms; artificial intelligence; computer
architecture; computer graphics; computer vision; databases; dependable
systems; distributed systems; formal methods; high performance
computing; human computer interaction; information retrieval;
multimedia; networks and communications; neural systems; operating
systems; pattern recognition; programming languages; and software

Martin Berzins


From: ITR Working Group <>
Date: Tue, 30 Nov 1999 09:21:32 -0500 (EST)
Subject: Seeking Reviewers for NSF's Information Technology Research Initiative

Seeking reviewers for NSF's Information Technology Research Initiative

NSF is preparing for the review of proposals submitted to the Information
Technology Research (ITR) initiative for FiscalYear 2000. The success of
this program depends critically on our ability to enlist the help of expert
reviewers such as you to help us identify the outstanding proposals. We
are building a pool of reviewers qualified in IT-related research
areas. ITR is a new $90M NSF initiative that aims to promote fundamental
research in information technology, encouraging in particular research
spanning information technology and scientific applications, and in the
area of social, ethical and workforce issues. Specific areas include: 1)
software; 2) information technology education and workforce; 3)
human-computer interface; 4) information management; 5) advanced
computational science; 6) scalable information infrastructure; 7) social
and economic implications of information technology; and 8) revolutionary
computing. The ITR Program Solicitation can be found on the NSF Web Page

The Fiscal Year 2000 competition requires the submission of preproposals by
January 5, 2000 for all PIs who plan to submit full proposals requesting
more than $500K. The preproposals will be panel-reviewed during the week
of February 7, 2000 at three locations: 1) at NSF in Arlington, VA; 2) at a
location in Chicago, IL near O'Hare Airport; and 3) at a location to be
determined in the San Francisco area. Based on the results of the
preproposal screening, approximately 120 full proposals will be encouraged
for submission by April 17, 2000. Full proposals will be panel reviewed at
NSF on May 22, 2000.

A separate competition is being organized for those proposals requesting
less than $500K for the full duration of the award. For this category of
proposal, no preproposal is required. Proposals requesting less than $500K
are due at NSF on February 14, 2000. They will be reviewed during the
weeks of March 20 and March 27, 2000.

We would like to consider you as a potential panelist for this activity. If
you are involved in a proposal submitted to any area of ITR, as PI, co-PI
or otherwise as a participant, you are ineligible to serve as a panelist.
However, persons who are submitting proposals only to the more than $500K
competition can serve as panelists to review proposals less than $500K and
vice versa. We welcome panelists from foreign countries, national
laboratories, and industry.


Indicate your availability, and provide us with your information by
completing the ITR Panelist Entry Form at the following URL: . We urge you to fill out the form
immediately, since we will start to select panelists for the February 7
panel meetings within the next few days. NSF will pay all travel costs in
addition to $130 per travel day and $260 per panel day. If you have other
questions related to serving as a panelist, please refer to the FAQ section
of the ITR Home page at . Finally, we
would also appreciate it if you could forward this request to other
well-qualified IT scientists who you think may be interested.

Since ITR is a large-scale competition, and we have a number of people
involved in seeking panelists, we apologize if more than one person
contacts you in this regard.

We look forward to your reply,
Sincerely, The ITR Working Group


From: Paolo Manfredini <>
Date: Mon, 29 Nov 1999 16:41:14 +0100
Subject: Software for the Linear Complementarity Problem

Dear coworkers,
I want to find a software to Solve the Linear Complementarity
Problem for large scale model with iterative methods (i.e. Splitting
scheme,..). In the LCP (q,M) which I consider, the Matrix M is symmetric
but the matrix M can be not positive semi-difinite.
Tanks again
With kind regards
Paolo Manfredini


From: Michael Zager <>
Date: Tue, 30 Nov 1999 12:25:46 -0500
Subject: Stiff ODEs with Delay

I am working with a set of stiff, nonlinear, ordinary differential equations in
which some of the state variables have a state-dependent delay. I quickly
learned that numerical ODE solvers for this type of system are largely
unavailable. However, these systems arise frequently in many areas of
biological and biochemical modeling, and a numerical scheme to handle these
systems is in demand. Through conversations with many of my colleagues, it is
clear that information in this area is strongly desired. Hence I ask for any
input that can be offered to me.

Michael G. Zager, Jr.
North Carolina State University, Center for
Research in Scientific Computationnd
Chemical Industry Institute of Toxicology


From: Ken Turkowski <>
Date: Wed, 1 Dec 1999 15:21:34 -0800
Subject: Looking for Functional Bounds

I am looking for a smooth, efficiently computable function that bounds
another function (I have several functions for which I need to do this).
To get a flavor for what I'm working with, I need to get a reasonably
tight, monotonic lower functional bound for
abs(d^4/dx^4 atan(sqrt(1/(1+x^2)))) ^ (-1/4)
I was thinking about using rational polynomials or polynomial splines to
represent this bound, but I need to determine the coefficients.

How can I use an optimization program to converge to a bound, rather than
an approximation, to a function? Steep penalty terms for interpenetration
cause instability due to their stiffness. Do you have any other


From: Jorge More' <>
Date: Fri, 03 Dec 1999 11:23:34 -0600
Subject: New Optimization Server At Argonne

Optimization Server - NEOS 99

Version 2 of the NEOS Server was de-commissioned on March 4,
1999, after having processed 39,900 submissions. Version 3
of the NEOS Server - NEOS 99 - went into operation the same day,
and is continually being improved. The new Server can be found at

NEOS 99 is a major improvement. This version is portable, faster,
more reliable, allows submissions from the local file space, and
accepts compressed data.

We have also added a considerable number of new solvers.
In particular, for integer programming,

MINLP Roger Fletcher and Sven Leyffer.
XPRESS-MP/INTEGER Dash Associates and Dash Optimization.

for complementarity problems,

MILES GAMS Development Corporation and T. Rutherford,
PATH GAMS Development Corporation and

for nonlinearly constrained optimization,

DONLP2 Hans Mittelmann and Peter Spellucci,
FILTER Roger Fletcher and Sven Leyffer,
LANCELOT Andy Conn, Nick Gould and Philippe Toint,
LOQO Robert Vanderbei,
MINOS Bruce Murtagh and Michael Saunders,
SNOPT Philip Gill, Walter Murray and Michael Saunders,

for bound-constrained optimization,

L-BFGS-B Ciyou Zhu, Richard Byrd, Peihuang Lu, and Jorge Nocedal,
TRON Chih-Jen Lin and Jorge More',

and for positive semidefinite programming,

DSDP Steve Benson, Yinyu Ye, and Xiong Zhang.

Many of the solvers accept input in AMPL format, and we have recently
added solvers that accept input in GAMS format.

We welcome comments and suggestions. In particular, we are seeking
comments from NEOS users who support our continuing effort to offer this
service to the public. The easiest way to provide user feedback is by sending
mail to

Liz Dolan and Jorge More' for the NEOS group.


From: Jacques Blanc-Talon <>
Date: Mon, 29 Nov 1999 08:07:53 +0100
Subject: Symposium in Germany on Intelligent Vision Systems

1st Call For Papers for
(ACIVS'00), Theory and Applications
Baden-Baden (Germany), July 31-August 4, 2000.

Following ACIVS'99, the symposium will include the following topics:

recognition, string/tree/graph-based recognition, robust matching and parsing
algorithms, formal languages theory, applications of cellular automata to image
processing, relationship between the encoding process and the recognition rate)

IMAGE AND VIDEO COMPRESSION ALGORITHMS (wavelets, vector quantization,
fractals, hybrid techniques, semantic image compression)

model-based algorithms, biologically-inspired vision, nonlinear system
identification, learning and nonlinear optimization, recurrent networks,
multiresolution and scale-space theory, fractals, adaptive filtering, image
restoration, adaptive segmentation, measures of information, valuations)

ASSESSMENT OF ALGORITHMS (empirical techniques for algorithms evaluation, image
quality and objective metrics, perceptually based distortion metrics, video
quality evaluation, subjective ratings of compression algorithms, professional
applications [medical, military, etc.])

PROGRAM COMMITTEE: H. R. Arabnia, M. Basu, J. Blanc-Talon, P. Bolon,
D. Bone, A. Borkowski, N. Bourbakis, H. Bunke, J. Davidson, T. Ebrahimi,
A. Gagalowicz, G. Gimel'Farb, H. Kuroda, C. A. Lindley, B. Litow, W. S.
Mokrzycki, A. P. Paplinski, M. Paprzycki, S. Philip, W. Philips, M. Porat, F.
Preteux, D. Popescu, N. Rougon, G. Stamon, W. Szpankowski,
J. J. Villanueva, A. P. J. van der Walt, H. Yan.

STEERING COMMITTEE: Jacques Blanc-Talon ( & Dan
Popescu Dan.Popescu@cmis.CSIRO.AU


From: Victor Ganzha <>
Date: Mon, 29 Nov 1999 15:02:32 +0100 (MET)
Subject: Workshop on Computer Algebra in Scientific Computing

Third International Workshop
on Computer Algebra
in Scientific Computing
October 5 - 9, 2000
Samarkand State University
Samarkand, Uzbekistan

First Announcement and Call for Papers

The methods of scientific computing play an important role in research and
engineering applications in the field of the natural and engineering
sciences. Among the topics of CASC are many important questions and methods
of scientific computing and the application of computer algebra, such as

computer algebra analysis of partial differential equations
symbolic-numeric methods for differential-algebraic equations
algebraic methods for nonlinear polynomial equations and inequalities
computer algebra and approximate computations
construction of approximate solutions of ODEs and dynamical systems
numerical simulations using computer algebra systems
parallel symbolic-numeric computations
problem-solving environments
symbolic-numeric interfaces
internet accessible symbolic and numeric computations
algorithms in computer algebra and their complexity
applications in natural sciences

Workshop co-chair
Vladimir Gerdt (Dubna)
Ernst W. Mayr (Munich)

Program committee
Laurent Bernardin (Zurich)
Victor Edneral (Moscow)
Victor Ganzha (Munich, co-chair)
Jaime Gutierrez (Santander)
Simon Gray (Ashland)
Ilias Kotsireas (Paris)
Robert Kragler (Weingarten)
Michal Mnuk (Munich)
Bernard Mourrain(Sophia-Antipolis)
Hirokazu Murao (Tokyo)
Eugenio Roanes-Lozano (Madrid)
Werner Seiler (Mannheim)
Akhmadjon Soleev (Samarkand)
Stanly Steinberg (Albuquerque)
Nikolay Vassiliev (St. Petersburg)
Evgenii Vorozhtsov(Novosibirsk, co-chair)
Volker Weispfenning (Passau)
Andreas Weber (Tuebingen)
Franz Winkler (Linz)
Christoph Zenger (Munich)

Workshop Organizing Committee
Michal Mnuk (chair)
Annelies Schmidt (secretary)
Klaus Wimmer

Local Organizing Committee
Shavgat Ayupov
Alubek Narzullaev (secretary)
Akhmadjon Soleev

Important Dates

March 25, 2000 Submission of the full paper (up to 15 pages)
June 10, 2000 Notification of acceptance
July 15, 2000 Camera-ready copies must be received
August 15, 2000 Deadline for advance registration at Workshop

Contacts and further information

For all items concerning the conference please contact:

Michal Mnuk (

For up-to-date information about the conference see:


From: Michael Olesen <>
Date: Mon, 29 Nov 1999 08:58:39 -0600
Subject: Workshop on the Car-Parrinello Method in Physics and Chemistry

"Fifteen years of the Car-Parrinello method
in Physics and Chemistry"

sponsored by
University of Minnesota
Supercomputing Institute for
Digital Simulation and Advanced Computation

March 18-19, 2000

Minneapolis, Minnesota

Organizers: James R. Chelikowsky (University of Minnesota)
Michael Klein (University of Pennsylvania)
Sokrates T. Pantelides (Vanderbilt University)

This workshop will honor the originators of the Car-
Parrinello method and review major accomplishments and
cutting-edge developments. The Car-Parrinello method,
introduced in 1985 by Roberto Car and Michele Parrinello, has
dramatically influenced the field of electronic structure
calculations for solids, liquids and molecules, and initiated
the field of quantum molecular dynamics. The seminal idea
was to deal directly with the total energy of the electron
system as a function of its degrees of freedom, namely the
expansion coefficients for the one-electron wave functions,
and treat these degrees of freedom on the same footing with
the ionic degrees of freedom.

Please note that this workshop is timed to coincide with the
APS March Meeting 2000 which is being held in Minneapolis
March 20-24, 2000.

The workshop program will consist of invited presentations by
Roberto Car (Princeton) and Michele Parrinello (Max Planck)
and by major practitioners of the method.

Addition conference registration (including registration information) is
available on the World Wide Web at:

or by contacting Michael Olesen at (612) 624-1356 or


From: Volker Mehrmann <volker.mehrmann@Mathematik.TU-Chemnitz.DE>
Date: Tue, 30 Nov 1999 18:15:15 +0100 (MET)
Subject: Workshop on Structured Matrices

Workshop on `Structured Matrices'.

An international workshop on `Structured matrices' will be organized
by Fakultaet fuer Mathematik, TU Chemnitz and
Sonderforschungsbereich 393, `Numerical simulation
on massively parallel computers'
on January 6-7, 2000.

Conference organization: K. Rost and V. Mehrmann, TU Chemnitz.

Tentative list of participants:

P. Benner (Bremen, Germany), R. Byers (Lawrence, USA),
T. Ehrhardt (Chemnitz), H. Fassbender (Bremen), G. Heinig (Kuwait),
P. Junghanns (Chemnitz), V. Olshesky (Atlanta, USA),
T. Penzl (Chemnitz, curr. Calgary, Canada),
B. Silbermann (Chemnitz), T. Stykel (Chemnitz),
D. Watkins (Pullman, USA, curr. Chemnitz),
J. Xue (Shanghai, China, curr. Chemnitz)

This meeting has been endorsed by the International Linear Algebra Society.

For information contact: Karla Rost or Volker Mehrmann


From: Claire Poulin <poulin@CERCA.UMontreal.CA>
Date: Tue, 30 Nov 1999 14:52:32 -0500
Subject: Annual Conference of the CFD Society of Canada

CFD2K: New Frontiers in CFD
8th Annual Conference of the CFD Society of Canada
Montreal, Quebec, Canada
June 11-13, 2000

CERCA (Centre for Research on Computation and its Applications) is
organizing the 8th annual conference of the CFD Society of Canada, which
will be held at Montreal, on June 11-13, 2000.

Papers are sought in the following areas:

Applications of CFD
Industrial Uses
Design Optimization: Methods and Applications
Atmospheric Flows
Environmental Aspects
Perspectives and Challenges for CFD
Fluid/Structure Interactions
Structure Mechanics Relevant to Fluid Flows
Scientific Visualization

and all other aspects of CFD. Please submit a 500 to 1,000 word abstract
before January 14, 2000.

A CFD Challenge will also be held, entitled: "Turbulent Flow around a Square
Cross-section Cylinder in the Proximity of a Solid Wall" . Please inform
organizers by January 28, 2000, of your intent to participate.

For more details, please visit our web site:


From: Volker Schulz <>
Date: Wed, 1 Dec 1999 16:31:02 +0100 ("MET)
Subject: Workshop on Fast Solution of Discretized Optimization Problems

of the


at the
Weierstrass Institute for Applied Analysis and Stochastics

Berlin, Germany, May, 8 - 12, 2000.


Karl-Heinz Hoffmann (Caesar, Bonn)
Ronald Hoppe (Univ. Augsburg)
Volker Schulz (WIAS Berlin)

The intention of the workshop is to foster the development
of efficient numerical solution methods for large-scale
optimization problems resulting from discretizations of
differential equations.

The preliminary list of invited speakers includes

H. G. Bock (IWR Heidelberg, Germany)
U. Langer (Univ. Linz, Austria)
F. Troeltzsch (TU Chemnitz, Germany)
M. Heinkenschloss (Rice University, Houston, USA)
E. Sachs (Univ. Trier, Germany)

For more information as well as for a registration form,
please visit

or contact

Early registration is encouraged.


From: Georgios Akrivis <>
Date: Wed, 1 Dec 1999 18:08:43 +0200 (EET)
Subject: Euroconference on Numerical Methods for Evolution PDE's

The Foundation for Research and Technology-Hellas (Institute
of Applied and Computational Mathematics) in collaboration with
the University of Crete (Department of Mathematics) will continue
sponsored by the Training and Mobility of Researchers Programme of the
Commission of the European Union.

In this framework the following conferece is organized:

Anogia, Crete, Greece,
June 24-30, 2000

The conference will take place at the Anogia Academic Village, a
conference center located at the traditional Cretan village of Anogia
on the slopes of the mountain Ida.

Organizers: Georgios Akrivis (Ioannina, Greece),
Michel Crouzeix (Rennes, France)

Main speakers (who will give three survey lectures on the
indicated topic):
Thierry Gallouet (Marseille, France),
Finite volume methods
Ricardo Nochetto (College Park, MD, USA),
A posteriori error estimation and adaptivity
Jacques Rappaz (Lausanne, Switzerland),
Coupling Maxwell and thermic equations
Vidar Thomee (Goeteborg, Sweden),
Numerical methods for equations with memory
Lars Wahlbin (Ithaca, NY, USA),
Resolvent estimates and their use for analyzing
parabolic finite element equations

Senior speakers (who will give one invited lecture):

Ivo Babuska (Austin, TX, USA),
Vassilios Dougalis (Athens, Greece),
Raphaele Herbin (Marseille, France),
Ohannes Karakashian (Knoxville, TN, USA),
Stig Larsson (Goeteborg, Sweden),
Charalambos Makridakis (Heraklion, Greece),
Cesar Palencia (Valladolid, Spain),
Marco Picasso (Lausanne, Switzerland),
Giuseppe Savare (Pavia, Italy),
Anders Szepessy (Stockholm, Sweden),

Young researchers: The Training and Mobility of Researchers
Programme financially supports young (born 1965 or later)
researchers (graduate students, postdocs, professors, etc.)
from the European Economic Area (Island, Lichtenstein and
Norway are included) and Israel, as well as researchers from
certain countries in Central and Eastern Europe, to enable them
to attend the conference. Support can cover (all or certain)
travel, living and registration expenses.

Important deadline: Young researchers wishing to attend
the conference have to submit an application to the local
co-ordinator by March 31, 2000.

For additional information please contact the local co-ordinator

Prof. Susanna Papadopoulou
Department of Mathematics
University of Crete
Heraklion, Crete, GREECE

Fax-Nr.: +30-81-393881


Georgios Akrivis
Computer Science Department
University of Ioannina
451 10 Ioannina



From: Ewald Quak <>
Date: Wed, 01 Dec 1999 20:56:43 +0100
Subject: Conference on Mathematical Methods for Curves and Surfaces

The Fifth International Conference on
Mathematical Methods for Curves and Surfaces
June 29 - July 4, 2000
Oslo, Norway

The meeting will focus on the classical topics of Computer Aided
Geometric Design such as spline and Bezier methods for curve and surface
approximation, scattered data modelling, multidimensional modelling,
hierarchical modelling, subdivision, wavelets, and visualization.

To highlight recent work in these fields, we are pleased to feature
invited presentations by

* T. DeRose (USA)
* T. Dokken (Norway)
* G. Farin (USA)
* T. Goodman (UK)
* H. Hagen (Germany)
* J. Hoschek (Germany)
* C. Manni (Italy)
* M. Neamtu (USA)
* T. Sederberg (USA)

All other participants from academia as well as from industry
are invited to present a research talk of approximately
20 minutes. Relevant subjects include (but are not limited to):

Curve and surface approximation
Scattered data approximation and modelling
Multidimensional approximation and modelling
Hierarchical modelling
Subdivision and wavelets

Persons interested in organizing a minisymposium should send
an email to before March 1, 2000.

For further information concerning the workshop,
which will be updated regularly, see the web page

For the time being, we invite everyone to declare their possible
by submitting the corresponding electronic form accessible on the
conference web page. They will then be included in our electronic

Any other email correspondence concerning the conference should be sent to

Important deadlines are

Submission of Abstracts: April 15, 2000
Registration: May 31, 2000

The organizing committee

Tom Lyche (University of Oslo)
Knut Morken (University of Oslo)
Ewald Quak (SINTEF Applied Mathematics, Oslo)
Larry Schumaker (Vanderbilt University, Nashville)


From: Erricos John Kontoghiorghes <>
Date: Sat, 4 Dec 1999 11:04:43 +0000 (GMT)
Subject: CFP Parallel Matrix Algorithms and Applications

18-20 August 2000, Neuchatel, Switzerland

Organized in co-operation with the Society for Industrial and Applied
Mathematics (SIAM) Activity Group on Linear Algebra (SIAGLA) and
endorsed by the International Linear Algebra Society (ILAS).

This international workshop is aims to be a forum for the exchange of
ideas and competence for specialists in those areas of parallel
computing that are based on matrix algorithms. Emphasis will be on:

1. Implementation and performance issues on various types of parallel

2. Parallel algorithms for dense, structured and sparse matrices.

3. Algorithmic engineering & complexity (matrix algorithms based on
parallel models of computation such as pram, systolic arrays, etc.)

4. Applications with emphasis on parallel matrix computations
(applications from diverse fields such as fluid dynamics,
econometrics and financial optimization).

The keynote speakers are

o Ahmed Sameh (Purdue University, USA): Parallel Algorithms for
Solving Indefinite Systems.

o Anna Nagurney (University of Massachusetts, USA): Parallel
Computation of Financial Equilibria as Variational Inequalities.

There will be two days of tutorials before the workshop. A small fee
will be charged for attendance at tutorials:

o Yousef Saad, University of Minnesota, USA
o Steve Barnard, NASA Ames Research Center, USA
o Maurice Clint, Queens University of Belfast, UK
o Marcin Paprzycki, University of Southern Mississippi, USA
o Anna Nagurney, University of Massachusetts, USA
o Berc Rustem, Imperial College, UK
o Stavros Siokos, Salomon Smith Barney, UK

International Program Committee:

S. Barnard (USA) C. Brezinski (France), M. Clint (UK), J. Dongarra
(USA), N. Emad (France), J. Erhel-Chaux (France), S. Gallopoulos
(Greece), M. Hegland (Australia), A. Kiper (Turkey), G. Megson (UK),
H. Park (USA), B. Philippe (France) Y. Saad (USA), A. Sameh (USA),
G.W. Stewart (USA), D. Trystram (France), M. Vajtersic (Slovakia),
P. Yalamov (Bulgaria), Z. Zlatev (Denmark).

Organizing committee:

E. Kontoghiorghes, University of Neuchatel (chair)
P. Arbenz, ETH Zurich
O. Besson, University of Neuchatel
M. Paprzycki, University of Southern Mississippi, Hattiesburg
P. Foschi, University of Neuchatel (local arrangements)

Important dates:

Submission of 1-page abstracts: 01 May 2000
Notification of acceptance: 05 June 2000
Workshop: 18-20 August 2000
Submission of full papers: 15 November 2000
Notification of acceptance: 01 February 2001
Final papers: 15 March 2001

The workshop will take place the weekend just before IMACS2000 in
Lausanne, Switzerland, and a week before the Euro-Par 2000, Munich,
Germany. Neuchatel is 40 mins by train from Lausanne.

For further information please send a message at, contact a member of the organizing
committee or consult the WWW pages at:


From: Jose Castillo <>
Date: Mon, 29 Nov 1999 09:57:21 -0800 (PST)
Subject: Faculty Positios at San Diego State


Applications are invited for two tenure-track positions in mathematics at
the assistant professor level. Exceptionally strong candidates may be
consid-ered at a higher rank. The position requires a doctorate in
mathematics or a closely related field. The successful candidate must
show promise of excellence in teaching at the undergraduate and
graduate level and have an active and productive research program in
the mathematics of communication, such as coding theory, cryptography,
computational number theory, and certain areas of applied algebra.
Persons who have the potential to interact success-fully with engineers
and scientists in the local communications industry are strongly
encouraged to apply. Duties include teaching of undergraduate and
graduate courses in mathematics, helping start new courses in
information theory, coding theory, and cryptography, directing
undergraduate and grad-uate students, conducting research and
publishing in recognized scholarly journals. Closing date: January 1,
2000; applications received after that date will be considered if the
position is still open. Please send vita and have at least three
letters of recommendation sent to

Communications Search Committee
Department of Mathematical and Computer Sciences
San Diego State University
San Diego, CA 92182-7720

SDSU is an Equal Opportunity Title IX Employer and does not
discriminate against persons on the basis of race, religion, national
origin, sexual orientation, gender, marital status, age, or


From: Linne Querubin <>
Date: Mon, 29 Nov 1999 14:05:02 -0500
Subject: Endowed Professorship at the University of Pittsburgh


The Mathematics Department of the University of Pittsburgh invites
applications for an endowed Mellon Chair, to begin with the Fall Term 2000
subject to budgetary approval. Mellon Chairs are intended to be the most
prestigious academic appointments at the University of Pittsburgh.
Applicants should have outstanding research records and be acknowledged
leaders in their fields of expertise. We also seek excellence in teaching
so applicants should demonstrate a dedication to teaching and supervising
students. The applicant should be committed to taking a leadership role
in advancing the research profile and national reputation of the
We particularly encourage applications from members of under represented
minority groups and women. The University of Pittsburgh is an affirmative
action, equal opportunity employer. Send a vita, and the names and
addresses of up to five experts who support your application to:

Mellon Search Committee
Department of Mathematics
University of Pittsburgh
Pittsburgh, PA 15260

The Search Committee will begin the selection process on January 4, 2000.


From: Phil Smith <>
Date: Tue, 30 Nov 1999 08:12:53 -0600
Subject: Position Available at Texas Tech

Position Available
Environmental Modeler
The Institute of Environmental and Human Health

A tenure-track Environmental Modeler position is available at all academic
ranks at The Institute of Environmental and Human Health (TIEHH) at Texas
Tech University and Texas Tech University Health Sciences Center. The
successful candidates must have either a Ph.D. or M.D. degree and a minimum
of three years postdoctoral experience. Strong quantitative skills as
applied to both basic and applied research are highly relevant as is the
ability to interact well and participate in multidisciplinary research
teams. The person employed in this position will be expected to develop an
independent research program in environmental modeling using
high-performance computing and visualization, and work with other members of
the Institute on projects addressing environmental and human health. The
Texas Tech High Performance Computing Center is located at TIEHH and houses
a 56-processor based SGI Origin2000TM high-performance computer. This
computer is interfaced with a 40-seat auditorium-style virtual reality
center for use in data modeling and visualization. TIEHH is a
multidisciplinary research and education institute with a home page at <> that has recently established a
National Center for Countermeasures to Chemical and Biological Threats. The
candidate is expected to be an active member of this center.
Texas Tech University is an AA/EEO employer that encourages
applications from women and minorities. This position (#2001TLF034) is
available immediately and the search will continue until an applicant has
been selected. Applicants should submit a letter of interest, curriculum
vitae and a minimum of three letters of reference to:

Louis. A. Chiodo, Ph.D.
Chairman, Search Committee
The Institute of Environmental and Human Health
Texas Tech University/ Texas Tech University Health Sciences Center
Box 41163
Lubbock, TX 79409-1163


From: Chi-Wang Shu <>
Date: Sun, 28 Nov 1999 18:23:23 -0500 (EST)
Subject: Graduate Traineeships and Postdoctoral Fellowships at Brown

Brown VIGRE Graduate Traineeships

The Brown Mathematics Department and the Division of Applied Mathematics
will be offering a number of Graduate Traineeships starting in the year
2000. These positions will have many of the benefits of an NSF supported
graduate fellowship, combined with training in instruction and some TA
assignments. Participating graduate students will participate in the
graduate program at Brown, as well as have the opportunity to work with
some new activities, such as outreach programs and mentoring of Brown
undergraduates. Candidates must be US citizens, nationals or permanent
residents to qualify for these NSF supported positions.

The deadline for application to the graduate program is January 2, 2000.
Full details can be obtained from the Brown websites:

Applied Mathematics:

or by e-mail query to:

Applied Mathematics:

Brown VIGRE Postdoctoral Fellowships

The new VIGRE Postdoctoral Fellowships at Brown provide an opportunity
for promising mathematicians to work in the departments of Mathematics
or Applied Mathematics under the auspices of the new NSF - VIGRE Program.
These positions come with a favorable teaching load and provide an active
and stimulating working environment. The fellowship includes summer support
and a $2,500/year research grant. There are additional opportunities
for summer internships at industry-based research labs and at national
laboratories. Candidates must be US citizens, nationals or permanent
residents to qualify for these NSF supported positions.

The deadline for postdoctoral applications in the Division of Applied
Mathematics is January 15, 2000. The deadline for postdoctoral applications
in the Mathematics Department is December 1, 1999.

Full details can be obtained from the Brown websites:

Applied Mathematics:


From: Oleg Burdakov <>
Date: Wed, 1 Dec 1999 19:47:59 +0100 (MET)
Subject: Contents, Optimization Methods and Software

Special Issue of OMS on Interior Point Methods
Table of Contents
Optimization Methods and Software (OMS)
Volumes 11&12 (December, 1999) - a part of the 2000 subscription block
Special Issue on Interior Point Methods (CD supplement with software)
Guest Editors: Florian Potra, Cornelis Roos and Tamas Terlaky

M.J. Todd
A study of search directions in primal-dual interior-point methods for
semidefinite programming

Masakazu Kojima, Masayuki Shida and Susumu Shindoh
A note on the Nesterov-Todd and the Kojima-Shindoh-Hara search
directions in semidefinite programming

Masayuki Shida
On long-step predictor-corrector interior-point algorithm for
semidefinite programming with Monteiro-Zhang unified search directions

Jean-Pierre Haeberly, Madhu V. Nayakkankuppam, and Michael L. Overton
Extending Mehrotra and Gondzio higher order methods for mixed
semidefinite-quadratic-linear programming

Renato D.C. Monteiro and Paulo R. Zanjacomo
Implementation of primal-dual methods for semidefinite programming
based on Monteiro and Tsuchiya Newton directions and their variants

Takashi Tsuchiya
A convergence analysis of the scaling-invariant primal-dual
path-following algorithms for second-order cone programming

J. Frederic Bonnans, Cecilia Pola, and Raja Rebai
Perturbed path following predictor-corrector interior point algorithms

Stefania Bellavia and Maria Macconi
An inexact interior point method for monotone NCP

Yu. Nesterov, O. Peton, J.-Ph. Vial
Homogeneous analytic center cutting plane methods with approximate centers

Anna Altman and Jacek Gondzio
Regularized symmetric indefinite systems in interior point methods for
linear and quadratic optimization

Arkadi Nemirovski
On self-concordant convex-concave functions

Yin Zhang
User's guide to LIPSOL: Linear Programming Interior Point Solvers v0.4

Joseph Czyzyk, Sanjay Mehrotra, Michael Wagner and Stephen J. Wright
PCx: An interior-point code for linear programming

Csaba Meszaros
The BPMPD interior solver for convex quadratic problems

Robert J. Vanderbei
LOQO: an interior point code for quadratic programming

Robert J. Vanderbei
LOQO user's manual - version 3.10

Steven J. Benson, Yinyu Ye and Xiong Zhang
Mixed linear and semidefinite programming for combinatorial and quadratic

K.C. Toh, M.J. Todd and R.H. Tutuncu
SDPT3 - a MATLAB software package for semidefinite programming,
Version 1.3

Nathan Brinxius, Florian A. Potra and Rongqin Sheng
SDPHA: a MATLAB implementation of homogeneous
interior-point algorithms for semidefinite programming

Brian Borchers
CSDP 2.3 user's guide

Brian Borchers
CSDP, a C library for semidefinite programming

Jos F. Sturm
Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones

H.D. Mittelman
Benchmarking interior point LP/QP solvers

Istvan Maros, Csaba Meszaros
A repository of convex quadratic programming problems

Brian Borchers
SDPLIB 1.2, a library of semidefinite programming test problems

Forthcoming papers and complete table of contents for the journal OMS:

Instructions for authors, subscription information, free sample copies:

Latex style files:


From: Hans Schneider <>
Date: Fri, 3 Dec 1999 11:18:23 -0600 (CST)
Subject: Contents, Linear Algebra and Its Applications

Journal: Linear Algebra and Its Applications
ISSN : 0024-3795
Volume : 301
Issue : 1-3
Date : 10-Dec-1999

pp 1-13
Some multiplicative preservers on B(H)
L Molnar

pp 15-49
Stable subspaces of matrix pairs
FE Velasco

pp 51-62
On transformations of elliptic spaces
IM Idris

pp 63-80
(A,B)-cyclic submodules
J Brewer, W Schmale

pp 81-97
Some characterizations of graphs by star complements
D Cvetkovic, P Rowlinson

pp 99-112
Linear operators preserving the sign-real spectral radius
B Zalar

pp 113-119
Invariant subspaces of two Hermitian structures on a Euclidean space
P Coulton

pp 121-136
Strong duality for a trust-region type relaxations of the quadratic
assignment problem
K Anstreicher, H Wolkowicz

pp 137-144
When is NEPS of graphs connected?
D Stevanovic

pp 145-152
A symmetric algorithm for Toeplitz systems
A Melman

pp 153-170
On invertibility preserving linear mappings, simultaneous
triangularization and property L
E Christensen

pp 171-185
Relative perturbation bound for invariant subspaces of graded
indefinite hermitian matrices
N Truhar, I Slapnicar

pp 187-194
Normal forms and joint numerical ranges of doubly commuting matrices
V Bolotnikov, L Rodman

pp 195-201
Sign-nonsingular matrices and matrices with unbalanced determinant in
symmetrised semirings
P Butkovic


End of NA Digest