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

- Householder Awards
- Object-Oriented Numerics Web Page
- Software for Large Bound-constrained Optimization Problems
- New Book, Handbook of Test Problems in Optimization
- New Book, Computer Algebra in Scientific Computing
- Special Issue of LAA
- SIAM Conference on Discrete Mathematics
- DIMACS Workshop on Semidefinite Programming
- Workshop on Independent Component Analysis
- Conference on Mathematics in Signal Processing
- Summer School on CFD
- Dean, Faculty of Mathematics, University of Waterloo
- Faculty Position at University of Durham
- Postdoctoral Position at the University of Kentucky
- Postdoctoral Position at Texas A&M University
- Postdoctoral Position at Hong Kong Baptist University
- Position at NEC, The Woodlands, Texas
- Student Position at Universite de Versailles
- Contents, Mathematics of Control, Signals, and Systems
- Contents, Constructive Approximation
- Contents, Linear Algebra and its Applications

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

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

From: Paul Vandooren <Vandooren@csam.ucl.ac.be>

Date: Sat, 26 Jun 1999 13:38:12 +0200 (MET DST)

**Subject: Householder Awards**

HOUSEHOLDER AWARD X

The Alston S. Householder Award X (1999) is given to the author

of the best dissertation in numerical algebra submitted by the

recipient of a Ph.D. earned between 1/1/1996 and 12/31/1998.

It was awarded to Joerg Liesen (Univ. Bielefeld) for the thesis

Construction and Analysis of Polynomial Iterative Methods for

Non-Hermitian Systems of Linear Equations

The following three theses received an honorable mention:

Inderjit Dhillon (U.C. Berkeley), for the thesis

A New 0(n^2) Algorithm for the Symmetric Tridiagonal Eigenvalue

Eigenvector Problem

Karl Meerbergen (K.U.Leuven), for the thesis

Robust Methods for the Calculation of Rightmost Eigenvalues of

Nonsymmetric Eigenvalue Problems

Kim Chuan Toh (Cornell Univ.), for the thesis

Matrix Approximation Problems and Nonsymmetric Iterative Methods

Entries were assessed by an international committee consisting

of James Demmel, Ludwig Elsner, Paul Van Dooren (Chair),

Charles Van Loan and Olof Widlund.

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

From: Todd Veldhuizen <tveldhui@extreme.indiana.edu>

Date: Wed, 23 Jun 1999 09:07:37 -0500 (EST)

**Subject: Object-Oriented Numerics Web Page**

The Object-Oriented Numerics (OON) page and its associated

mailing lists have moved. The new URL is:

http://oonumerics.org/oon/

This web site indexes resources for numerical computing in

object-oriented languages (primarily C++, but some Java and

Python). The site lists libraries (free and commercial),

projects, reference material, and conferences. There is

a mailing list (oon-list) for discussing OO numerics, and

another (oonstd) for discussing standards.

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

From: Jorge More <more@mcs.anl.gov>

Date: Fri, 25 Jun 1999 09:44:57 -0500

**Subject: Software for Large Bound-constrained Optimization Problems**

We announce the release of TRON, a trust region Newton method for the

solution of large bound-constrained optimization problems.

TRON uses a gradient projection method to generate a Cauchy step, a

preconditioned conjugate gradient method with an incomplete Cholesky

factorization to generate a direction, and a projected search to

compute the step. The use of projected searches, in particular,

allows TRON to examine faces of the feasible set by generating a small

number of minor iterates, even for problems with a large number of

variables.

Advantages of TRON include

No assumptions of strict complementarity.

Global convergence; fast local convergence.

Identification of optimal face in a finite number of iterations.

An incomplete Cholesky preconditioner with predictable storage requirements.

The current release (Version 1.0) is available from

http://www.mcs.anl.gov/~more/tron

For additional information on TRON, see

Chih-Jen Lin and Jorge J. More',

Newton's method for large bound-constrained optimization problems,

Argonne National Laboratory,

Mathematics and Computer Science Division,

Preprint ANL/MCS-P724-0898,

August 1998 (Revised March 1999).

SIAM Journal on Optimization (to appear)

http://www.mcs.anl.gov/~more/papers/tron.ps.gz

Comments and suggestion should be directed to

Chih-Jen Lin (cjlin@csie.ntu.edu.tw) or Jorge More' (more@mcs.anl.gov)

We are interested in contacting users that will use TRON to solve

new and interesting large optimization problems.

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

From: John Klepeis <john@titan.Princeton.EDU>

Date: Wed, 23 Jun 1999 20:04:37 -0400 (EDT)

**Subject: New Book, Handbook of Test Problems in Optimization**

HANDBOOK OF TEST PROBLEMS IN

LOCAL AND GLOBAL OPTIMIZATION

by

Christodoulos A. Floudas

Princeton University, Princeton, NJ, USA

Panos M. Pardalos

University of Florida, Gainesville, FL, USA

Claire Adjiman

Imperial College of Science, Technology and Medicine, UK

William R. Esposito

Princeton University, Princeton, NJ, USA

