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

- Season's Greetings
- Greetings
- Who is The Author?
- Fortran 90 Exception Handling Package
- Numerical Inversion of Z-transform
- Conference on Information Sciences and Systems
- Release 1 of the PINEAPL Library
- PINEAPL Workshop
- Stockholm Optimization Days
- Workshop on Practical Aspects of Algebraic Multigrid Methods
- Position at Rutherford Appleton Laboratory
- Lectureship Position at University of Bristol
- Postdoctoral Position at Sandia National Laboratories
- Postdoctoral Positions and Scholarships at TU Graz
- Visiting Professor at the Technical University Hamburg-Harburg
- Visiting Positions at UNLV
- Positions at Beam Technologies
- Postdoctoral Positions at Argonne National Laboratory
- Contents, SIAM Journal on Control and Optimization
- Contents, Journal of Approximation Theory

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

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

From: Bratislav Iricanin <iricanin@galeb.etf.bg.ac.yu>

Date: Mon, 22 Dec 1997 01:32:56 +0100 (MET)

**Subject: Season's Greetings**

Season's Greetings

\+/

+-*-+ _______________________________________________

/+\

^ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

i^^^ 1997 !!!!!!!!!!!!!!!!!!!!!!!!!!!

^()^^i ! ((( . *. . * | . * . * )))

i^^^^o^^ ____________!______________ ((( . * . | * . .* )))

^^*^^^^^^i ! ((( . * * | . * . * )))

i^^^o^^^*^^^ ~~~~~~~~~~~~!~~~~~~~~~~~~~~ (((__________|_________ )))

^^^^^^^^0^^^^i ! ((( . * . * |. * . * )))

