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

- Old Egyptian Games
- History of Nabla
- W.T. and Idalia Reid Prize
- New Book on Interval Computations
- New Internet Book on Scientific Supercomputing
- International Congress of Mathematicians
- Conference in Kuwait on Fourier Analysis and Applications
- Benelux Signal Processing Symposium
- SIAM Great Lakes Section Form on PDEs
- Symposium on Solving Irregularly Structured Problems in Parallel
- Final Announcement & Programme for the PINEAPL Workshop
- Finite Element Circus
- Numerical Methods and Computational Mechanics
- Position at Universite Claude Bernard Lyon
- Postdoctoral Positions at University of New South Wales
- Special Issue of Computational Statistics & Data Analysis
- Contents, SIAM Journal on Numerical Analysis
- Contents, SIAM Journal on Applied Mathematics
- Contents, Surveys on Mathematics for Industry
- Contents, Computing and Visualization in Science

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

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

From: Dietrich Braess <braess@num.ruhr-uni-bochum.de>

Date: Wed, 21 Jan 1998 14:54:16 +0100

**Subject: Old Egyptian Games**

Old egyptian games: Senet and the Game of The Twenty

This Christmas I got two old egyptian games as a present

from some organization: They are called 'Senet' and

'Game of The Twenty'. There is only some literature

about the old egyptian side.

Does somebody know mathematical theories or strategies

for these games?

Dietrich Braess, Bochum, Germany

braess@num.ruhr-uni-bochum.de

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

From: Arnold Neumaier <neum@cma.univie.ac.at>

Date: Mon, 19 Jan 1998 21:38:43 +0100

**Subject: History of Nabla**

Last week I posted the question:

Does anyone know the history of using the symbol $\nabla$ for

the gradient, and the meaning of the symbol outside of mathematics?

to na-net, and got a number of interesting answers. Thanks to all

who replied. A summary appears below; the full text of the replies I

got is available at

http://solon.cma.univie.ac.at/~neum/contrib/nabla.txt

Corrections to the information given below are welcome.

Arnold Neumaier

http://solon.cma.univie.ac.at/~neum

=====

The most definite information came from Avinoam Mann (MANN@VMS.HUJI.AC.IL)

who had posted a contribution to a nabla discussion on the academia mailing

list (ACADEMIA@techunix.technion.ac.il), and it was communicated to me by

Dani Censor (CENSOR@bguee.ee.bgu.ac.il), the maintainer of the list.

Mann refers to two web sites by Jeff Miller,

<A HREF="http://members.aol.com/jeff570/mathword.html">

Earliest Known Uses of Some of the Words of Mathematics</A>

<P>

<A HREF="http://members.aol.com/jeff570/mathsym.html">

Earliest Uses of Various Mathematical Symbols</A>

<P>

where one can find the following:

http://members.aol.com/jeff570/mathsym.html

These pages show the names of the individuals who first used various

common mathematical symbols, and the dates the symbols first

appeared. Written sources are listed on a separate page. The most

important written source is the definitive A History of Mathematical

Notations by Florian Cajori.

http://members.aol.com/jeff570/calculus.html [from mathsym.html]

The Hamiltonian operator. The symbol , which is also called a "del,"

"nabla," or "atled" (delta spelled backwards), was introduced

by William Rowan Hamilton (1805-1865) in 1853 in Lectures on

Quaternions, according to Cajori vol. 2, page 135.

David Wilkins has found the symbol used earlier by Hamilton in the

Proceedings of the Royal Irish Academy of the meeting held on

July 20, 1846. The volume appeared in 1847. However the symbol is

rotated 90 degrees.

http://members.aol.com/jeff570/m-r.html [from mathword.html]

The word NABLA (for the "del" or Hamiltonian operator) was suggested

humorously by James Clerk Maxwell, according to one source. According to

a post in sci.math by Noam D. Elkies, the term was coined by Tullio

Levi-Civita (1873-1941). A nabla is the name of an Egyptian harp. Cajori

(vol. 2, page 135) says Heaviside called the symbol a nabla.

=====

Garry Tee mentioned that the standard biographies of Kelvin by

S. P. Thompson (1910) and Andrew Gray, and by Crosbie Smith in

"Energy and Empire" (CUP 1989) say something to the effect that

the symbol $\nabla$ was invented (c1870) by William

Thomson (later Baron Kelvin), as a modification of the symbol $\delta$

which he used for the Laplacian operator. The symbol suggests the

shape of a harp, and so Thomson gave it the Greek name.

But these references are many years later than Hamilton.

=====

As regards language, nabla is the Greek word for some sort of harp.

David Schaps (dschaps@mail.biu.ac.il) points out that the greek word

does not derive from the related Hebrew word nevel=nebel for harp

since it can be found already in the work of Sophocles. But probably

the common origin of both words is aramaic. Indeed, S I Ben-Abraham

(benabr@BGUMAIL.BGU.AC.IL) writes:

I venture to add that <nabla> was borrowed to Greek via its Aramaic