Zeynep H. Gumus

Princeton University, Princeton, NJ, USA

Stephen T. Harding

Princeton University, Princeton, NJ, USA

John L. Klepeis

Princeton University, Princeton, NJ, USA

Clifford A. Meyer

Princeton University, Princeton, NJ, USA

Carl A. Schweiger

Princeton University, Princeton, NJ, USA

Book Series : Nonconvex Optimization and Its Applications

Kluwer Academic Publishers, Dordrecht

Hardbound, ISBN 0-7923-5801-5

June 1999, 484 pp.

// USD 225.00 // GBP 132.00 //

http://www.wkap.nl/books.htm/0-7923-5801-5

During the last two decades, a significant growth has taken place in

algorithmic and software development of local and global optimization

methods for a variety of classes of nonlinear, discrete, and dynamic

mathematical problems.

Relative to these advances there have been very limited efforts in

establishing a systematic benchmark framework for the evaluation of

the algoritms and their implementations (Hock and Schittkowski, (1981),

Floudas and Pardalos (1990), Bongartz et al. (1995)).

A well-designed experimental computational testing framework is of

primary importance in identifying the merits of each algorithm and

implementation.

The principal objective of this book is to present a collection of

challenging test problems arising in literature studies and a wide

spectrum of applications.

The input files of the algebraic test problems presented in this book

are available in the GAMS modeling language format, while the input files

of the differential-algebraic test problems are available in the MINOPT

modeling language format. Both types of input files of the

aforementioned test problems are at the following internet address :

http://titan.princeton.edu/TestProblems

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

From: Thanh-Ha LeThi <LeThi@Springer.de>

Date: Thu, 24 Jun 1999 14:04:41 +0200

**Subject: New Book, Computer Algebra in Scientific Computing**

V.G. Ganzha, E. Mayr, E.V. Vorozhtsov (Eds.), Computer Algebra in Scientific

Computing, CASC ' 99, Springer-Verlag, published May 1999

ISBN 3-540-66047-X XI, 511 pp DM 189,00

These are the proceedings of the second in a series of conference on

computer algebra and scientific computing. The workshop is intended to

provide a forum for researchers and engineers in the fields of mathematics,

informatics, numerical analysis etc. An important goal of the workshop is to

unite all these specialists for the purpose of an efficient solution of

many current questions and problems in advanced scientific computing. The

book is of interest to researchers and graduate students in these fields.

For further information, please contact:

Dr. Martin Peters Phone: *49-6221-487 185

Senior Mathematics Editor FAX: *49-6221-487 355

Springer-Verlag

Tiergartenstrasse 17 E-mail: Peters@Springer.de

D-69121 Heidelberg, Germany http://www.springer.de/math/peters.html

Visit our Web site at http://www.springer.de

or http://www.springer-ny.com

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

From: Hans Schneider <hershkow@math.wisc.edu>

Date: Mon, 21 Jun 1999 16:19:13 +0300 (IDT)

**Subject: Special Issue of LAA**

Linear Algebra and its Applications

Special Issue on

INFINITE SYSTEMS OF LINEAR EQUATIONS FINITELY SPECIFIED

One of the traditional hunting grounds of linear algebra is

the area of finite systems of linear equations, as described by a

matrix equation $Ax = b$. Here $A$ is a known matrix,

$b$ a known vector of finite dimensions, and $x$ is an unknown

vector of finite dimensions, which is to be determined such

that the equation is either satisfied, or, if that is not possible,

approximately satisfied. Many techniques are known for finding solutions

or approximate solutions, depending on the properties of the

given data and the approximation technique choosen.

If the system of equations is not finite, i.e. $A$ is not a matrix

but an operator, and $b$ and $x$ are of infinite dimension, then

algebraic and numerical techniques can still be used provided the

given data are finitely specified. Operators with such a property

are often called 'structured operators', and it turns out that

one can solve such infinite equations in an exact or approximate sense using

finite methods and algorithms.

The conjunction of linear algebra and inversion theory for finitely

specified infinite operators brings interesting connections to the

forefront: algebraic equivalents of inner-outer factorizations e.g.,

or the algebraic significance of Kalman filtering. Structured matrices

can be of many types, e.g. systems with finite displacement ranks or

time-varying systems with state spaces of finite dimensions and whose

limiting behaviour is known, e.g. as a time invariant system.

A non-limiting list of topics of interest in this area is (assuming

$A$ is an infinite but finitely described operator of some kind):

- inversion methods

- decomposition methods for the operator A

- quadratic approximation methods

- complexity reduction

- equivalencies

- canonical forms

- transform techniques.

Examples of operator structure:

- systems with low displacement rank

- finitely described time-varying systems

- finitely described almost-periodic systems

- differentials of non-linear systems.

Interested authors are kindly invited to submit full papers with

significant contributions to this area to any of the three

guest editors listed below before June 1st, 2000.

Patrick Dewilde

DIMES, Delft University of Technology

POB 5031,

2600GA Delft, the Netherlands.

Fax: +31 15 262 3271

email: dewilde@DIMES.tudelft.nl