i^^^*^^^^o^^:)^^ ___________________ ((( . . * | . ////// )))

^^()^^^^^^^*^^^^^i |__|____|____|____| ((( * * . |* ( @ @ ) )))

i^^^^^o^^^^^()^^^^^^ |____|____|____|__| ((( * . * | . \ o / .)))

^^^^^^^^*^^^^^^o^^^^^i |__| / |__| (((=====================)))

i^^^^^o^^^^^^^^*^^^^^^^^ |__| \\\ |__|

^^^^*^^^^^()^^^^^^^^o^^^^i |__| ///// |__| ><

^^^^^o^^^^^^|^|^^^^0^^^*^^^^|__| \\\\\\ |__| ########### ><

>< \__|_|__/ >< |__| /////// |__| ########### |||||||||

::::::___ \_____/ __%%%%%%__|__|_XXXXXXXX__|__|_ \-/__###########__|||||||||_

:::::: \___/ %%%%%% \_______________/ ('.') ########### |||||||||

%%%%%% @(m " m)

<<<:<<<:<<<:<<<:<<<:<<<:<<<:<<<:<<<:<<<:<<<:<<<:<<<:<<<:<<<:<<<:<<<:<<<:<<<

/ /_ ____ _____ ____ __ __ / /_ ____ / (_)___/ /___ ___ _______

/ __ \/ __ `/ __ \/ __ \/ / / / / __ \/ __ \/ / / __ / __ `/ / / / ___/

/ / / / /_/ / /_/ / /_/ / /_/ / / / / / /_/ / / / /_/ / /_/ / /_/ (__ )

/_/ /_/\__,_/ .___/ .___/\__, / /_/ /_/\____/_/_/\__,_/\__,_/\__, /____/

/_/ /_/ /____/ /____/

XpucToc ce poqu!!! BauctuHy ce poqu!

Feliz Navidad Frohlich Weihnachten Happy Hanukkah Joyeux Noel Peace

Bratislav Iricanin <iricanin@galeb.etf.bg.ac.yu>

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

From: Frank Stenger <stenger@sinc.cs.utah.edu>

Date: Fri, 19 Dec 1997 10:42:50 -0700

**Subject: Greetings**

The following MATLAB program is originally due to Juerg Waldvogel, and

then modified, to add decorations, by Andre Weideman. Processing it

expresses the spirit of the season.

-- Frank Stenger

rho = pi*(1+sqrt(5))/2;

n = 70000;

x = 0:n;

z = cumsum(exp(i*(rho*x.*x+.4)));

[m,k] = max(imag(z));

plot(z,'g')

axis image

hold on

plot(z(1:n/100:n),'ro','MarkerSize',4,'LineWidth',2)

plot(z(k),'y*','MarkerSize',10,'LineWidth',2)

axis off

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

From: Frank Stenger <stenger@sinc.cs.utah.edu>

Date: Fri, 19 Dec 1997 11:48:05 -0700

**Subject: Who is The Author?**

Does anyone know the author of the following incredible "C" program,

which, after processing, relates a message appropriate to this season?

--Frank Stenger

#include <stdio.h>

main(t,_,a)

char *a;

{

return!0<t?t<3?main(-79,-13,a+main(-87,1-_,main(-86,0,a+1)+a)):

1,t<_?main(t+1,_,a):3,main(-94,-27+t,a)&&t==2?_<13?

main(2,_+1,"%s %d %d\n"):9:16:t<0?t<-72?main(_,t,

"@n'+,#'/*{}w+/w#cdnr/+,{}r/*de}+,/*{*+,/w{%+,/w#q#n+,/#{l+,/n{n+,/+#n+,/#\

;#q#n+,/+k#;*+,/'r :'d*'3,}{w+K w'K:'+}e#';dq#'l \

q#'+d'K#!/+k#;q#'r}eKK#}w'r}eKK{nl]'/#;#q#n'){)#}w'){){nl]'/+#n';d}rw' i;# \

){nl]!/n{n#'; r{#w'r nc{nl]'/#{l,+'K {rw' iK{;[{nl]'/w#q#n'wk nw' \

iwk{KK{nl]!/w{%'l##w#' i; :{nl]'/*{q#'ld;r'}{nlwb!/*de}'c \

;;{nl'-{}rw]'/+,}##'*}#nc,',#nw]'/+kd'+e}+;#'rdq#w! nr'/ ') }+}{rl#'{n' ')# \

}'+}##(!!/")

:t<-50?_==*a?putchar(31[a]):main(-65,_,a+1):main((*a=='/')+t,_,a+1)

:0<t?main(2,2,"%s"):*a=='/'||main(0,main(-61,*a,

"!ek;dc i@bK'(q)-[w]*%n+r3#l,{}:\nuwloca-O;m .vpbks,fxntdCeghiry"),a+1);

}

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

From: Richard Hanson <hanson.kool@worldnet.att.net>

Date: Wed, 17 Dec 1997 17:48:28 -0800

**Subject: Fortran 90 Exception Handling Package**

Dear Friends,

I am leading a volunteer effort to develop an IEEE floating point

exception handling module for Fortran. A proposal for an ''intrinsic

module supporting IEEE exceptions" has been accepted by WG5 for the

year 2000 revisions. My goal is to have an ordinary subset module

available for use before the year 2000 for a wide range of compilers.

The effort for a willing volunteer will be to take the SUN-Solaris

version and convert it so that it passes tests using their particular

compiler. The fruits of this work will be made available to everyone.

All current files are in URL ftp://148.55.1.2/pub/hanson/EXCEPTIONS.

Anyone participating should first read the Postscript file excep.ps.

Those who have a later version of Microsoft Word can read the

equivalent file excep.doc. The directory contains Fortran 90 source

files referenced in the text of the paper. This includes a testing

program, extesting.f90. As new versions are developed they will be

put into this directory.

I will choreograph the project so that volunteers need not duplicate work.

An effort will be made to match up respondents and compilers. Your efforts

shall, to the best of my ability, be acknowledged in a summary at the

completion of the project.

Yours Sincerely,

R. J. Hanson

Visual Numerics, Inc. (IMSL)

E-mail: RHanson@houston.vni.com

Web resume: http://hpc.uh.edu/~haskell/rjh/rjhres.html

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

From: Matthias Ehrhardt <ehrhardt@math.tu-berlin.de>

Date: Mon, 22 Dec 1997 17:12:11 +0100 (MET)

**Subject: Numerical Inversion of Z-transform**

Dear NA-Readers,

I am interested in the numerical inversion of the Z-transform.

The Z-transform of a sequence f_n, n >= 0, is defined as

the Laurent series

\hat{f}(z) = \sum f_n z^{-n}, n = 0,...,infinity.

The inverse Z--transform is given by the Cauchy integral formula

f_n = 1/{2\pi} \int_\calC \hat{f}(z) z^{n-1} dz,

where \calC is a closed path around the origin.

It arises for instance as the solution to certain difference equations.

I only found a partial fraction method which only works in the case

where f(z) is a ratio of two polynomials

(here, the inverse transformation is quite trivial).

Any pointers to software or algorithms or hints would be appreciated.

Thank you very much in advance,

Matthias Ehrhardt <ehrhardt@math.tu-berlin.de>

Technische Universitaet Berlin

Fachbereich Mathematik

Sekr. MA 6-2

Strasse des 17. Juni 136

D-10623 Berlin

Germany

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

From: Bradley Dickinson <bradley@EE.Princeton.EDU>

Date: Mon, 15 Dec 1997 22:05:54 -0500

**Subject: Conference on Information Sciences and Systems**

CFP CISS '98 - 32nd Annual Conference on Information Sciences and Systems

Call For Papers

CISS '98 will be held on March 18-20, 1998, sponsored by the

Department of Electrical Engineering, Princeton University, Princeton NJ

Authors are invited to submit previously unpublished papers describing

new advances, applications, and ideas in the fields of communications;

systems and control; signal, image, and video processing; pattern recognition

and statistical inference.

Two kinds of contributed papers are solicited. (1) Regular papers requiring

approximately thirty minutes for presentation; these will be reproduced in

full (up to six pages) in the conference proceedings. (2) Short papers

suitable for presentation in 15 minutes or less; one page summaries of these

papers will be published in the proceedings.

Five copies of a summary together with a regular or short designation are to

be submitted by January 15, 1998. Summaries should be of sufficient detail

and length to permit careful reviewing. Authors will be notified of

acceptance by February 16, 1998. Instructions for the preparation of

accepted papers for the proceedings will be sent to each author. All

manuscripts are to be submitted to:

1998 CISS

Department of Electrical Engineering

Princeton University

Princeton, NJ 08544-5263

Conference Office:

1998 CISS

Department of Electrical Engineering

Princeton University

Princeton, NJ 08544-5263

email: ciss98@ee.princeton.edu

URL: http://www.ee.princeton.edu/confs/CISS/

Program Director:

Bradley Dickinson

Important Dates:

Submission deadline: January 15, 1998

Notification of acceptance: February 16, 1998

Advance Registration: Before March 13, 1998

Conference Dates: March 18-20, 1998

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

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

Date: Wed, 17 Dec 1997 14:24:57 +0100 (BST)

**Subject: Release 1 of the PINEAPL Library**

NAG Launches Release 1 of the PINEAPL Library

The Numerical Algorithms Group Ltd (NAG) is pleased to announce the

availability of Release 1 of the PINEAPL Library. This library has been

developed in the HPCN Fourth Framework project on Parallel Industrial

NumErical Applications and Portable Libraries (PINEAPL), in which NAG is

currently coordinating. This Library is the result of a coordinated

effort by the Center for Research on Parallel Computing and Supercomputers

National Research Council (Naples, Italy), NAG Ltd (Oxford, UK)

and the Centre for Novel Computing of the University of

Manchester (Manchester, UK).

The coverage of the PINEAPL Library is to a large

extent driven by the demands of the end-user applications

with the project and focuses on three major numerical areas:

Sparse Linear Algebra:

o Iterative solvers for symmetric and unsymmetric linear systems of equations,

o Domain decomposition and SSOR preconditioners, and additional support

subprograms for instance, a matrix-vector multiplication, etc.

All sparse linear algebra routines can be used with either regular or

irregular data distributions, thereby supporting both problems with regular

and unstructured grids. Additional graph partitioning software enables

users to generate data distributions which are tailored to the structure

of the particular problem at hand.

FFTs:

Discrete Fourier transforms of one-, two- or three-dimensional

sequence of complex data values (and their inverse).

Optimization:

o Constraint non-linear optimization routines, base on

- either an easy-to-use quasi-Newton method or,

- a sequential quadratic programming algorithm.

The independent variables are constrained by simple upper and lower

bounds in the quasi-Newton method, whereas a mixture of linear and

nonlinear equality or inequality constraints can be imposed in the

sequential quadratic programming algorithm.

Support/Utility Facilities:

These utility routines shield users to a large extent from having

to deal explicitly with the message-passing system. Routines are provided

for process Management (under MPI or PVM), Input/Output

(for distributed data), data distribution (dense and sparse matrices) and

basic sparse matrix operations (eg matrix-vector multiplication, transposed

matrix multiplication, etc.)

For more information, see the project web-page: http://www.nag.co.uk/projects/PINEAPL.html

Please contact Mishi Derakhshan for details of how to obtain a copy of

the library. The use of the library is initially free for a trial period,

but is subject to a signed collaboration agreement.

Mishi Derakhshan

NAG Ltd, Wilkinson House, Jordan Hill Rd, OXFORD, OX2 8DR, UK

E-mail: mishi@nag.co.uk, OR na.mderakhshan@na-net.ornl.gov

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

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

Date: Wed, 17 Dec 1997 13:59:35 +0100 (BST)

**Subject: PINEAPL Workshop**

Second Announcement

PINEAPL Workshop:

A Workshop on the Use of Parallel Numerical Libraries

in Industrial End-user Applications

February 9 - 10, 1998

Toulouse, France

The Parallel Industrial NumErical Applications and Portable

Libraries (PINEAPL) Project is a European Framework IV HPCN Project

funded by the European Commission. It is a coordinated effort

to produce a general purpose library of parallel numerical software

suitable for a wide range of computationally intensive industrial

applications and to port several application codes which use this

library to parallel computers. For more information, see the project web-page:

http://www.nag.co.uk/projects/PINEAPL.html

One of the aims of this workshop is to provide a forum to discuss

progress on enhancing the number of applications that can take

advantage from the PINEAPL Project results.

Provisional Programme:

Day 1: - Tutorial session on the use of the NAG Parallel Library

- Discussion on the use of PRECISE in the PINEAPL Project

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

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

o Industry and research institutes who would like to discuss and

seek advice on the parallelization of the numerical methods used

in their application code

o hardware vendors who would like to discuss the feasibility

of porting the PINEAPL Library on to their parallel systems

Day 2:

- 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

- Prof F. Chaitin-Chatelin (CERFACS, France): The PRECISE Tool-box

- Dr Clemens-August Thole (GMD, GERMANY): Port of Industrial Applications

Parallel Architectures during EUROPORT-1: Overview with Special

Emphasis on Numerical Kernels

- Prof Sven Hammarling (NAG, UK): ScaLAPACK: High Performance Software

for Dense Linear Algebra

- Dr Arnold Krommer (NAG, UK): Parallel Sparse Linear Algebra

Computations Using the PINEAPL Library

- (Tentative): Optimisation Needs and Results in the FRONTIER Project

- End-users presentations:

o British Aerospace (UK)

o Thomson LCR (FRANCE)

o Math-Tech/DHI (Denmark)

o Piaggio (Italy)

Organizing Committee:

Dr Mishi Derakhshan (mishi@nag.co.uk), NAG Ltd, UK

Dr Alan McCoy(mccoy@cerfacs.fr), CERFACS, France

Dr Vincent Toumazou(toumazou@cerfacs.fr), CERFACS, France

Dr Len Freeman(freeman@ma.man.ac.uk), University of Manchester, UK

Mr Graham Riley(griley@cs.man.ac.uk), University of Manchester, UK

Dr Lucia Maddalena(lucia@matna2.dma.unina.it), CPS-CNR, Italy

The workshop will be hosted by CERFACS. All inquiries should be sent to:

Mishi Derakhshan Alan Mccoy or Vincent Toumazou

NAG Ltd, CERFACS,

Wilkinson House, Jordan Hill Road, 42 av. G. Coriolis, 31057 Toulouse Cedex

Oxford, OX2 8DR FRANCE Fax: +33 (0) 5 61 19 30 0

UK. Fax: +44 (0)1865 310 139

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

From: Anders Forsgren <andersf@math.kth.se>

Date: Wed, 17 Dec 1997 16:17:26 +0100

**Subject: Stockholm Optimization Days**

CALL FOR PAPERS

8TH STOCKHOLM OPTIMIZATION DAYS

We welcome theoretical, computational and applied papers for the 8th

Stockholm Optimization Days, a two-day conference on optimization, to

be held at KTH (Royal Institute of Technology) in Stockholm, Sweden,

June 25-26, 1998.

There will be sessions on various aspects of optimization, including

nonsmooth optimization, linear and nonlinear programming.

Invited and contributed presentations of tentatively 30 minutes each

will be given at the conference. Invited speakers include:

Francisco Barahona, IBM T. J. Watson Research Center

John T. Betts, Boeing Inf. & Sup. Services

Roger Fletcher, University of Dundee

Philip E. Gill, University of California, San Diego

Donald W. Hearn, University of Florida

Krzysztof C. Kiwiel, Systems Research Institute

Walter Murray, Stanford University

Michael L. Overton, New York University

Francisco J. Prieto, Universidad Carlos III de Madrid

Motakuri V. Ramana, University of Florida

Michael A. Saunders, Stanford University

Tamas Terlaky, Delft University of Technology

Michael J. Todd, Cornell University

Lieven Vandenberghe, University of California, Los Angeles

Stein W. Wallace, Norwegian University of Science and Technology

David P. Williamson, IBM T. J. Watson Research Center

Jochem Zowe, Universit=E4t Erlangen-N=FCrnberg

In addition to the invited presentations, we also welcome a limited

number of contributed presentations. Abstracts (maximum 200 words)

should be sent by May 1 (preferably by e-mail) to

optdays@math.kth.se

or by mail to

Optimization Days

Division of Optimization and Systems Theory

KTH

SE-100 44 Stockholm

Sweden

Fax: +46 8 22 53 20.

Further information can be obtained via www, address

http://www.optsyst.math.kth.se/~optdays/.

The conference is financially supported by the G=F6ran Gustafsson

Foundation. The organizing committee consists of Ulf Br=E4nnlund, Stefan

Feltenmark, Anders Forsgren (head), Andreas N=F5u and Krister Svanberg,

from the Division of Optimization and Systems Theory, Department of

Mathematics, Royal Institute of Technology (KTH).

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

From: Christian Wagner <chris@kalmit.ica3.uni-stuttgart.de>

Date: Thu, 18 Dec 1997 18:56:06 +0100

**Subject: Workshop on Practical Aspects of Algebraic Multigrid Methods**

Announcement of the GAMM - Seminar

"Workshop on Practical Aspects of Algebraic Multigrid Methods"

March 25 - 27, 1998,

Institut fuer Computeranwendungen III

Universitaet Stuttgart

Pfaffenwaldring 27

D - 70569 Stuttgart

Germany

in cooperation with the GAMM-Fachausschuss "Scientific Computing"

and the Sonderforschungsbereich 404.

Organizing Committee: Peter Bastian, Nicolas Neuss, Christian Wagner,

Christian Wieners, Gabriel Wittum

The purpose of this workshop is to exchange new ideas and results on

algebraic multigrid methods for a wide range of applications. Parallel

and serial methods for challenging problems (e.g. complex domains,

systems of differential equations, jumping coefficients, ...) are

discussed and compared.

In particular, the following topics are covered:

o (Parallel) strategies for the selection of coarse grid points.

o Construction of coarse grid and interpolation matrices.

o Discussion of interfaces for algebraic multigrid solvers.

o Comparison of the results for given test problems.

Invited speakers:

D. Braess (Bochum)

J. Fuhrmann (Berlin)

M. Griebel (Bonn)

F. Kickinger (Linz)

M. Neytcheva (Nijmegen)

A. Reusken (Aachen)

S. Sauter (Kiel)

K. Stueben (St. Augustin)

P. Vanek (Denver)

A collection of test matrices including matrices arising from porous

media, Navier-Stokes, elasto-plastic and convection-diffusion problems

is in preparation and will be provided through the www page

http://www.ica3.uni-stuttgart.de/events.html in the beginning of 1998.

The participants are invited to submit contributions to this collection.

Submitted presentations, computer demonstrations and everybody

interested in the topic are welcome. The participants are encouraged

to submit a summary of their methods including a description of the

algorithm before February 15, 1998. Please, use

http://www.ica3.uni-stuttgart.de/events.html

for registrations and the submission of presentations. These

abstracts will be printed as a "collection of algorithms" in order

to stimulate the discussion. Selected papers will be published as

ICA-Report.

The seminar fee DM 100,-, payable by March 1st, 1998, includes

lunches, coffee breaks, reception at the first evening, and the

"collection of algorithms". Payments are to be made by bank transfer

to: Universit"at Stuttgart, Baden-W"urtt.-Bank Stuttgart, bank code

600 200 30 account no. 105 4611 700, specify your name, "AMG 98" and

"Titel 11186, BA 4717".

For further information, please send an email to

amg98@ica3.uni-stuttgart.de.

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

From: Iain Duff <I.Duff@letterbox.rl.ac.uk>

Date: Sat, 20 Dec 1997 17:00:17 GMT

**Subject: Position at Rutherford Appleton Laboratory**

Numerical Analysis Post at Rutherford Appleton Laboratory

We have just been given permission by RAL management to recruit someone to

our Numerical Analysis Group, starting on April 1st. The salary range is

from 15,180 to 31,400 pounds depending on experience. The full advert

will appear early in January (the closing date will be January 30th).

Current Group members are Nick Gould, Petr Plechac, John Reid, Jennifer Scott

and myself.

Iain Duff

isd@rl.ac.uk

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

From: A. R. Champneys <A.R.Champneys@bristol.ac.uk>

Date: Tue, 16 Dec 1997 15:28:59 +0000 (GMT)

**Subject: Lectureship Position at University of Bristol**

Lectureship position at University of Bristol

Department of Engineering Mathematics

University of Bristol

Lectureship in Applied Nonlinear Mathematics

You will be joining a group which applies nonlinear mathematical research of

the highest quality to areas of engineering, science and medicine. You will

be committed to teaching and wish to build a strong independent research

profile. The group belongs to the Applied Mathematics Unit of Assessment

which gained a grade 5 in the 1996 RAE.

The appointment will be made on the Lecturer Grade A scale (starting salary

16,045 -19,371 UK pounds). Recent PhDs are encouraged to apply, although

more experienced candidates will also be considered.

Informal enquiries are most welcome and may be made to Professor SJ Hogan

(email: s.j.hogan@bris.ac.uk) DO NOT SEND APPLICATIONS DIRECTLY TO HIM

or by browsing the web page

http://www.fen.bris.ac.uk/engmaths/research/nonlinear/nonlinear.html

For further details and how to apply email recruitment@bris.ac.uk

quoting reference 4454 and stating your postal address

Or telephone (+44 outside UK) (0 UK) 117 925 6450, minicom 117 928 8894

Closing date for applications is 23rd January 1998.

Starting date is 1st April 1998 (or later by agreement).

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

From: William Hart <wehart@kiva.cs.sandia.gov>

Date: Tue, 16 Dec 1997 13:05:38 -0700 (MST)

**Subject: Postdoctoral Position at Sandia National Laboratories**

Post-Doctoral Position

Distributed Computing and Applied Mathematics Departments

Sandia National Laboratories

The Distributed Computing and Applied Mathematics Departments

at Sandia National Laboratories are seeking qualified candidates

for a Post-Doctoral position to contribute to the development of

global optimization methods for engineering science applications.

Candidates must be U.S. citizens, have earned a Ph.D. or equivalent,

and have experience with the design and implementation of global

optimization methods for continuous problems. Experience with

algorithm development on distributed memory computers is particularly

desirable. Candidates should be familiar with numerical techniques in

nonlinear optimization. Strong communication skills will also be

needed to interact with application developers who will use the

resulting libraries. A working knowledge of C or C++ programming and

experience with software-library development is required.

The Distributed Computing and Applied Mathematics Departments maintain

research programs in a variety of areas of applied and numerical

mathematics, including combinatorial and global optimization, linear

and eigen systems and complex systems. Strong collaborations exist

with other departments at the Laboratories, supporting research in

mathematics and algorithms, computational science and engineering, and

advanced systems software and tools. A unique parallel computing

environment is available, including a 4500-node Intel TFlops computer,

a 1800-processor Intel Paragon, a 192-processor SGI Origin system, an

84-processor DEC-8400 system, and experimental heterogeneous computer

platforms.

The post-doc appointment is for a period of one year and may be

renewed for a second year. It includes a competitive salary,

reimbursement of moving expenses, and a professional travel allowance.

Applicants should send a resume and three letters of recommendation to

either

Dr. William Hart

Applied Mathematics Department, MS 1110

Sandia National Laboratories,

P.O. Box 5800

Albuquerque, NM 87185-1110

or

Dr. Todd Plantenga

Distributed Computing Department, MS 9214

Sandia National Laboratories,

7011 East Avenue

Livermore, CA 94551-0969

The submission date for applications is February 31, 1997,

however applications will be considered until the position is

filled. The position will commence in Spring or Summer of 1997.

For further information, contact

Dr. William Hart Dr. Todd Plantenga

(505) 844-2217 (510) 294-2511

wehart@cs.sandia.gov tdplant@ca.sandia.gov

Equal Opportunity Employer M/F/V/H. U.S. Citizenship is Required.

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

From: Bettina Klinz <klinz@opt.math.tu-graz.ac.at>

Date: Wed, 17 Dec 1997 08:39:29 +0100

**Subject: Postdoctoral Positions and Scholarships at TU Graz**

Post-Doctoral Position and Ph.D. Scholarship

in Combinatorial Optimization and Operations Research

Institute of Mathematics

TU Graz, Austria

We invite applications for the position of a research assistant (Post-Doc)

and for a Ph.D scholarship, respectively. Both positions are within

the research centre SFB F003 "Optimization and Control".

This centre is funded by the Austrian Science Foundation (FWF).

Requirements:

(A) For Ph.D. scholarship:

* Master degree or its equivalent in Mathematics, Operations Research or

Theoretical Computer Science.

* Knowledge of German is required (for getting the admission to study

at the TU Graz).

(B) For Post-Doc position:

* Ph.D. in Operations Research, Discrete or Combinatorial Optimization,

or a related field, good knowledge of and research experience in

Combinatorial and Discrete Optimization.

* Experience in at least one higher programming language (pref. C or C++).

* Knowledge of German is not explicitly required; a good command of

English is sufficient.

Description of tasks:

(A) For Ph.D. scholarship:

Research in Combinatorial and/or Discrete Optimization, or

Operations Research, leading to a Ph.D. at the TU Graz.

(B) For Post-Doc position:

The candidate is expected to contribute substantially to the projects

1) "Efficiently solvable special cases of NP-hard combinatorial

optimization problems"

and/or

2) "Combinatorial Optimization in Complex Systems",

ideally to both.

The research assistant is supposed to work on aspects of these

projects as described below.

Project 1

Our research group has a long-standing interest in efficiently solvable

special cases of NP-hard combinatorial optimization problems.

We have identified many efficiently solvable cases of NP-hard

problems such as the traveling salesman problem, the quadratic assignment

problem, the Steiner tree problem, and many others.

Currently our research work within this project basically focuses on

the following topics:

* identification of new polynomially solvable cases of NP-hard problems

or polynomially approximable special cases of problems which are even

NP-hard to approximate,

* analysis and characterization of structural properties of problem data

which make difficult problems easy to solve,

* recognition of polynomially solvable and approximable special cases.

Project 2

The subject of research are complex combinatorial optimization problems

which arise in traditional application fields of operations research like

production planning, flexible manufacturing, distribution, and public

transportation systems, and in fields that have only recently been

identified to contain many interesting combinatorial optimization

problems, like medicine and biology.

We are interested in theoretical and practical aspects of these

complex combinatorial optimization problems, also called complex systems.

Currently, the basic topics of interest for our research within this

project are the following:

* analysis of the asymptotic behavior of combinatorial optimization

problems,

* analysis of the performance of heuristic approaches,

* development of new methodologies for analyzing and solving

complex systems with special emphasis on the similarities and

differences between various complex systems,

* analysis and solution of real-world complex systems from application

areas like medicine and chemical industry.

Salary

======

(A) For Ph.D. scholarship:

13000 ATS (1020 USD) monthly. After deduction of taxes and social and

health insurance costs approximately 10000 ATS will remain.

(B) For Post-Doc position:

The net salary is approximately 18500 ATS (1450 USD), 14 times per

year (this corresponds to a gross salary of approximately

385000 ATS resp. 30200 USD p.a.). The health and social

insurance costs for the employee AND his accompanying family members

(if any) are covered.

Duration:

=========

(A) For Ph.D. scholarship:

Two years. 6 months extension possible.

(B) For Post-Doc position:

One year. Extension until July 2000 possible upon mutual agreement.

Starting date: As soon as possible, starting from February 1, 1998.

=============

Application deadline: January 31, 1998.

=====================

Application process:

Applications should be addressed to

Prof. Rainer E. Burkard

TU Graz

Institut fuer Mathematik B

Steyrergasse 30

A-8010 Graz

Austria

(A) For Ph.D. scholarship:

Applicants should send their CV, a statement of their research interests,

an extended abstract of their Master Thesis (not longer than two pages),

a list of Optimization and Operations Research related courses taken,

and arrange that one letter of recommendation is sent to the address above.

(B) For Post-Doc position:

Applicants should send their CV and list of publications, an extended

abstract of their Ph.D. Thesis (not longer than three pages), and arrange

that two letters of recommendation are sent to the address above.

Further information:

For further information feel free to contact

Bettina Klinz

e-mail: klinz@opt.math.tu-graz.ac.at

phone: ++43 316 873 5356

fax: ++43 316 873 5369

Information about the TU Graz can be found at the following

URL: http://www.tu-graz.ac.at/

The technical reports of the Combinatorial Optimization group at the

TU Graz from recent years can be accessed via the WWW at

http://www.opt.math.tu-graz.ac.at/cgi-bin/replist

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

From: Heinrich Voss <voss@tu-harburg.de>

Date: Wed, 17 Dec 1997 11:21:56 +0100

**Subject: Visiting Professor at the Technical University Hamburg-Harburg**

Visiting Professor at the Technical University Hamburg-Harburg

The German Academic Exchange Service (DAAD) is funding a Visiting

Professorship in Applied Mathematics for the project

International Bachelor Programme in General Engineering Science

at the Technical University Hamburg-Harburg in English language for three

years. Applications by native speakers are invited for the academic

year 1998/99 starting in October 1998.

Preference is given to candidates with a strong background in systems

and control, nonlinear optimization, or modelling in engineering sciences.

However, candidates who have demonstrated exceptional abilities in other

areas of research in applied mathematics and have a personal commitment

to excellence in teaching are also encouraged to apply.

The visitor will join the section of mathematics which maintains research

programmes in scientific computing with applications in structural dynamics

and chemical engineering. She or he will have to teach both, a course in

linear algebra or calculus in the international bachelor's programme, and

a graduate course.

Applications containing a statement of interest, curriculum vitae, and names,

addresses and e-mail addresses of referees should be submitted to the

President of the Technical University Hamburg-Harburg

Prof. Dr. Hauke Trinks

D-21071 Hamburg

Germany

Applications must be received by January 31, 1998. Questions about the

position may be directed to Prof. Heinrich Voss by telephone

(+49 40 7718 3279), electronic mail (voss@tu-harburg.de) or by FAX

(+49 40 7718 2696).

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

From: George Miel <miel@big-joe.CS.UNLV.EDU>

Date: Thu, 18 Dec 1997 05:13:13 -0800

**Subject: Visiting Positions at UNLV**

Visiting Positions at UNLV

Due to a last-minute leave of absence of a regular faculty member,

the Department of Mathematical Sciences at the University of Nevada

in Las Vegas has funding for two one-semester visiting positions

starting January 20, 1998.

1. Visiting Assistant Professor in computational/applied math

2. Visiting Assistant Professor in computational/applied stat

These positions are aimed toward recent PhDs interested in starting

an academic career. Duties include teaching 3 courses and interacting

with faculty. Interested individuals should email to

miel@ccmail.nevada.edu

a vita and the phone numbers and email addresses of two references.

George Miel, Chair and Professor, Department of Mathematical Sciences,

University of Nevada, Las Vegas, NV 89154-4020

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

From: Andrew Goldenson <andy@beamtech.com>

Date: Thu, 18 Dec 1997 10:16:15 -0500

**Subject: Positions at Beam Technologies**

Beam Technologies Job Openings

Beam Technologies develops engineering design and optimization software,

with emphasis on simulation and optimization of PDEs and complex

geometries. Over the past four years we have pioneered algorithms and

software in areas such as fluid-structure interaction, plastic deformation

optimization, and PDE based distributed parameter control. We are a small,

dynamic company, with many exciting opportunities and room for employee

growth. We are currently seeking software engineers with combinations of

the following skills and experiences, for several openings described below:

Languages: C++ mandatory; C, Java, Python, CORBA, Make, Fortran helpful.

Operating systems: Unix (Solaris, Irix, HP-UX, AIX, Linux), Windows95 and NT.

Application areas: numerical analysis (FEM, CFD, spectral, linear algebra),

CAD and geometry, symbolic analysis, GUI development, interpreters,

parallel algorithms, WWW.

Mathematics: numerical analysis of PDEs, computational geometry, optimization.

Additionally, we highly value written and oral communication skills, the

ability to work within a team on a complex project, broad vision, and

willingness to assume responsibility.

Positions currently open:

PDESolve Developer

Responsibilities: Develop innovative numerical and symbolic code for a

variety of engineering applications including: FEA, plasticity,

optimization, CFD, PDE control, and others. Code developed is in C++.

Experience: At least three years of hands on development of scientific and

engineering codes in C++. Good understanding and practices of object

oriented design and development.

Beam Technologies, Inc.

Human Resources

110 North Cayuga St.

Ithaca, NY 14850.

-or-

gb@beamtech.com

Thanks!

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

From: Stephen Wright <wright@mcs.anl.gov>

Date: Thu, 18 Dec 1997 09:50:29 -0600

**Subject: Postdoctoral Positions at Argonne National Laboratory**

Postdoctoral Research Positions in Optimization

at Argonne National Laboratory

We invite applications for postdoctoral research positions in the

metaNEOS project. This project, which involves resarchers at Argonne

National Laboratory, the University of Chicago, Columbia University,

Northwestern University, and the University of Wisconsin, will explore

the use of metacomputing platforms in solving large optimization

problems. The successful candidates will work in fundamental algorithm

analysis and development and/or construction of optimization software

tools, including tools targeted to the metacomputing

environment. Further information on the metaNEOS project can be

obtained from the project web site at http://www.mcs.anl.gov/metaneos/

Candidates should have a Ph.D. in optimization, numerical analysis,

applied mathematics, or computer science. A strong background in

computational optimization is required, and familiarity with software

tool development for scientific computing is highly desirable.

Experience with parallel computation and a broad background in

computer science is also a plus. Good communication skills and a

willingness to work in a collaborative environment are essential.

The successful candidates will be appointed at Northwestern

University, but will spend the majority of their time at Argonne. The

Mathematics and Computer Science Division at Argonne has an

outstanding computational environment that includes the facilities of

the newly established Center for Computational Science and Technology.

At the core of the center are scalable parallel computers, a

distributed supercomputing laboratory, and a virtual environments

laboratory.

Argonne is located in the southwestern Chicago suburbs, offering the

advantages of affordable housing, good schools, and easy access to the

cultural attractions of the city.

Resumes should be addressed to Jan Griffin, Mathematics and Computer

Science Division, Argonne National Laboratory, 9700 S. Cass Avenue,

Argonne, IL 60439, and must include a resume and the names and

addresses of three references. For electronic submission of

applications, please email to griffin@mcs.anl.gov. The positions are

available immediately; applications will be accepted until the

position is filled. For further inquiries, contact Jorge More'

(more@mcs.anl.gov) or Steve Wright (wright@mcs.anl.gov).

Northwestern University is an Affirmative Action/Equal Opportunity

Employer. Hiring is contingent upon eligibility to work in the United

States.

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

From: Ira Smiley <smiley@siam.org>

Date: Thu, 18 Dec 97 13:48:10 -0500

**Subject: Contents, SIAM Journal on Control and Optimization**

CONTENTS

SIAM Journal on Control and Optimization

Volume 36, Number 1, JANUARY 1998

Estimates of Convergence of Fully Discrete Schemes for the Isaacs

Equation of Pursuit-Evasion Differential Games via Maximum Principle

Pierpaolo Soravia

A Generic Classification of Time-Optimal Planar Stabilizing Feedbacks

A. Bressan and B. Piccoli

Model Reference Adaptive Control of Distributed Parameter Systems

Michael B=F6hm, M. A. Demetriou, Simeon Reich, and I. G. Rosen

An Approximation Theory of Solutions to Operator Riccati Equations for Control

Kazufumi Ito and K. A. Morris

Convergence Rate of Stochastic Approximation Algorithms in the

Degenerate Case

Han-Fu Chen

The Value Function of the Singular Quadratic Regulator Problem with

Distributed Control Action

Francesca Bucci and Luciano Pandolfi

Minimal (Max, +) Realization of Convex Sequences

Stephane Gaubert, Peter Butkovic, and Raymond Cuninghame-Green

Stabilization of Elastic Plates with Dynamical Boundary Control

Bopeng Rao

Configuration Flatness of Lagrangian Systems Underactuated by One Control

Muruhan Rathinam and Richard M. Murray

Partial Disturbance Rejection with Internal Stability and H=A5 Norm Bound

Vasfi Eldem, Hitay =D6zbay, Hasan Selbuz, and Kadri =D6z=E7aldiran

Bifurcation and Normal Form of Nonlinear Control Systems, Part I

Wei Kang

Bifurcation and Normal Form of Nonlinear Control Systems, Part II

Wei Kang

Optimal Residence Time Control of Hamiltonian Systems Perturbed by White Noise

James P. Dunyak and Mark I. Freidlin

Output Dead Beat Control for a Class of Planar Polynomial Systems

D. Nesic, I. M. Y. Mareels, G. Bastin, and R. Mahony=0A

Optimal Control of Problems Governed by Abstract Elliptic Variational

Inequalities with State Constraints

Ma=EFtine Bergounioux

On the Attainable Set for Scalar Nonlinear Conservation Laws with

Boundary Control

Fabio Ancona and Andrea Marson

Infinite Linear Programming and Multichain Markov Control Processes in

Uncountable Spaces

On=E9simo Hern=E1ndez-Lerma and Juan Gonz=E1lez-Hern=E1ndez

Spectral Approach to Duality in Nonconvex Global Optimization

Alexey S. Matveev

Generic Pole Assignment via Dynamic Feedback

Susumu Ariki

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

From: Edit Kurali <kurali@math.ohio-state.edu>

Date: Sun, 21 Dec 1997 22:09:22 -0500 (EST)

**Subject: Contents, Journal of Approximation Theory**

Table of Contents: J. Approx. Theory, Volume 91, Number 3, December 1997

Michael J. Johnson

On the approximation power of principal shift-invariant subspaces of

$L_p(\BR^d)$

279--319

R. Schaback and Zongmin Wu

Construction techniques for highly accurate quasi-interpolation

operators

320--331

Li Chong and G. A. Watson

On best simultaneous approximation

332--348

Evsey Dyn$'$kin

Inequalities for rational functions

349--367

T. N. T. Goodman

Characterising pairs of refinable splines

368--385

Wataru Takahashi and Takayuki Tamura

Limit theorems of operators by convex combinations of

nonexpansive retractions in Banach spaces

386--397

Oleg Davydov

On almost interpolation

398--418

Author index for Volume 91

419

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

End of NA Digest

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

-------