definite form <NBLA> (analogous to <alpha, beta, etc>.

And Alexandre Chorin (chorin@math.berkeley.edu) writes:

I just had a conversation with Vivian Roumani (a librarian at UC

Berkeley) and Morton Denn (Chair, Chem. Eng. at UC Berkeley),

who told me that the symbol Nabla was invented by Hamilton;

it is supposed to a drawing of an ancient hebrew harp

(Nevel in Hebrew, Nabla in Aramaic).

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

From: Alison Bogardo <bogardo@siam.org>

Date: Thu, 22 Jan 98 11:00:42 -0500

**Subject: W.T. and Idalia Reid Prize**

REMINDER - DEADLINE FAST APPROACHING

SIAM will present the W.T. and Idalia Reid Prize at the 1998

SIAM Annual Meeting in Toronto, Canada, July 13-17. The

award will be given for research in, or other contributions

to, the broadly defined areas of differential equations and

control theory. The prize may be given either for a single

notable achievement or for a collection of such

achievements.

The prize is awarded to any member of the scientific

community who meets the general guidelines of the prize

description above.

The award consists of an engraved medal and a $10,000 cash

prize.

A letter of nomination, including a description of

achievement(s) should be sent BY FEBRUARY 1 to:

Professor John A. Burns

Chair, Reid Prize Selection Committee

c/o Allison Bogardo

SIAM

3600 University City Science Center

Philadelphia, PA 19104-2688

Telephone: 215-382-9800

Fax: 215-386-7999

E-mail: bogardo@siam.org

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

From: Vladik Kreinovich <vladik@cs.utep.edu>

Date: Sat, 17 Jan 98 17:09:02 MST

**Subject: New Book on Interval Computations**

Kluwer Academic Publishers, Dordrecht, has just published a book

"Computational Complexity and Feasibility of Data Processing

and Interval Computations" by V. Kreinovich, A. Lakeyev, J. Rohn,

and P. Kahl (ISBN 0-7923-4865-6 November 1997, 472 pp.)

This book is Vol. 10 in the series on Applied Optimization

The publisher's blurb:

The input data for data processing algorithms come from

measurements and are hence not precise. We therefore need

to estimate the accuracy of the results of data

processing. It turns out that even for the simplest data

processing algorithms, this problem is, in general,

intractable. This book describes for what classes of

problems interval computations (i.e. data processing with

automatic results verification) are feasible, and when

they are intractable.

Contents:

Preface

Ch. 1: Informal Introduction: Data Processing, Interval

Computations, and Computational Complexity

Ch. 2: The Notions of Feasibility and NP-Hardness: Brief Introduction

Ch. 3: In the General Case, The Basic Problem of

Interval Computations Is Intractable

Ch. 4: Basic Problem of Interval Computations for

Polynomials of a Fixed Number of Variables

Ch. 5: Basic Problem of Interval Computations For Polynomials of Fixed Order

Ch. 6: Basic Problem of Interval Computations for

Polynomials with Bounded Coefficients

Ch. 7: Fixed Data Processing Algorithms, Varying Data: Still NP-Hard

Ch. 8: Fixed Data, Varying Data Processing Algorithms: Still Intractable

Ch. 9: What If We Only Allow Some Arithmetic Operations in Data Processing?

Ch. 10: For Fractionally-Linear Functions, A Feasible

Algorithm Solves The Basic Problem of Interval Computations

Ch. 11: Solving Interval Linear Systems is NP-Hard

Ch. 12: Interval Linear Systems: Search for Feasible Classes

Ch. 13: Physical Corollary: Prediction is Not Always Possible,

Even for Linear Systems with Known Dynamics

Ch. 14: Engineering Corollary: Signal Processing is NP-Hard

Ch. 15: Bright Sides of NP-Hardness of Interval Computations I:

NP-Hard Means That Good Interval Heuristics Can Solve Other Hard Problems

Ch. 16: If Input Intervals are Narrow Enough, Then

Interval Computations are Almost Always Easy

Ch. 17: Optimization -- A First Example of a Numerical Problem in Which

Interval Methods are Used: Computational Complexity and Feasibility

Ch. 18: Solving Systems of Equations

Ch. 19: Approximation of Interval Functions

Ch. 20: Solving Differential Equations

Ch. 21: Properties of Interval Matrices I: Main Results

Ch. 22 Properties of Interval Matrices II: Proofs and Auxiliary Results

Ch. 23: Non-Interval Uncertainty I: Ellipsoid Uncertainty

and its Generalizations

Ch. 24: Non-Interval Uncertainty II: Multi-Intervals and their Generalizations

Ch. 25: What if Quantities Are Discrete?

Ch. 26: Error Estimation for Indirect Measurements: Interval

Computation Problem is (Slightly) Harder than a Similar

Probabilistic Computational Problem

Appendix A: In Case of Interval (or More General) Uncertainty, No

Algorithm Can Choose the Simplest Representative

Appendix B: Error estimation for

indirect measurements: case of approximately known functions

Appendix C: Interval Computations to Modal Mathematics

Appendix D: Beyond NP: Two Roots Good, One Root Better

Appendix E: Does "NP-Hard" Really Mean "Intractable"?

Appendix F: Bright Sides of NP-Hardness of Interval Computations II:

Freedom of Will?

Appendix G: The Worse, the Better: Paradoxical Computational

Complexity of Interval Computations and Data Processing

References

Index

Detailed information about the book is available from the Kluwer website

http://www.wkap.nl/book.htm/0-7923-4865-6

The link to this and other books on interval computations can be found

on the interval computations website

http://cs.utep.edu/interval-comp/main.html (click on books).

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

From: Willi Schoenauer <schoenauer@rz.uni-karlsruhe.de>

Date: Thu, 22 Jan 98 10:44:26 +0100

**Subject: New Internet Book on Scientific Supercomputing**

I have just finished the first 11 chapters (of 18) of a new book

Scientific Supercomputing:

Architecture and Use of Shared and Distributed Memory

Parallel Computers

Willi Schoenauer

Rechenzentrum Universitaet Karlsruhe

Germany

Table of Contents:

1. Introduction

2. Prototypes with their Bottlenecks

3. Arithmetic Operations and Memory Bandwidth

4. The CRAY T90

5. The Fujitsu VPP300 (and VPP700)

6. The IBM RS/6000 SP

7. The CRAY T3E and DEC Alpha Processors

8. Performance Analysis

9. Basic Considerations Concerning Data Structures

10. Fortran, Autovectorizatation and Autoparallelization, Programming Models

11. Recurrences

The pages of the book are the scanned hand-written pages of my

manuscript and the contents is that of my lecture on Scientific

Supercomputing.

The URL is

http: //www.rz.uni-karlsruhe.de/Uni/RZ/Personen/rz03/book

The remaining chapters will follow as time permits.

Willi Schoenauer

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

From: Christoph Helmberg <helmberg@zib.de>

Date: Tue, 20 Jan 1998 12:03:42 +0100

**Subject: International Congress of Mathematicians**

Dear Colleague:

The Organizing Committee is pleased to announce the availability of

The Second Announcement of

THE INTERNATIONAL CONGRESS OF MATHEMATICIANS

BERLIN, August 18-27, 1998

It can be retrieved from the homepage of the Congress with URL:

http://elib.zib.de/ICM98

ICM'98 is one of the quadrennial congresses held under the auspices of the

International Mathematical Union (IMU). Mathematicians from all countries

gather to discuss recent developments in mathematics that are presented by

leading scientists from all mathematical fields. Responsibility for the

scientific program lies with the Program Committee appointed by IMU. There

will be 21 one-hour Plenary Lectures covering the major areas of mathematics

and about 160 forty-five-minute Invited Lectures in nineteen sections.

The Fields Medals and the Nevanlinna Prize will be awarded during the Opening

Ceremony on the first day of the Congress. This will take place in the

International Congress Center Berlin (ICC). All other scientific events will

be held at Technische Universitaet Berlin. No scientific activities are

scheduled for Sunday, August 23.

The Second Announcement of ICM'98 describes the scientific program and the

social events of the Congress and gives instructions on how to complete the

registration process and obtain accommodation. It contains a call for

contributed short presentations, and provides guidelines regarding the

submission of abstracts.

The Second Announcement also includes advice on how to proceed upon arrival

at airports and railway stations, and it will be accompanied by a brochure

describing the day trips and tours organized by a professional tour and

congress organizer.

Postscript and LaTeX versions of the Second Announcement can be obtained

from the WWW with URL:

http://elib.zib.de/ICM98/Second_Announcement

or by anonymous ftp from elib.zib.de in the subdirectory

pub/IMU/HTML/ICM98/Second_Announcement. The files of interest are

scndannc.ps Announcement Postscript DIN A4

us_scnda.ps Postscript US-paper

scndannc.tex LaTeX (no maps)

reg-form.ps Registration Form Postscript DIN A4

us_regf.ps Postscript US-paper

wordregf.doc MS-Word 6.0

We look forward to welcoming you at ICM'98 in Berlin.

Christoph Helmberg (for the ICM'98 Organizing Committee)

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

From: Georg Heinig <georg@MATH-1.sci.kuniv.edu.kw>

Date: Tue, 20 Jan 1998 08:32:16 GMT+3

**Subject: Conference in Kuwait on Fourier Analysis and Applications**

SECOND ANNOUNCEMENT

International Conference

Fourier Analysis and Applications (FAA98)

May 3-6, 1998

Kuwait University Campus, State of Kuwait

The conference is sponsored and organized jointly by

Kuwait University (KU) Kuwait Foundation for the Advancement

of Sciences (KFAS)

Topics

- Trigonometric Series and Approximation

- Fourier and Integral Transforms

- Fast Fourier Techniques

- Wavelets

- Applications to Differential and Integral Equations

The following invited speakers have confirmed their participation

M. Annaby (Cairo University, Egypt)

R. Bathia (Indian Statistical Institute, India)

D. Bini (University of Pisa, Italy)

A. Boettcher (TU Chemnitz, Germany)

P. Butzer (RWTH Aachen, Germany)

R. Higgins (Anglia Polytechnic University, UK)

M. Ismail (University of South Florida, USA)

N. Nikolski (University of Bordeaux, France)

S. Saitoh (Gunma University, Japan)

B. Silbermann (TU Chemnitz, Germany)

H.M. Srivastava (University of Victoria, Canada)

G. Strang (MIT, USA)

M. Tasche (University Rostock, Germany)

H. Triebel (University of Jena, Germany)

M. Yamamoto (University of Tokyo, Japan)

On-line registration is available at

http://www.sci.kuniv.edu.kw/faa98.html

For further information please contact:

Dr. Fadhel Al-Musallam

FAA98-Organizing Committee

Department of Mathematics & Computer Science

Kuwait University, P.O.Box 5969 Safat 13060, Kuwait

Tel.: +965-4813129

Fax: +965-4817201

E-Mail : FAA98@math-1.sci.kuniv.edu.kw

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

From: Marc Moonen <Marc.Moonen@esat.kuleuven.ac.be>

Date: Tue, 20 Jan 1998 12:09:15 +0100

**Subject: Benelux Signal Processing Symposium**

IEEE BENELUX SIGNAL PROCESSING CHAPTER

SIGNAL PROCESSING SYMPOSIUM

March 26-27, 1998, Leuven, Belgium

The first IEEE Benelux Signal Processing Symposium, sponsored by the

IEEE Benelux Signal Processing Chapter, will be held March 26-27, 1998

in the K.U.Leuven Faculty Club, Leuven, Belgium.

The program consists of invited tutorial presentations by

Prof. Peter Grant (University of Edinburgh, U.K.),

*IEEE Signal Processing Society Distinguished Lecturer*

CDMA array processing

Prof. Steve Young (Cambridge University, U.K.),

Large vocabulary continuous speech recognition

Prof. Charles Therrien (Naval Postgraduate School, Monterey, U.S.A.),

*IEEE Signal Processing Society Distinguished Lecturer*

History of the Statistical Theory of Communication: The Lee-Wiener Legacy

Prof. Pierre Duhamel (ENST Paris, France) and

Signal processing in source compression : is PR compulsory ?

Can we reduce artifacts due to DCT coding based on DCT properties?

Prof. Inald Lagendijk (TU Delft, The Netherlands),

Watermarking signal processing techniques for video copy protection

as well as selected oral presentations and informal poster sessions.

A complete program, as well as registration and hotel information,

is available at

http://www.esat.kuleuven.ac.be/~moonen/SPS.html

Workshop Secretariat:

Mrs. Ida Tassens

Dept. of Electrical Engineering

Kath. Universiteit Leuven

K. Mercierlaan 94

B-3001 Heverlee, Belgium

tel : +32-16-32 17 09,

fax : +32-16-32 19 70

Ida.Tassens@esat.kuleuven.ac.be

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

From: Kevin TeBeest <ktebeest@kettering.edu>

Date: Wed, 21 Jan 1998 10:08:36 -0500

**Subject: SIAM Great Lakes Section Form on PDEs**

The SIAM Great Lakes Section's

"Forum on Numerical Methods for

Partial Differential Equations"

will be held at Kettering University (formerly called the GMI Engineering

& Management Instititue) in Flint, MI on March 14, 1998.

A list of speakers, presentation titles & abstracts, and additional

information may be found at the forum's website:

http://www.kettering.edu/~ktebeest/numpdes

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

From: Jose D. P. Rolim <Jose.Rolim@cui.unige.ch>

Date: Thu, 22 Jan 1998 09:13:09 +0100

**Subject: Symposium on Solving Irregularly Structured Problems in Parallel**

NEW SUBMISSIONS DEADLINE: JANUARY 30

IRREGULAR'98

Call for Papers

Fifth International Symposium on:

Solving Irregularly Structured Problems in Parallel

August 9-11, 1998

NERSC, Lawrence Berkeley National Laboratory

Berkeley, California, USA

Scope

The Symposium on Solving Irregularly Structured Problems in Parallel

focuses on algorithmic, applicational and system aspects arising in the

development of efficient parallel solutions to irregularly structured

problems. It aims, in particular, at fostering cooperation among

practitioners and theoreticians in the field. IRREGULAR '98 - to be

held at the National Energy Research Scientific Computing Center

(NERSC), Lawrence Berkeley National Laboratory in Berkeley, California,

USA, on August 9-11, 1998 - is the fifth in the series, after Geneva,

Lyon, Santa Barbara, and Paderborn.

Topics

Papers are solicited in all research areas related to the parallelism of

irregular problems, including but not limited to:

o abstract parallel models

o applications

o approximation

o automatic program synthesis

o combinatorial optimization

o compiler optimization

o computational geometry

o data structures

o graph algorithms

o load balancing

o mapping, and scheduling

o memory management

o mesh computations

o numerical algorithms

o parallel I/O

o parallel languages

o randomization

o sparse matrix computations

o symbolic computation

o particle simulations

Important Dates

Submissions: January 30, 1998

Notification: April 12, 1998

Camera ready: May 24, 1998

Further information

http://www.nersc.gov/Irregular98

COMMITTEE

Symposium Chairs

A. Ferreira

J. Rolim

Program Committee

H. Simon

S. H. Teng

R. Anderson

S. Ashby

M. Bern

C. Farhat

A. Gramma

H. Hellwagner

Q. Lu

E. Ng

M. Nivat

P. Plassman

A. Rau-Chaplin

S. Rao

C.C. Ribeiro

R. Schreiber

D. Trystram

M. Vajtersic

T. Yang,

Invited Speakers

G. L. Miller

J. R. Gilbert

K. Pingali

M. Valero

B. Hendrickson

Local Organizer

R. Boucher

Lawrence Berkeley National Laboratory, USA

e-mail: RLBoucher@lbl.gov

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

From: Mishi Derakhshan <mishi@nag.co.uk>

Date: Fri, 23 Jan 1998 14:34:45 +0100 (BST)

**Subject: Final Announcement & Programme for the PINEAPL Workshop**

Final Programme

PINEAPL Workshop:

A Workshop on the Use of Parallel Numerical Libraries

in Industrial End-user Applications

February 9-10, 1998

Toulouse, France

Day 1: Starts at 9:00 and ends at 18:30

- Welcome and Introduction

- Tutorial session on the use of the NAG Parallel

(and the PINEAPL) Libraries

- Discussion on the use of PRECISE in the PINEAPL Project

- Industrial End-users Presentations:

o Dr Paolo Nobile (PIAGGIO, Italy)

The Use of KIVA-3 Code for the Design of New Two-Stroke Engines

o Dr Pasqua D'Ambra (CPS-CNR, Italy) and Dr Salvatore Filippone

(IBM, Italy) The Integration of the PINEAPL Library in the KIVA-3

Application Software

o Mr Mike Blakemore (British Aerospace, UK)

Utilising the PINEAPL Library for Applications within the fields

of CFD and Electromagnetics

o Mr Thomas Christensen & Mr Lars Sorensen (Math-Tech & DHI, Denmark)

Using Parallel Numerical Library Routines in a Hydrodynamics

Application

o Dr Yves Perreal (Thomson-CSF/LCR, France)

Thomson's Applications in the PINEAPL Project

- Clinic session/users' experience with the use of numerical libraries:

This will be an interactive session in which participants

are invited to consult with experts on the use of parallel

routines in their applications. Participants may give short

presentations of their own for general discussion, as well

as meet directly with parallel library developers.

This session is intended to be useful for those people from:

o Industry and research institutes

o Hardware vendors who would like to discuss the feasibility

of porting the PINEAPL Library on to their parallel systems

Day 2: Starts at 9:00 and ends at 17:30

- Prof Sven Hammarling (NAG, UK)

Welcome and Short Introduction

- Dr Mishi Derakhshan (NAG, UK)

Introduction to the PINEAPL Project

- Prof David Walker (Cardiff, UK)

Problem Solving Environments in Academic and Industrial Research

- Prof Iain Duff (RAL, UK)

The PARASOL Project and Sparse Matrix Applications

- Dr Arnold Krommer (NAG, UK)

Parallel Sparse Linear Algebra Computations Using the PINEAPL Library

- Dr Clemens-August Thole (GMD, GERMANY)

Port of Industrial Applications onto Parallel Architectures during

EUROPORT-1: Overview with Special Emphasis on Numerical Kernels

- Prof F. Chaitin-Chatelin (CERFACS, France)

The PRECISE Tool-box

- Dr Carlo Poloni (Universita' di Trieste, Italy)

Optimisation Needs and Results in the FRONTIER Project

- Prof Sven Hammarling (NAG, UK)

ScaLAPACK: High Performance Software for Dense Linear Algebra

There is no workshop fee but participants must register to attend

because of the space limitation.

Subject to a collaborative agreement, the participant will also

obtain a copy of the recently released PINEAPL Library.

The workshop will be hosted by CERFACS in Toulouse and the URL

for the workshop is:

http://www.cerfacs.fr/algor/pineapl_work.html

This page contains information about the workshop and CERFACS,

including travel, hotel information, registration and local

arrangements, etc.

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

From: Leo Franca <lfranca@math.cudenver.edu>

Date: Fri, 23 Jan 1998 12:44:51 -0700 (MST)

**Subject: Finite Element Circus**

The Spring 1998 meeting of the Finite Element Circus will be

held on the campus of CU-Denver on Friday March 27 and Saturday

March 28. For more information on the Finite Element Circus

see the web page: http://www.math.psu.edu/dna/fecircus.html

and for information specific to the Spring 98 meeting see

http://www-math.cudenver.edu/~lfranca/circus/circus.html.

The circus consists of short talks, the length of the talks depending

on the number of people who wish to speak, with 15 minutes being

typical. The order of presentation is decided randomly at the beginning

of the circus and speakers must be present for the entire meeting.

First-time attendees are not encouraged to speak, so that they have an

opportunity to understand the spirit of the meeting before speaking at a

later circus.

Although there is no registration fee, you MUST register if you plan

to attend the spring meeting. Please fill out the form on the web page

http://www-math.cudenver.edu/~lfranca/circus/circus.html. Graduate

students are encouraged to attend. Please register as early as possible

so that we can plan in advance.

Thanks,

Leo Franca

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

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

Date: Mon, 26 Jan 1998 12:48:16 +0000

**Subject: Numerical Methods and Computational Mechanics**

SECOND ANNOUNCEMENT AND CALL FOR PAPERS

NUMERICAL METHODS AND COMPUTATIONAL MECHANICS

24-27th August 1998

The University of Miskolc,

Miskolc, Hungary

Organized by

Central European Association for Computational Mechanics

Janos Bolyai Mathematical Sociaty

Hungarian Acadamy of Sciences

The Miskolc Committee of the Hungarian Academy of Sciences

University of Miskolc

FIELDS OF PRIMARY INTEREST

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

problems, nonlinear systems, parallel algorithms, etc.)

-- Numerical solution of differential equations (IVP and BVP,

for ODEs and DAE, difference equations, FEM and BEM,

multigrid, difference methods, spectral methods, parallel

algorithms, etc.)

-- Computational mechanics (FEM, BEM, Optimization, Parallel

algorithms etc)

Forty five minute plenary lectures, thirty minute minisymposium

lectures and twenty minute long contributed talks are planned.

Chairman:

B.SZABO, Washington University in St. Louis, USA

Honorary chairman:

P. ROZSA, Technical University of Budapest, Hungary

INTERNATIONAL SCIENCE COMMITTEE

R.P.AGARWAL, National University of Singapore, Singapore

I. BABUSKA, The University of Texas, USA

C. BROYDEN, University of Bologna, Italy

M. GRIEBEL, University of Bonn, Germany

M. KLEIBER, Polish Academy of Sciences, Poland

H. MANG, Vienna Technical University, Austria

P. NEITTAANMAKI, University of Jyvaskyla, Finland

E. STEIN, University of Hannover, Germany

W. WENDLAND, Universitat Stuttgart, Germany

T. CZIBERE, University of Miskolc, Hungary

I. KOZAK, University of Miskolc, Hungary

Z. GASPAR, Technical University of Budapest, Hungary

I. PACZELT, University of Miskolc, Hungary

CALL FOR PAPERS

Authors who wish to present a 20-minute contributed lecture should

submit a two-page abstract in English and LATEX format with

article 12pt style. Page size is A4. Authors are kindly asked to

submit their abstracts via e-mail. Deadline: 30th of April, 1998.

MORE DETAILED INFORMATION

Please visit our WWW pages which are regularly updated and provide

you with more information on registration, format requirements,

accommodation travelling, schedule etc.

http://www.uni-miskolc.hu:8080/home/nmcm98/conf98.html

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

the mailing list, please SEND NOW, a message to

nmcm98@gold.uni.miskolc.hu

or a letter to

A.GALANTAI or Gy.SZEIDL

Institute of Mathematics or Department of Mechanics

University of Miskolc

3515 Miskolc-Egyetemvaros

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

From: Danielle Graveron <graveron@azur.univ-lyon1.fr>

Date: Mon, 19 Jan 1998 16:07:38 +0100 (MET)

**Subject: Position at Universite Claude Bernard Lyon**

VACANCY: COMPUTER SCIENCE

EU Programme TMR (Networks), FMRX- CT970160:

Advanced Signal Processing for Medical Magnetic Resonance Imaging and

Spectroscopy

Job Description:

Researcher (m/f), either Engineer/Doctoral student (preferably) or

postdoc in Computer Science with experience in Graphical User Interface

(GUI), Java/C++ and research interests. Participation in development

of a new GUI for existing MRS spectral analysis software and in

implementation/development of new algorithms for metabolite quantitation.

EU rules restrict eligibility to citizens of its 15 member states, plus

associated countries: Iceland,Israel,Liechtenstein and Norway.

Duration and Start Date: 16 months (1998-03-01)

Place of Work:

Resonance Magnetique Nucleaire (RMN), CNRS UPRESA 5012,

Universite Claude Bernard LYON I-CPE, Villeurbanne, FR.

Contact Person:

Graveron-Demilly, Danielle, Dr, RMN, CNRS UPRESA 5012,

Universite Claude Bernard Lyon I-CPE, FR.

33-4-72431049, 33-4-72448199, graveron@azur.univ-lyon1.fr

Network Homepage: http://azur.univ-lyon1.fr/TMR/tmr.html

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

From: Ian Sloan <sloan@ml.kva.se>

Date: Tue, 20 Jan 1998 10:35:27 +0100

**Subject: Postdoctoral Positions at University of New South Wales**

POST DOC POSITIONS AT THE UNIVERSITY OF NEW SOUTH WALES, IN SYDNEY

Two Postdoctoral positions in numerical analysis at the University

of New South Wales in Sydney are currently being advertised. Please contact

one or other of us by e-mail if you might be interested. The positions are

available for up to three years in one case, and up to two

years in the other. The official advertisement follows. The quoted

salaries are in $Australian. The exchange rate, last we heard, was

around $1 Australian to 65 cents US.

Ian Sloan i.sloan@unsw.edu.au

Bill McLean w.mclean@unsw.edu.au

School of Mathematics

The University of New South Wales

Sydney 2052

Australia

Research Associate - 2 positions

SCHOOL OF MATHEMATICS, UNIVERSITY OF NEW SOUTH WALES

REF. 001NA and REF. 002NA

FIXED TERM - Salary Range: $41,824 - $44,896 per year.

Applications are invited for two research positions supported by the

Australian Research Council (ARC). Applicants will have access to a

modern computing environment, including the facilities of the Parallel

Computing and Visualisation Laboratory at the nearby Australian

Technology Park, Redfern.

FOR REF 001NA:

This position is funded by the grant "Efficient solution of boundary

value problems", held by Professor I H Sloan and Dr W McLean. This

position is available for up to two years. A strong background in the

analysis of finite or boundary element methods is essential.

Experience with the use and development of scientific software is

desirable.

FOR REF 002NA:

This position is funded by the grant "Numerical integration and

approximation in high dimensions", held by Professor I H Sloan, and is

available for a period of up to three years. A good knowledge of

approximation theory or numerical analysis is essential. A good

knowledge of functional analysis and classical analysis and

information-based complexity is desirable.

FOR BOTH POSITIONS:

A PhD or equivalent, a proven capacity for independent research and a

knowledge of EEO/AA principles are essential. Appointment on either a

full-time or fractional basis would be considered. A secondment for a

period of up to one year would also be possible. The positions are

fixed term with the possibility of renewal dependent on funding.

Further information is available from Professor I H Sloan on telephone

(02) 9385 3357, email i.sloan@unsw.edu.au or Dr W McLean on telephone

(02) 9385 2827 or email w.mclean@unsw.edu.au. (January enquiries will

need to be by email.) Applications close 27 February 1998.

APPLICATION PROCEDURE

Applicants should submit written applications systematically

addressing the selection criteria, QUOTING REFERENCE NUMBER. Include

business and private telephone numbers; a complete resume, (copies of

academic transcript and qualifications where appropriate); and the

names, addresses (and preferably facsimile numbers) of at least two

referees to: The Recruitment Officer, Human Resources, The University

of New South Wales, Sydney NSW 2052 by applications close date.

Telephone +61 2 9385 2697, fax +61 2 9385 1575. There is no special

form for the application.

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

From: Erricos John Kontoghiorghes <erricos.kontoghiorghes@info.unine.ch>

Date: Thu, 22 Jan 1998 20:24:39 +0000

**Subject: Special Issue of Computational Statistics & Data Analysis**

COMPUTATIONAL STATISTICS & DATA ANALYSIS

CALL FOR PAPERS

Special Issue on PARALLEL PROCESSING AND STATISTICS

Guest Editor: Erricos J. Kontoghiorghes

Scope

Submissions are invited for a special issue of Computational

Statistics & Data Analysis on Parallel Processing and Statistics. The

aim of the special issue is to make statisticians aware of recent

developments in parallel processing that can be used efficiently to

tackle problems that previously have been considered unsolvable. At

the same time the special issue will bring to the attention of the

parallel processing community the various computer intensive and

large-scale statistical problems with the ultimate aim of promoting

research in parallelism and statistics.

The special issue will consider papers addressing the design, analysis

and implementation of parallel algorithms for solving statistical

problems. Papers dealing with theoretical and practical issues

associated with parallel statistical algorithms, the impact of

parallelism on statistics and specific applications involving

parallelism and statistics will be considered for the peer review

sections of the journal. Software tutorial and reviews, products from

software organizations and supercomputer vendors, book reviews and

other relevant information on parallelism and statistics will be

considered for publication in the the fourth section of the journal

SSN (Statistical Software Newsletter).

Important Dates

* Submission Deadline: September 1, 1998.

* Acceptance Decision: February 1, 1999.

* Final Version Due: March 1, 1999.

* Publication Date: July, 1999 (tentative)

Submissions

The focus of the papers submitted to the special issue must contain a

parallel computing and statistical component. Authors who are

uncertain as to the suitability of their papers for the special issue

should contact the special issue editor. All papers submitted must

contain original unpublished work that is not being submitted for

publication elsewhere.Instructions to authors and general information

about the Computational Statistics & Data Analysis,the official

journal of the International Association of Statistical Computing

(IASC), which is published by Elsevier North-Holland can be found in

http://www.stat.unipg.it/iasc/Misc-stat-journ-CSDA.html.

Submission electronically is encouraged. Please e-mail a postscript

file of your manuscript together with a plain text cover letter to

erricos.kontoghiorghes@info.unine.ch. Authors unable to submit

electronically may send four copies of their manuscript to:

Erricos John Kontoghiorghes (CSDA)

Institut d'informatique

Universite de Neuchatel

Emile-Argand 11

CH-2007 Neuchatel

Switzerland

E-mail: erricos.kontoghiorghes@info.unine.ch

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

From: Beth Schad <tschoban@siam.org>

Date: Tue, 20 Jan 98 10:49:41 -0500

**Subject: Contents, SIAM Journal on Numerical Analysis**

CONTENTS

SIAM Journal on Numerical Analysis

Volume 35, Number 1, FEBRUARY 1998

Numerical Solution of the Schrodinger Equation in a Wavelet Basis for

Hydrogen-like Atoms

Patrick Fischer and Mireille Defranceschi

Approximation of the Solution to a System Modeling Heatless Adsorption

of Gases

C. Bourdarias

Timestep Acceleration of Waveform Relaxation

B. Leimkuhler

A Quasi-Monte Carlo Scheme Using Nets for a Linear Boltzmann Equation

Christian Lecot and Ibrahim Coulibaly

Inversion Formulas for the Discretized Hilbert Transform on the Unit

Circle

Claus B. Schneider

On Product Integration with Gauss-Kronrod Nodes

Sven Ehrich

A Nonconforming Finite Element Method for the Stationary Navier-Stokes

Equations

Ohannes A. Karakashian and Wadi N. Jureidini

Multigrid Methods for the Pure Traction Problem of Linear Elasticity:

Mixed Formulation

Chang-Ock Lee

The Fully Discrete Legendre Spectral Approximation of Two-Dimensional

Unsteady Incompressible Fluid Flow in Stream Function Form

Guo Ben-Yu and He Li-Ping

The Immersed Interface Method for Nonlinear Differential Equations

with Discontinuous Coefficients and Singular Sources

Andreas Wiegmann and Kenneth P. Bube

On the Stability of the Abramov Transfer for Differential-Algebraic

Equations of Index 1

Thomas Petry

A Two-Level Preconditioner for Schrodinger-Type Singular Elliptic

Operator

Serguei Maliassov

A Fast Iterative Algorithm for Elliptic Interface Problems

Zhilin Li

Application of an Ultra Weak Variational Formulation of Elliptic PDEs

to the Two-Dimensional Helmholtz Problem

Olivier Cessenat and Bruno Despres

Inner and Outer Iterations for the Chebyshev Algorithm

Eldar Giladi, Gene H. Golub, and Joseph B. Keller

First-Order System Least Squares (FOSLS) for Planar Linear

Elasticity: Pure Traction Problem

Zhiqiang Cai, Thomas A. Manteuffel, Stephen F. McCormick, and Seymour

V. Parter

Finite Element Analysis of the Landau-de Gennes Minimization Problem

for Liquid Crystals

Timothy A. Davis and Eugene C. Gartland, Jr.

Uniformly Superconvergent Approximations for Linear Two-Point Boundary

Value Problems

Hongsung Jin and Steven Puress

Finite Element Analysis of Microstructure for the Cubic to Tetragonal

Transformation

Bo Li and Mitchell Luskin

Least-Squares Finite Element Approximations to Solutions of Interface

Problems

Yanzhao Cao and Max D. Gunzburger

The Petrov-Galerkin and Iterated Petrov-Galerkin Methods for

Second-Kind Integral Equations

Zhongying Chen and Yuesheng Xu

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

From: Ira Smiley <smiley@siam.org>

Date: Tue, 20 Jan 98 11:59:26 -0500

**Subject: Contents, SIAM Journal on Applied Mathematics**

CONTENTS

SIAM Journal on Applied Mathematics

Volume 58, Number 1, FEBRUARY 1998

On a Variational Principle for the Drag in Linear Hydrodynamics

B. I. M. ten Bosch and A. J. Weisenborn

Shock-Wave Solutions in Closed Form and the Oppenheimer--Snyder Limit

in General Reality

Joel Smoller and Blake Temple

Singularities in Hele--Shaw Flows

Qing Nie and Fei Ran Tian

Heat Conduction in Fine Scale Mixtures with Interfacial Contact Resistance

Robert Lipton

Numerical Approximation for Functionals of Reflecting Diffusion Processes

C. Costantini, B. Pacchiarotti, and F. Sartoretto

Bifurcation Analysis for Phase Transitions in Superconducting Rings

with Nonuniform Thickness

Jorge Berger and Jacob Rubinstein

A Method of Images for the Evaluation of Electrostatic Fields in

Systems of Closely Spaced Conducting Cylinders

Hongwei Cheng and Leslie Greengard

Population Dynamics of Synaptic Release Sites

Richard Bertram and Arthur Sherman

Global Stability in Chemostat-Type Competition Models with Nutrient Recycling

Shigui Ruan and Xue-Zhong He

Coexistence Region and Global Dynamics of a Harvested Predator-Prey System

Guoren Dai and Moxun Tang

On the Asymmetric May--Leonard Model of Three Competing Species

Chia-Wei Chi, Sze-Bi Hsu, and Lih-Ing Wu

Three-Dimensional Competitive Lotka--Volterra Systems with No Periodic Orbits

P. van den Driessche and M. L. Zeeman

Convergence Criteria for Attracting Cycles of Newton's Method

Stanley Ocken

Moment Lyapunov Exponent and Stability Index for Linear Conservative

System with Small Random Perturbation

R. Khasminskii and N. Moshchuk

Heavy Traffic Analysis of a Markov-Modulated Queue with Finite

Capacity and General Service Times

Charles Knessl and Charles Tier

Application of the Pad=E9 Method to Solving the Noisy Trigonometric

Moment Problem: Some Initial Results

Riccardo March and Piero Barone

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

From: Heinz Engl <engl@indmath.uni-linz.ac.at>

Date: Wed, 21 Jan 1998 17:56:46 MET

**Subject: Contents, Surveys on Mathematics for Industry**

Surveys on Mathematics for Industry (Springer Vienna/New York)

Vol. 7/3, Table of Contents

J.T. Ottesen, Mathematical models in physiology: the cardiovascular system and

its regulation, 167-168

G. Ohlen, B. Wohlfahrt and M.Christensson, Simulation of spiral waves in a

piece of myocardial tissue, 169-175

J.L. Palladino, J.P. Mulier, and A. Noordergraaf, Closed-loop circulation model

based on the Frank mechanism, 177-186

J.T. Ottesen, Nonlinearity of baroreceptor nerves, 187-201

M. Ursino and S.Cavalcanti, A mathematical model of the carotid-baroreflex

control in pulsatile conditions, 203-220

S. Cavalcanti and M. Ursino, Dynamical modelling of sympathetic and

parasympathetic interplay on the baroreceptor heart rate control, 221-237

F. Kappel, S. Lafer, and R.O. Peer, A model for the cardiovascular system under

an ergometric workload, 239-249

J.T. Ottesen and A. Noordergraaf, The virtue of creating mathematical models,

251-253

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

From: Ute McCrory <McCrory@Springer.de>

Date: Thu, 22 Jan 1998 17:16:41 +0100

**Subject: Contents, Computing and Visualization in Science**

Journal "Computing and Visualization in Science"

Table of Contents of volume 2 (due March 1998)

M. Dellnitz, O. Junge: "An adaptive subdivision technique

for the approximation of attractors and invariant measures"

U. Maas: "Efficient calculation of intrinsic low-dimensional

manifolds for the simplification of chemical kinetics"

V.H. Schulz: "Solving discretized optimization problems by

partially reduced SQP methods"

Chr. Wagner: "Numerical methods for diffusion-reaction-

transport processes in unsaturated porous media"

M.J. Noot, A.C. Telea, J.K.M. Jansen, R.M.M. Mattheij: "Real

time numerical simulation and visualization of electrochemical drilling"

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

End of NA Digest

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

-------