Vadim Olshevsky

Department of Mathematics and Computer Science

Georgia State University

University Plaza

Atlanta, GA 30303, USA

Fax: +1 404 651 2246

email: volshevsky@cs.gsu.edu

Ali Sayed

Rm 44-123A Engr. IV Bldg

Dept. of Electrical Engineering

University of California

Los Angeles, CA 90095-1594, USA

Fax: +1 310 206 8495

email: sayed@biruni.icsl.ucla.edu

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

From: Darrell Ross <ross@siam.org>

Date: Mon, 21 Jun 99 09:12:06 -0500

**Subject: SIAM Conference on Discrete Mathematics**

Tenth SIAM Conference on Discrete Mathematics, June 12-15, 2000

Radisson Hotel Metrodome

Minneapolis, Minnesota

Important Dates:

Minisymposia

December 15, 1999: Deadline for submission of minisymposium proposals and

minisymposium speakers' abstracts.

Contributed Presentations

January 17, 2000: Deadline for submission of contributed abstracts for

lecture or poster presentations.

To know more about this conference, visit:

www.siam.org/meetings/dm00/

or contact SIAM by:

e-mail: meetings@siam.org

phone: 215-382-9800

fax: 215-386-7999

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

From: Farid Alizadeh <alizadeh@rutcor.rutgers.edu>

Date: Wed, 23 Jun 1999 16:42:45 -0400

**Subject: DIMACS Workshop on Semidefinite Programming**

DIMACS

Center for Discrete Mathematics and Theoretical Computer Science

A National Science Foundation Science and Technology Center

DIMACS 7th Implementation Challenge: Semidefinite and

Related Optimization Problems Workshop

January 24 - 26, 2000

DIMACS Center, CoRE Building, Rutgers University

Piscataway, NJ

Organizers:

Farid Alizadeh, Faculty of Management, Rutgers University

David Johnson, AT&T Labs - Research

Gabor Pataki, Columbia University

conference email: challenge@dimacs.rutgers.edu

Presented under the auspices of the Special Year on Large

Scale Discrete Optimization.

The purpose of DIMACS computational challenges has been to

encourage the experimental evaluation of algorithms, in particular

those with efficient performance from a theoretical point of view.

The past Challenges brought together researchers to test time

proven, mature, and novel, experimental approaches on a variety

of problems in a given subject. As the subject of the

last Challenge of this century, one could hardly think of a

better choice than Semidefinite Programming (SDP) - one of the

most interesting and challenging areas in optimization theory to

emerge in the last decade. In the past few years much has been

learned on both the kinds of problem classes that SDP can

tackle, and the best SDP algorithms for the various classes. In

addition a great deal has been learned about the limits of the

current approaches to solving SDP's.

In addition to semidefinite programming a closely related problem

is that of convex quadratically constrained quadratic programming

(QCQP). This problem resides in between linear and semidefinite

programming. It also arises in a variety of applications from

statistics to engineering; and a number of combinatorial

optimization problems, in particular in the Steiner tree

problems and plant location problems have found QCQP as a

subproblem. Similar to, and indeed by an extension from,

semidefinite programming a great deal is known about optimization

with convex quadratic constraints as well as limitation of

current methods. Finally this knowledge has been extended to

problems containing variables and constraints with some or all

of linear, convex quadratic or semidefinite constraints.

This Challenge attempts to distill and expand upon this

accumulated knowledge.

We have collected a variety of interesting and challenging SDP

instances in the following classes. We have made an effort to

create a collection containing instances that are as "real",

as possible; are presently on, or beyond the limits of solvability;

and whose solution would expand our knowledge on the applicability

of SDP.

More precisely, we included: MAXCUT problems from theoretical physics

currently solvable by polyhedral, but not by semidefinite methods; the

Lovasz-Schrijver semidefinite relaxations of 0-1 MIP's , which are

unsolvable by either cutting plane methods, or branch and bound; truss

topology, and Steiner tree problems lacking a strictly complementary

solution.

We invite papers dealing with all computational aspects of

semidefinite programming and related problems. In particular

the following classes of problems of special interest:

Class 1. Cut, and partition problems.

Class 2. Theta function, and graph entropy problems.

Class 3. SDP relaxation of very difficult, (currently unsolvable)

0-1 mixed integer programming problems.

Class 4. Problems in convex quadratically constrained quadratic

programs from engineering.

Class 5. Problems from statistics and finance.

Class 6. SDP instances from engineering, for example truss

topology design, and control theory problems.

Class 7. Difficult, randomly generated problems designed to challenge

algorithms on performance and numerical stability

Class 8. In addition to the classes above we invite investigations

which focus on using SDP and related codes to test out

behavior of heuristics and other new applications. The SDP

code can be developed by the investigators or they may choose

off the shelf codes.

All communications regarding the challenge should be directed to

challenge@dimacs.rutgers.edu in particular preliminary proposal

submission, extended abstracts, and possible submission of

software and problem instances should be sent to the above

address.

September 15: Preliminary proposals due for comment and feedback

November 15: Extended abstracts due date for consideration for the

workshop

January 24-26: The workshop will take place

Final drafts due date for appearance in the workshop proceedings

will be determined.

There will be a $40/day, $5/day for postdocs/graduate students

registration fee for this workshop. For information on registration,

travel and accommodations see:

http://dimacs.rutgers.edu/Workshops/7thchallenge

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

From: Aapo Hyvarinen <aapo@james.hut.fi>

Date: Thu, 24 Jun 1999 13:43:51 +0300 (EEST)

**Subject: Workshop on Independent Component Analysis**

First Call for Papers

I C A 2000

International Workshop on

INDEPENDENT COMPONENT ANALYSIS

and

BLIND SIGNAL SEPARATION

19-22 June 2000

Helsinki, Finland

http://www.cis.hut.fi/ica2000/

Submission deadline: 1 March 2000

AIMS AND SCOPE

This workshop is the second in the series initiated by the highly

succesful ICA'99 workshop in Aussois, France. It is devoted to recent

advances in Independent Component Analysis and Blind Signal

Separation. An important goal of the workshop is to bring together

researchers from artificial neural networks, signal processing, and

other related fields to provide interdisciplinary exchange.

Papers describing original work on ICA and BSS are invited.

Relevant topics include, for example:

- Theory and estimation methods

- Extensions of basic models

- Convolutive and noisy mixtures

- Nonlinear methods

- Hardware implementations

- Audio and telecommunications applications

- Biomedical applications

- Image processing applications

- Data mining applications

- Sensory coding models

PAPER SUBMISSION

Important dates:

1 March, 2000 Submission of *full* paper

15 April, 2000 Notification of acceptance

19-22 June, 2000 Workshop

Detailed submission information will be available from our web site:

http://www.cis.hut.fi/ica2000/

Submitted papers will be peer-reviewed, and acceptance

will be based on quality, relevance and originality.

All the papers presented at the workshop will be published in the

Proceedings of ICA 2000.

INTERNATIONAL PROGRAM COMMITTEE

L. Almeida, INESC, Portugal

S.-I. Amari, RIKEN, Japan

A. Bell, Interval Research, USA

J.-F. Cardoso, ENST, France

A. Cichocki, RIKEN, Japan

P. Comon, Universite de Nice, France

S. Douglas, Southern Methodist University, USA

C. Fyfe, Univ. of Paisley, UK

S. Haykin, McMaster University, Canada

A. Hyvarinen, Helsinki Univ. of Technology, Finland

C. Jutten, INPG, France

J. Karhunen, Helsinki Univ. of Technology, Finland

S. Kassam, Univ. of Pennsylvania, USA

V. Koivunen, Helsinki Univ. of Technology, Finland

T.-W. Lee, Salk Institute, USA

R.-W. Liu, Univ. of Notre Dame, USA

P. Loubaton, Universite de Marne la Vallee, France

K.-R. Mueller, GMD First, Germany

B. Olshausen, UC Davis, USA

E. Oja, Helsinki Univ. of Technology, Finland

P. Pajunen, Helsinki Univ. of Technology, Finland

J. Principe, Univ. of Florida, USA

T. Sejnowski, Salk Institute, USA

K. Torkkola, Motorola Corporate Research, USA

J. Tugnait, Auburn University, USA

L. Xu, The Chinese Univ. of Hong Kong, China

LOCAL ORGANIZING COMMITTEE

General Chair:

E. Oja

Program Chair:

J. Karhunen

Local Arrangements Chair:

V. Koivunen

Publications Chair;

P. Pajunen

Publicity Chair;

A. Hyvarinen

Treasurer:

J. Iivarinen

Web Master:

J. Sarela

COOPERATING SOCIETIES

European Neural Network Society, IEEE Signal Processing Society,

EURASIP, IEEE Neural Networks Council, IEEE Circuits and Systems Society

CONTACT INFORMATION

web site http://www.cis.hut.fi/ica2000/

email ica2000@mail.cis.hut.fi

postal mail ICA 2000, P.O.Box 5400

Lab of Comp. and Info. Science

Helsinki Univ. of Technology

FIN-02015 HUT, Finland

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

From: Ian Proudler <proudler@signal.dera.gov.uk>

Date: Thu, 24 Jun 1999 17:08:44 +0100

**Subject: Conference on Mathematics in Signal Processing**

FIRST CALL FOR PAPERS

FIFTH INTERNATIONAL CONFERENCE ON MATHEMATICS IN SIGNAL

PROCESSING

University of Warwick, 18th - 20th December 2000

Signal processing constitutes an important area for the application of

mathematical concepts and techniques fuelled, for example, by recent

developments in mobile communications, multimedia systems and digital

TV. The last IMA conference on this subject was held in Dec. 1996 and

the intervening years have witnessed significant developments in many

topics such as nonlinear/non-Gaussian signal processing, multirate

signal processing, blind deconvolution/signal separation and broadband

systems. The aim of this conference is to bring together mathematicians

and engineers with a view to exploring recent developments and

identifying fruitful avenues for further research. It is hoped that

the meeting will also help to attract more mathematicians into this

important and challenging field.

Keynote Speaker: Dr. Pierre Comon, Eurecom, France.

Contributed papers are invited on all aspects of mathematics in signal

processing. The majority of contributed papers will be presented in the

poster sessions.

WWW Site:

http://www.ima.org.uk/mathematics/confsignalprocessing.htm

Members of the organising committee

Prof. J G McWhirter (Chairman) (DERA, Malvern)

Prof. O R Hinton (University of Newcastle)

Dr. M D MacLeod (University of Cambridge)

Prof. M Sandler (Kings College, London)

Dr. S McLaughlin (University of Edinburgh)

Dr. I K Proudler (DERA, Malvern)

Conference Officer: Mrs. Pamela Bye

The Institute of Mathematics and its Applications

Catherine Richards House,

16 Nelson Street, Southend-on-Sea

Essex SS1 1EF, England.

Email: pam@ima.org.ac.uk

Fax: +44 (0)1702 354111

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

From: G. Wittum <gabriel@cox.iwr.uni-heidelberg.de>

Date: Sat, 26 Jun 1999 15:06:20 +0200

**Subject: Summer School on CFD**

EMS-WiR Summer School on Numerical Simulation of Flows

Heidelberg September 6-21, 1999

G. Wittum, Heidelberg

The numerical simulation of flows is one of the central problems in

Scientific Computing. Complexity of flow simulations is so high that a

realistic description requires sophisticated mathematical methods and

models. In particular modeling and simulation of turbulent flows, nearly

incompressible flows, and multi-phase flows are challenging problems for

mathematical models and numerical methods.

There is a strong interest in this topic by numerous groups from

mathematical modelling and numerical simulation. Recently a number of

new mathematical models and methods have been introduced which are

highly relevant for flow simulations. Amongst others these are

multiscale modelling and numerics, homogenization, finite-element and

finite volume methods, spectral and h-p discretizations, grid adaptivity

and error estimators, multigrid and conjugate-gradient type methods and

wavelets. Another field of increasing importance is the development of

methods for the visualization of flows. The numerical simulation of

flows requires cooperation of several mathematical disciplines as

Analysis, Numerics, Mathematical Physics and Computational Science.

The European Mathematical Society (EMS) together with the research

network WiR will organize a summer school on Numerical Simulation of

Flows from Sept. 6 - 21, 1999 in Heidelberg. The summer school is a

joint event with AMIF (Applied Mathematics for Industrial Flow Problems)

and SFB 359 of Heidelberg University.

The Summer school will consist of a theoretical and a practical part,

each one lasting a week. The first week (Sept. 6-10, in Heidelberg) is

devoted to basic instruction. During this week mathematical models and

methods are presented in lectures given by specialists. In the second

week (Sept. 13-17) the participants will work on problems posed by the

lecturers in different places (Heidelberg, Freiburg, Stuttgart, Z=FCrich).

Finally the results of this work will be presented in a plenary meeting

(Sept. 20-21, in Heidelberg).

Scientific Comittee: P. Bastian, Heidelberg, G. Dziuk, Freiburg, W.

Hackbusch, Leipzig, R. Jeltsch, Z=FCrich,

D. Kr=F6ner, Freiburg, C.-D. Munz, Stuttgart, R. Rannacher, Heidelberg, W.

Rodi, Karlsruhe,

S. Sauter, Leipzig S. Wagner, Stuttgart, G. Wittum, Heidelberg, H.

Yserentant, T=FCbingen

Local Organizer: G. Wittum, Technische Simulation, IWR, Universit=E4t

Heidelberg, Im Neuenheimer Feld 368, D-69120 Heidelberg, email:

ems@iwr.uni-heidelberg.de,

http://www.iwr.uni-heidelberg.de/~techsim/summerschool

Registration: Online via

http://www.iwr.uni-heidelberg.de/~techsim/summerschool

Registration fee: DM 300,? payed until July 15th, DM 400,? later. The

fee covers participation, lunches, coffee breaks, and materials. All

payments, net of all charges, are to be made in Deutsche Mark by bank

transfer to account No. 50 302 787 600, Baden-Wuerttembergische-Bank

Heidelberg, BLZ 672 700 20, with the address: =93Universitaet Heidelberg,

EMS, Kap 1412/TG86/BA1103=94.

Registration deadline: June 30th 1999.

Lodging reservation: Please book rooms for the first week in Heidelberg

as early as possible using

=93http://www.heidelberg.de/verkehrsverein/deutsch/hotels_index.htm=94 fo=

r

booking rooms for the first week in Heidelberg. A limited number of

cheap rooms is availble for the first week in Heidelberg (see

registration form).

Financial support of participation: A limited number of scholarships by

EMS is available. To apply for such a scholarship, please add a short

curriculum vitae, a sketch of your research interests and a letter of

recommendation.

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

From: John Bullen <jbullen@nh4.adm.uwaterloo.ca>

Date: Mon, 21 Jun 1999 08:57:09 -0400

**Subject: Dean, Faculty of Mathematics, University of Waterloo**

Applications and nominations are invited for the position of

DEAN OF THE FACULTY OF MATHEMATICS, University of Waterloo

Candidates are sought for the position of Dean of the Faculty of

Mathematics. Consisting of approximately 130 regular faculty members, 40

support staff in five academic departments (Applied Mathematics,

Combinatorics & Optimization, Computer Science, Pure Mathematics,

Statistics & Actuarial Science) and 20 additional support staff in the

Mathematics Faculty Computing Facility, the Faculty offers graduate and

undergraduate programs leading to the BMath, MMath, and PhD degrees.

Full-time undergraduate enrolment is about 3200, with three-quarters in

co-op (alternating work/study) programs; about 40% of the Faculty's 230

full-time graduate students are enrolled in doctoral programs. Enrolment

in UW's six Faculties (Applied Health Sciences, Arts, Engineering,

Environmental Studies, Mathematics, Science) exceeds 17,000 full-time

students.

The successful candidate will have a proven record of scholarship, teaching

and administration in order to qualify for a tenured appointment at the

full Professor level. Applications should be accompanied by a current

curriculum vitae; an outline of the talents, experience and ideas a

candidate would bring to the deanship; and the names and addresses of three

referees in a position to comment on a candidate's academic credentials and

administrative experience. Nominations are also invited and should include

a current CV, where possible.

Applications and nominations will be treated in confidence and should be

directed, not later than September 30, 1999, to:

John Bullen

Associate University Secretary

University of Waterloo

Waterloo, Ontario

N2L 3G1

The initial five-year appointment is expected to begin on July 1, 2000.

In accordance with Canadian immigration requirements, this advertisement is

directed to Canadian citizens and permanent residents. The University of

Waterloo encourages applications from all qualified individuals, including

women, members of visible minorities, native peoples and persons with

disabilities.

The UW home page on the Web is at http://www.uwaterloo.ca/home.html

[The full text of Policy 45 -- Dean of a Faculty -- is under 'documents'.]

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

From: James Blowey <J.F.Blowey@durham.ac.uk>

Date: Tue, 22 Jun 1999 14:49:44 +0100 (BST)

**Subject: Faculty Position at University of Durham**

A Chair in Numerical Analysis in the Department of Mathematical

Sciences is available from 1 April 2000 or such date as may be arranged.

The successful candidate will have an outstanding research record in

any branch of Numerical Analysis. The fields of present members of the

department include Finite Element Approximation and Multigrid Methods for

Partial Differential Equations, Numerical Linear Algebra, and

Polynomial Approximation and Ordinary Differential Equations. In the

last Research Assessment both Applied and Pure Mathematics in Durham

were graded 5.

The full advertisement for the chair can be found at the WEB page:

http://fourier.dur.ac.uk:8000/num/NumericAD.htm

and further particulars are available from:

http://fourier.dur.ac.uk:8000/num/fpnumeric.htm

For informal discussion of the post, please contact Professor

A.J. Scholl (Chairman), Tel: +44 (0)191 374 2355, email:

A.J.Scholl@durham.ac.uk or Professor R.S. Ward (Head of Applied

section), Tel: +44 (0)191 374 2378, email: Richard.Ward@durham.ac.uk

Further details and an application form may be obtained from the

Director of Personnel, Old Shire Hall, Durham, DH1 3HP, to whom

applications (5 copies) should be submitted, including the names of

three referees. (Candidates outside the British Isles may submit one

copy only.) Tel: +44 (0)191-374 3140/ fax: +44 (0)191-374 7253/e-mail

l.a.cook@durham.ac.uk

Closing date: Thursday, 30 September, 1999 Please quote reference C065.

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

From: Jun Zhang <jzhang@cs.uky.edu>

Date: Thu, 24 Jun 1999 16:30:10 -0400 (EDT)

**Subject: Postdoctoral Position at the University of Kentucky**

Postdoctoral Research Position

Funds are available to support a postdoctoral research

associate (or a visitor on academic leave) for one

year, starting September 1, in the Department of

Computer Science at the University of Kentucky. The

associate or visitor will work with Jun Zhang on

a project entitled "Parallel Block Predictor-Corrector

Methods for Solving Ordinary Differential Equations".

The candidate should have a strong background in applied

scientific computing and computational mathematics, with

strong programming skill (in Fortran or C).

Interested person should e-mail a curriculum vitae (with

full publication list and e-mail addresses of three referees)

in postscript or ASCII to Jun Zhang at jzhang@cs.uky.edu

or fax it to (606)323-1971, or send a postal mail to:

Professor Jun Zhang

Department of Computer Science

University of Kentucky

773 Anderson Hall

Lexington, KY 40506-9946

USA

No phone call, please. Check the URL address

http://www.cs.uky.edu/~jzhang for more information.

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

From: Prabir Daripa <daripa@math.tamu.edu>

Date: Sat, 26 Jun 1999 01:10:19 -0500 (CDT)

**Subject: Postdoctoral Position at Texas A&M University**

Applications are invited for one postdoctoral position with

Dr. Prabir Daripa in the Institute of Scientific Computation

at Texas A&M University.

The project is in the area of scientific computation and requires

knowldge of solving partial differential equations using numerical

methods, in particular integral equation methods.

Implementation of fast algorithms on serial as well as parallel

machines will be required.

The applicant for this project must have expertise in computations

and developing codes on serial and parallel machines.

Strong proficiency in programming using C in a Unix environment is

a must.

The position is open immediately and is initially for 10-12 month

period with full time research.

Appointment may be extended further depending upon performance and

the funding situation.

A recent Ph.D. in computer science/numerical mathematics/computational

science is required.

Post-Ph.D experience in a research environment is a plus.

Applications should be in the form of a full curriculum vitae

together with the names of three referees and copies of relevant

publications.

They should be sent either by e-mail at the address

daripa@math.tamu.edu

or by airmail to:

Professor Prabir Daripa

Institute of Scientific Computation

and

Department of Mathematics

Texas A&M University

College Station

Texas 77843-3404

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

From: Tang Tao <ttang@aaron.math.hkbu.edu.hk>

Date: Mon, 21 Jun 1999 19:36:37 +0800 (HKT)

**Subject: Postdoctoral Position at Hong Kong Baptist University**

Hong Kong Baptist University

Department of Mathematics

Post-Doctoral Position

Our department anticipates an opening for Post-Doctoral Teaching Fellow for

ten months commencing September 1, 1999. Applicants should have completed

their PhD studies before taking up the appointment and should show

potential for good teaching and research.

The successful applicant will carry a half-time teaching load and be

expected to conduct research in collaboration with faculty members.

Administrative duties will be minimal. Preference will be given to

applicants whose research interests match those of our faculty members.

These areas are primarily discrete mathematics, scientific computing and

statistics. The salary will be HK$33,000 and above per month, depending on

qualifications.

To apply, please send an application letter, your curriculum vitae and any

other supporting materials to the Department of Mathematics, Hong Kong

Baptist University, Kowloon Tong, Hong Kong SAR, China, Email:

efong@hkbu.edu.hk, Phone: (852) 2339 7015, Fax: (852) 2339-5811.

Applicants should also request three referees to mail, email or fax

reference letters to the Mathematics Department directly. Please visit our

departmental web site, http://www.math.hkbu.edu.hk, for more information

about our department. Applications received by July 17, 1999 will receive

full consideration.

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

From: Melissa De La Cruz <melissa@syl.sj.nec.com>

Date: Mon, 21 Jun 1999 11:58:57 -0700

**Subject: Position at NEC, The Woodlands, Texas**

APPLICATIONS CONSULTANT

NEC Systems, Inc.

The Woodlands, Texas

NEC Systems, Inc. is a subsidiary of NEC, a Fortune 50 world leader in the

computers and communications market. NEC produces more than 15,000

different products in more than 140 countries through a network of 198

consolidated subsidiaries, and employs about 160,000 people worldwide.

Our Supercomputer Center in The Woodlands, Texas has immediate openings for

an applications consultant. This is an opportunity for a specialist in the

area of high performance computing who has an advanced degree in

math/engineering/computer science.

This applications specialist will be responsible for developing, maintaining

and updating math library with a special emphasis on sparse solvers and

working on performance enhancement projects for third party engineering and

scientific applications on NEC's high performance vector-parallel SX-4/SX-5

Supercomputers. This career opportunity will provide the applicant access

to NEC SX-4/SX-5 Supercomputers, one of the world's fastest.

The ideal candidates will have demonstrated ability/experience in three or

more of the following areas:

* Numerical linear algebra

* Sparse direct and iterative linear equation solvers

* Math library development

* Proficient in FORTRAN90, C, C++, MPI and OpenMP

* Experience in parallel processing

* Benchmarking on vector-parallel systems

* Familiarity with leading third party software packages such as

FLUENT, FIDAP, STAR-CD, FIRE, CFX, MSC/NASTRAN, CSA/NASTRAN, ABAQUS,

LS-DYNA, MARC

Please submit resumes with Requisition ID 401-AppD to :

Melissa De La Cruz

Staff Recruiter

NEC Systems, Inc.

recruit@syl.sj.nec.com

(408)433-1200 Phone

(408)433-1498 Fax

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

From: Laura Wynter <wynter@dragon.princeton.edu>

Date: Wed, 23 Jun 1999 17:26:47 -0400

**Subject: Student Position at Universite de Versailles**

PhD Opportunity in Mathematical Programming (France)

We are looking for a PhD student to work in the area of Bilevel

Programming with an application to transport planning.

The student should have studied Linear and Nonlinear programming

and should have experience in programming in either C++ or JAVA.

The PhD will be based at the Universite de Versailles (France) with

the possibility of an extended stay in the U.S. The project will last

3 years, and will include a salary and all usual benefits such as

health care.

Interested students should send a CV including their diplomas, awards,

courses studied and grades obtained, and all relevant experience to:

Laura.Wynter@prism.uvsq.fr.

Laura Wynter

Associate professor

PRISM, Universite de Versailles

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

From: Corry Magrijn <magrijn.secsup@tip.nl>

Date: Mon, 21 Jun 1999 17:31:29 +0200

**Subject: Contents, Mathematics of Control, Signals, and Systems**

TABLE OF CONTENTS

Mathematics of Control, Signals, and Systems (MCSS)

Volume 12 (1999), Number 2

B. Schwartz, A. Isidori and T.J. Tarn,

Global normal forms of MIMO nonlinear systems,

with applications to stabilization and disturbance attenuation.

MCSS 12 (1999), 121-142.

V.S. Kozyakin, A. Bhaya and E. Kaszkurewicz,

A global asymptotic stability result for a class

of totally asynchronous discrete nonlinear systems.

MCSS 12 (1999), 143-166.

O.L.V. Costa and R.P. Marques,

Maximal and stabilizing Hermitian solutions for discrete-time

coupled algebraic Riccati equations.

MCSS 12 (1999), 167-195.

B. Jacob,

Linear quadratic optimal control of time-varying systems with

indefinite costs on Hilbert spacces.

MCSS 12 (1999), 196-218.

INFORMATION

Information on MCSS including tables of contents is

available at its home pages:

www.cwi.nl/~schuppen/mcss/mcss.html

www.math.rutgers.edu/~sontag/mcss.html

Address for submissions:

J.H. van Schuppen (Co-Editor MCSS)

CWI

P.O.Box 94079

1090 GB Amsterdam

The Netherlands

Bradley Dickinson, Eduardo Sontag, Jan van Schuppen (Editors)

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

From: Kristen Dranikoski <ca@tarski.math.usf.edu>

Date: Fri, 25 Jun 1999 14:08:26 -0400 (EDT)

**Subject: Contents, Constructive Approximation**

CONTENTS

Vol. 15 Number. 4 1999

467-480 H. Volkmer

Expansions in Products of Heine-Stieltjes Polynomials

481-497 H. T. Koelink and J. Van der Jeugt

Bilinear Generating Functions for Orthogonal Polynomials

499-522 E. Novak and K. Ritter

Simple Cubature Formulas with High Polynomial Exactness

523-536 J. Muller

Convergence Acceleration of Taylor Sections by Convolution

537-551 J. A. Adell and C. Sanguesa

A Strong Convergence Inequality for Gamma-Type Operators

553-575 B. de la Calle Ysern and G. Lopez Lagomasino

Weak Convergence of Varying Measures and Hermite-Pade

Orthogonal Polynomials

577-610 D. S. Lubinsky

On Converse Marcinkiewicz-Zygmund Inequalities in L_p, p>1

611-617 L. Brutman and I. Gopengauz

On Divergence of Hermite-Fejer Interpolation to f(z)=z

in the Complex Plane

RESEARCH PROBLEM

619-621 A. Ambroladze and H. Wallin

Problems on Balayage Related to Rational Interpolation:

Research Problems 99-1

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

From: Hans Schneider <hershkow@aluf.technion.ac.il>

Date: Sun, 27 Jun 1999 10:23:13 +0300 (IDT)

**Subject: Contents, Linear Algebra and its Applications**

URL: http://www.elsevier.nl/locate/jnlnr/07738

Journal: Linear Algebra and Its Applications

ISSN : 0024-3795

Volume : 292

Issue : 1-3

Date : 14-Jun-1999

pp 1-14

Eigenvalue analysis of equilibrium processes defined by linear

complementarity conditions

A Seeger

pp 15-37

How fast can one compute the permanent of circulant matrices?

A Bernasconi, G Resta

pp 39-59

Lenear conditions for positive determinants

JM Carnicer

pp 61-71

Products of three triangular matrices

KR Nagarajan, T Soundararajan

pp 73-97

Feedback invariants of matrix quadruple completions

I Zaballa

pp 99-125

A projective simplex method for linear programming

PQ Pan

pp 127-138

Majorization via generalized Hessenberg matrices

S Hwang

pp 139-154

Some inequalities for norms on matrices and operators

JC Bourin

pp 155-178

Spectral properties of the transition operator associated to a multivariate

refinement equation

RONGQING Jia

pp 179-185

A remark on pattern problems for matrix groups

NQ Thang

pp 187-206

The algebraic riccati inequality: parametrization of solutions, tightest

local frames and generalized feedback matrices

A Ferrante

pp 207-231

G-majorization inequalities for linear maps

M Niezgoda

pp 233-244

Elementary bidiagonal factorizations

CR Johnson, P Van Den Driessche

pp 245-266

Matrix manifolds and the Jordan structure of the bialternate matrix product

W Govaerts

pp 267-280

Biclique decomposition adn hermitian rank

DA Gregory

pp 281-288

Notes on cartesian symmetry classes and generalized trace functions

TG Lei

pp 289-296

Positive semi-definiteness in a group algebra

TG Lei

pp 297-310

Thin structure of eigenvalue clusters for non-hermitian toeplitz matrices

EE Tyrtyshnikov

pp 311-311

Author index

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

End of NA Digest

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

-------