NA Digest Sunday, November 22, 1998 Volume 98 : Issue 44

Today's Editor:
Cleve Moler
The MathWorks, Inc.

Submissions for NA Digest:

Mail to

Information about NA-NET:

Mail to

URL for the World Wide Web:

From: Arnold Neumaier <>
Date: Wed, 18 Nov 1998 12:50:59 +0100
Subject: Large Low Rank Submatrices

Given a m by n matrix A, suppose there is a submatrix formed by
k rows of A that is close to a matrix of small rank p, in the sense
that the sum of squares of differences of the entries is bounded by
some tolerance delta multiplied by k.

Is there an efficient way for finding the correct set of rows?
Since the problem may be NP hard, several related questions
approximating this problem are also of interest. Moreover, in the
application I have in mind, k is unknown (and p<=3) and one wants to
find the largest set of rows with the stated property.

Arnold Neumaier


From: Arnold Neumaier <>
Date: Wed, 18 Nov 1998 13:03:01 +0100
Subject: Nearest Multiple of a Vector

Some time ago, I had asked in NA-net,

> Are there fast algorithms for computing the multiple of
> a vector $b$ nearest to a vector $a$ in the 1-norm
> and the max norm,
> $\min_\lambda ||a-\lambda b||_1$,
> $\min_\lambda ||a-\lambda b||_\inf$,
> and the related problem
> $\min_\lambda max_i (a_i-\lambda b_i)$ ?
> More precisely, I would like to know the corresponding
> active sets after $O(n)$ operations, if possible with a
> constant independent of the length of the data.

I got some interesting responses and made some investigations
based on these. The answer to all three cases is positive,
though nice O(n) algorithms haven't been explicitly described.
Thus there is further scope for research.

The WWW page
contains an edited version of the most useful replies and refers to
interesting WWW pages and references that might be useful.

(If you come up with a useful implementation, please post it on NA-net!

Arnold Neumaier


From: TheoremNet Administrator <>
Date: 16 Nov 98 21:17:52 EST
Subject: Web Resource Site in Control

The following site:

collects several resources for control theory and engineering, including the
complete and indexed collections of the Electronic Newsletter in Control and
the Nonlinear Control Abstracts, as well as links to books, journals,
software, technical societies, conference listings, and other web sites.


From: Thanh-Ha LeThi <>
Date: Mon, 16 Nov 1998 17:15:27 +0100
Subject: Lecture Notes in Computational Science and Engineering

Hans Petter Langtangen "Computational Partial Differential Equations -
Numerical Methods and Diffpack Programming", Lecture Notes in
Computational Science and Engineering, Vol. 2, Springer-Verlag, due
March 1999

ISBN 3-540-65274-4 DM 98,00/US $ 56,00 XXIV, 658 pp

"The target audience of this book is students and researchers in
computational sciences who need to develop computer codes for solving
partial differential equations. The exposition is focused on numerics
and software related to mathematical models in solid and fluid
mechanics. The book teaches finite element methods, and basic finite
difference methods from a computational point of view. The main emphasis
regards development of flexible computer programs, using the numerical
library Diffpack. The application of Diffpack is explained in detail for
problems including model equations in applied mathematics, heat
transfer, elasticity, and viscous fluid flow. Diffpack is a modern
software development environment based on C++ and object-oriented
programming. All the program examples, as well as Diffpack for use with
this book, are available for free over the Internet."

P. Deuflhard, J. Hermans, B. Leimkuhler, A. Mark, S. Reich, R.D. Skeel
(Eds.) "Computational Molecular Dynamics: Challenges, Methods, Ideas",
Lecture Notes in Computational Science and Engineering, Vol. 4,
Springer-Verlag, published November 1998

ISBN 3-540-63242-5 DM 149,00/US $ 89,00 XI, 489 pp

"On May 21-24, 1997 the Second International Symposium on Algorithms for
Macromolecular Modelling was held at the Konrad-Zuse-Zentrum in Berlin.
The event brought together computational scientists in fields like
biochemistry, biophysics, physical chemistry, or statistical physics and
numerical analysts as well as computer scientists working on the
advancement of algorithms, for a total of over 120 participants from 19
countries. In the course of the symposium, the speakers agreed to
produce some representative volume that combines survey articles and
original papers (all refereed) to give an impression of the present
state of the art of Molecular Dynamics. The 29 articles of the book
reflect the main topics of the Berlin meeting which were i)
Conformational Dynamics, ii) Thermodynamic Modelling, iii) Advanced
Time-Stepping Algorithms, iv) Quantum-Classical Simulations and Fast
Force Field and v) Fast Force Field Evaluation."

D. Kroener, C. Rohde, M. Ohlberger (Eds.) "An Introduction to Recent
Developments in Theory and Numerics Conservation Laws", Lecture Notes in
Computational Science and Engineering, Vol. 5, Springer-Verlag, due
December 1998

ISBN 3-540-65081-4 DM 129,00/US $ 89,95 VII, 289 pp

"The book concerns theoretical and numerical aspects of systems of
conservation laws, which can be considered as a mathematical model for
the flows of inviscid compressible fluids. Five leading specialists in
this area give an overview of the recent results, which include: kinetic
methods, non-classical shock waves, viscosity and relaxation methods,
a-posteriori error estimates, numerical schemes of higher order on
unstructured grids in 3-D, preconditioning and symmetrization of the
Euler and Navier-Stokes equations. This book will prove to be very
useful for scientists working in mathematics, computational fluid
mechanics, aerodynamics and astrophysics, as well as for graduate
students who want to learn about new developments in this area."

For further information, please contact:

Dr. Martin Peters Phone: *49-6221-487 185
Senior Mathematics Editor FAX: *49-6221-487 355
Tiergartenstrasse 17 E-mail:
D-69121 Heidelberg, Germany

Visit our Web site at


From: Thanh-Ha LeThi <>
Date: Thu, 19 Nov 1998 12:46:48 +0100
Subject: New Book, High Performance Comptuing in Science and Engineering

E. Kraus, W. Jaeger (Eds.): High Performance Computing in Science and
Engineering ' 98, Springer-Verlag, due December 1998

ISBN 3-540-65030-X DM 148,00/US $ 99,00 Hardcover IX, 380 pp,
30 figures

"The book contains reports about the most significant projects from
science and industry that are using the supercomputers of the Federal
High Performance Computing Center Stuttgart (HLRS). These projects are
from different scientific disciplines, with a focus on engineering,
physics and chemistry. They were carefully selected in a peer-review
process and are showcases for an innovative combination of
state-of-the-art physical modeling, novel algorithms and the use of
leading-edge parallel computer technology. As HLRS is in close
cooperation with industrial companies, special emphasis has been put on
the industrial relevance of results and methods."

For further information, please contact:

Dr. Martin Peters Phone: *49-6221-487 185
Senior Mathematics Editor FAX: *49-6221-487 355
Tiergartenstrasse 17 E-mail:
D-69121 Heidelberg, Germany

Visit our Web site at


From: Marshall Bern <>
Date: Mon, 16 Nov 1998 14:56:51 PST
Subject: ACM Symposium on Computational Geometry

Fifteenth Annual ACM Symposium on
June 13--16, 1999
Miami Beach, Florida


The 1999 ACM Symposium on Computational Geometry, featuring
an applied track, a theoretical track, and a video review,
will be held at the Radisson Deauville Resort in Miami Beach, Florida.
We invite submissions that address applications of geometric computing,
for the applied track, or fundamental problems of geometric computing,
for the theoretical track.

Topics for the applied track include, but are not limited to
experimental analysis of algorithms and data structures;
robotics and virtual worlds;
computer graphics, simulation and visualization;
image processing;
geometric and solid modeling;
computer aided geometric design;
geographical information systems.

Electronic submissions are preferred, but authors may instead
mail 14 copies of an extended abstract to arrive by December 4, 1998 to:

John Canny
Computer Science Division
529 Soda Hall
Berkeley, CA 94720-1776
Phone: (510) 642-9955

Topics for the theoretical track include, but are not limited to:
theoretical analysis of geometric algorithms and data structures;
discrete and combinatorial geometry;
mathematical and numerical issues arising from implementations.

Electronic submissions are preferred, but authors may instead
mail 8 copies of an extended abstract to arrive by December 4, 1998 to:

Marshall Bern
Xerox PARC
3333 Coyote Hill Road
Palo Alto, CA 94304-1314
Phone: (650) 812-4443

8th Annual Video Review of Computational Geometry

Background: This video review showcases the use of visualization in
computational geometry for exposition and education, as an interface
and a debugging tool in software development, and for the visual
exploration of geometry in research. Algorithm animations, visual
explanations of structural theorems, descriptions of applications of
computational geometry, and demonstrations of software systems are all
appropriate. Videos that accompany papers or communications submitted
to the technical program committee are encouraged.

Videotapes and accompanying text should be sent to:

Jeff Erickson
Department of Computer Science
University of Illinois
1304 W. Springfield Ave.
Urbana, IL 61801
Phone: (217) 333-6769


From: Jonee Taylor <>
Date: Mon, 16 Nov 1998 15:21:52 -0800
Subject: Anniversary Meeting for Stanford SCCM Program


On Saturday February 6th there will be a one-day meeting to celebrate
the 10 year anniversary of the Scientific Computing and Computational
Mathematics (SCCM) Program at Stanford University. The Program was founded
by Gene Golub, GM Homsy, Joe Keller and Joe Oliger in 1987; Gene Golub
was Program Director for the first 10 years.
The speakers are:
Liliana Borcea (Computational Science, Rice)
Jim Demmel (Computer Science and Mathematics, Berkeley)
John Hennessy (Dean of Engineering, Stanford)
Parviz Moin (Director, Center for Turbulence Research, Stanford)
Stan Osher (Mathematics, UCLA)
Hongyuan Zha (Computer Science, Penn State)

There will be a small registration fee of $10. There will also be a
dinner in the evening; the venue for this will upon numbers. To
help in planning please send answer to the following questions
to Jonei Taylor -- -- by December 1st.

I) I am interested in attending the one-day meeting on Scientific Computing
at Stanford University on February 16th.
II) I would/would not be interested in attending a dinner in the evening
of February 16th.


From: Mike Powell <>
Date: Wed, 18 Nov 98 16:02:42 GMT
Subject: Conference on System Modelling and Optimization

19th IFIP TC7 Conference on
System Modelling and Optimization
Cambridge, England
July 12-16, 1999

Please note that the deadline for submitted papers is January 31st, 1999,
and that contributions on general algorithms for optimization calculations
will be very welcome. The web pages of the conference at

were updated recently, in order to include most of the titles of the plenary
lectures, the procedure for registering and reserving accommodation in
Cmabridge, and a brief description of the technical and social events. You
may also obtain this and future information by sending an e-mail message to

M.J.D. Powell


From: Betsy Gillies <>
Date: Wed, 18 Nov 1998 15:39:54 -0600 (CST)
Subject: Workshop on Mathematics from Physics

Mathematics from Physics: Recent Trends and New Developments 19-22 May 1999

The department of Mathematics and Physics at the University of Illinois
would like to add a link or listing to your calendar to announce the
workshop listed above. The web page address is as follows:

Registration for the workshop, Mathematics from Physics: Recent Trends
and New Developments (19-22 May 1999) may be accomplished from the web
page or by contacting the Workshop Committee:

c/o Ms. Donna Guzy
1110 W. Green Street
Dept., of Physics
University of Illinois
Urbana, IL 61801


From: Endre Suli <>
Date: Thu, 19 Nov 1998 10:47:14 GMT
Subject: Foundations of Computational Mathematics Conference

Foundations of Computational Mathematics Conference
Oxford University, U.K.
July 18-28, 1999


Oxford University is hosting the Foundations of Computational
Mathematics Conference (FoCM99) in July 18-28, 1999. The mission of
the meeting is to establish a common agenda between computation, pure
mathematics and computer science. While presenting plenary talks by
foremost world authorities and maintaining the highest technical level
in workshops, the emphasis will be on multidisciplinary interaction
across subjects and disciplines, in an informal and friendly atmosphere.

The overall oversight of FoCM99 is the responsibility of the FoCM
Executive Committee whose current Chair is Arieh Iserles (University
of Cambridge). The organisation of the 1999 meeting is managed by the

John Ball (Oxford), Richard Brent (Oxford), Chris Budd (Bath),
Mike Giles (Oxford), Nick Gould (Rutherford-Appleton Labs),
Nick Higham (Manchester), Bill McColl (Oxford),
Endre Suli (Chair, Oxford), Nick Trefethen (Oxford)


John BALL (Oxford University, UK)
Ingrid DAUBECHIES (Princeton University, USA)
Jean Pierre DEDIEU (Universite Toulouse, France)
Alan EDELMAN (Massachusetts Institute of Technology, USA)
Joos HEINTZ (Universidad de Buenos Aires, Argentina)
Nick HIGHAM (University of Manchester, UK)
Robert McLACHLAN (Massey University, New Zeland)
Jorge NOCEDAL (Northwestern University, USA)
Erich NOVAK (Universitat Erlangen, Germany)
Peter OLVER (University of Minnesota, USA)
Bjorn POONEN (University of California at Berkeley, USA)
Rolf RANNACHER (Universitat Heidelberg, Germany)
Guillermo SAPIRO (University of Minnesota, USA)
Andrew STUART (Stanford University, USA)
Denis TALAY (INRIA Centre de Sophia Antipolis, France)
William THURSTON (University of California at Davis, USA)
Leslie VALIANT (Harvard University, USA)
Shing-Tung YAU (Harvard University, USA)

WORKSHOPS and their organisers:
* Analysis and approximation of infinite-dimensional problems
John Ball (Oxford) and Endre Suli (Oxford)
* Approximation theory
Ron DeVore (South Carolina) and Allan Pinkus (Haifa)
* Complexity theory, real machines and homotopy
Jean-Pierre Dedieu (Toulouse) and Pascal Koiran (Lyon)
* Computational Dynamics
John Guckenheimer (Cornell) and Robert MacKay (Cambridge)
* Computational geometry and topology
David Epstein (Warwick) and David Gabai (Caltech)
* Computational number theory
Richard Brent (Oxford) and Henri Cohen (Bordeaux)
* Geometric integration and computation on manifolds
Chris Budd (Bath) and Hans Munthe-Kaas (Bergen)
* Information-based complexity
Stefan Heinrich (Keiserslautern) and Erich Novak (Erlangen)
* Multiresolution, computer vision and PDEs
Vicent Caselles (UIB, Palma) and Wolfgang Dahmen (Aachen)
* Numerical linear algebra
Alan Edelman (MIT) and Nick Higham (Manchester)
* Optimization
Nick Gould (RAL) and Mike Todd (Cornell)
* Relations to computer science
Laszlo Lovasz (Yale) and Bill McColl (Oxford)
* Stochastic computation
Peter Kloeden (Berlin) and Dominique Picard (Paris-VII)
* Symbolic algebra and computational algebraic geometry
James Davenport (Bath) and Elizabeth Mansfield (Canterbury)

CONTACT INFORMATION: For further information, see:
or e-mail to


From: George Karypis <>
Date: Fri, 20 Nov 1998 08:23:36 -0600 (CST)
Subject: Special Issue on Graph Partitioning and Parallel Computing

Graph Partitioning and Parallel Computing
Edited by: George Karypis, Rupak Biswas, and Bruce Hendrickson

Graph partitioning is an important problem with extensive applications
in parallel computing. Over the years, graph partitioning and parallel
computing have shared a symbiotic relationship. On the one hand, graph
partitioning is a key enabling technology for parallel computing, as it
allows irregular problems to be efficiently solved on parallel machines.
Advances in partitioning algorithms have allowed progressively harder
problems to be successfully solved in parallel. On the other hand,
parallel computing is a driving force behind the development of the
next generation of graph partitioning algorithms. For instance, the need
to solve dynamically changing irregular problems in parallel has been the
primary motivation for the development of parallel graph partitioning and
dynamic repartitioning algorithms.

In recent years, significant progress has been made in graph partitioning
algorithms. At the same time, a number of parallel applications have emerged
that require partitioning as part of their solution. However, many open
questions remain, both in partitioning algorithms and in applications.
The purpose of this issue is to report on new developments and on directions
for future work in this important area. Our goal is to bring together the
current state-of-the-art in graph partitioning formulations and algorithms,
report on new, innovative uses of partitioning as the facilitator for parallel
processing, and provide directions for future research in this area. Papers
are solicited in all related research areas including, but not limited to:

- Parallel static or dynamic partitioning algorithms.
- New partitioning algorithms for parallel computing.
- New partitioning models, objectives, requirements, and algorithms
for emerging parallel applications.
- Comparative studies of partitioning algorithms.
- Applications of partitioning in parallel processing.
- Applications of parallel partitioning.

Authors should follow the Parallel Computing manuscript format as described
in the "Instructions to authors" at the end of each issue, or found at the
web page:

Important Dates
Submission Deadline: February 15, 1999
Acceptance Decision: June 15, 1999
Final Version Due: August 31, 1999
Publication Date: November 1999 (tentative)

Guest Editors

George Karypis
Rupak Biswas
Bruce Hendrickson


From: Hai Xiang Lin <>
Date: Fri, 20 Nov 1998 16:45:55 +0100 (MET)
Subject: Workshop on High Performance Numerical Methods

Call for Papers
Workshop on High Performance Numerical Computations with Applications

The workshop will be organized in the 7th International Conference on
High Performance Computing and Networking Europe (HPCN-99) in
Amsterdam, The Netherlands, April 12 - 14, 1999.

Scientific and engineering computing has become a key technology which
will play an important part in determining, or at least shaping, future
research and development activities in many academic and industrial branches.

This workshop is to bring together computer scientists, applied mathematicians
and researchers to present, discuss and exchange novel ideas, new results,
work in progress and advancing state-of-the-art techniques in the area of
parallel and distributed computing for numerical and computational
optimization problems in science and engineering applications.

The main topics will include (but not limited to) the following:

1. development of advanced parallel and distributed numerical, combinatorial
and global optimization methods, with applications in CFD, computational
mechanics, material sciences, and electronic circuits, etc.
2. practical experience of applying parallel and distributed technology to
solve large scale engineering problems. Papers showing the needs of
high performance and demonstrating the impact of parallel and distributed
technology are particularly solicited.

Deadlines: Paper Submission Due: December 15, 1998
Notification of Acceptance: January 15, 1999
Final Camera-Ready version: February 15, 1999

Please send your submission to one of the organisers:
Dr. H.X. Lin, Department of Technical Mathematics and
Computer Science, Delft University of Technology
P.O. Box 356, 2600 AJ Delft, The Netherlands,
and Tianruo Yang
Department of Computer and Information Science
Link=F6pings University, 581 83 Link=F6pings, Sweden

For more information see


From: Piyush Mehrotra <>
Date: Fri, 20 Nov 1998 16:34:17 -0500 (EST)
Subject: High Performance Fortran User's Group

HUG '99
The 3rd Annual HPF User Group Meeting
Maui, Hawaii
May 24-25, 1999

The Third Annual High Performance Fortran User Group (`HUG')
meeting will be held on May 24-25,1999 at the Renaissance Wailea
Resort Maui, Hawaii. This meeting follows the first two meetings
in the series held in 1997 in Santa Fe, New Mexico, USA, and in
1998 in Porto, Portugal. It provides an opportunity for users of
HPF to meet each other, share ideas and experiences, and obtain
up-to-date information on current HPF implementations and future

The HUG meeting will include:
* invited presentations by HPF users & technology providers
* contributed talks
* panel discussions

There may also be a poster session and demonstrations.

The HPF User's Group meeting will be followed by an HPF Forum
Meeting on May 26 at the same location.

Call for submissions We invite abstracts for presentations from
all those working on topics of relevance for High Performance
Fortran. Relevant subject areas include, but are not limited to:

* applications in HPF
* HPF software, e.g.:
-- compilers
-- HPF programming support tools
-- libraries
* HPF features, e.g.:
-- HPF evaluations
-- extensions and improvements to HPF
-- interoperability of HPF with other languages

Abstracts of up to 500 words must be submitted electronically by
February 26, 1999 to They must be in HTML
format readable by Netscape 2.0 or later. Authors will be
notified of acceptance by March 19, 1999. The selected abstracts
will be posted on the Web prior to the conference.

Important dates
February 26, 1999: deadline for submission of abstracts
March 19, 1999: notification of acceptance.

Program committee
Piyush Mehrotra ICASE, Hampton USA (Chair)
Barbara Chapman University of Southampton, Southampton, UK
Ken Kennedy Rice University, Houston, USA
Chuck Koelbel Rice University, Houston, USA
Vince Schuster Portland Group, Portland, USA
Henk Sips Delft University of Technology, Netherlands
Brian Smith University of New Mexico, Albuquerque, USA*
Eric de Sturler ETH, Zurich, Switzerland
Yoshiki Seo NEC Corp, Japan (* contacted)

Further information about this event will be available on the
HUG'99 Web page at:

Enquiries may be sent to


From: Claudio Canuto <>
Date: Tue, 17 Nov 1998 15:10:10 +0100
Subject: Postdoctoral Position at Politecnico di Torino

Dipartimento di Matematica

Wavelets and Multiscale Methods in Numerical Analysis and Simulation.

The Politecnico di Torino offers post-doctoral grants to conduct
research within the TMR project "Wavelets and Multiscale Methods
in Numerical Analysis and Simulation". The grants are available
in the period January 1, 1999 - March 31, 2001, with a minimal
duration of 3 months. The amount per month is 1,800 ECU.

Young scientists whose research interests are in one of the areas:
applied harmonic analysis, partial differential equations, numerical
analysis and Scientific computation are encouraged to apply.

The following topics: construction of wavelet bases, domain
decomposition methods, preconditioning techniques, adaptive
discretization of PDE's, fluid dynamics and electromagnetic
applications, and related areas of studies are among the interests
of our group.

Candidates must be nationals of a European Community Member State
other than Italy or a State associated with the TMR Program and must
not be over 35 years of age.
Interested people are kindly invited to contact me by e-mail. They
should submit their application by sending: Curriculum Vitae, papers,
research interest and two letters of recommendation to the following


From: Mike DeLong <>
Date: Mon, 16 Nov 1998 10:30:18 -0700 (MST)
Subject: Graduate Research Positions at Los Alamos National Laboratory

Graduate Research Assistant Positions
Los Alamos National Laboratory

The Scientific Computing Group (CIC-19) at Los Alamos National Laboratory
is currently seeking highly motivated graduate students to participate in
the Graduate Research Assistant (GRA) program for the Spring 1999 semester.
Graduates with experience in any or all of the following categories are
encouraged to apply:

Iterative Linear Equation Solvers
Multigrid Methods
Numerical Linear Algebra
Parallel Computer Programming
Parallel Software Engineering and Library Development

Experience with Fortran 90, C++ and MPI on parallel machines such as
the SGI/Cray Origin 2000 and workstation clusters is desirable.
Experience with iterative linear solver methods such as conjugate
gradient methods, domain decomposition methods and multigrid
methods is also desirable.

Eligibility for the GRA program is limited to applicants who have
completed a bachelors degree by date of hire, and have been admitted to
or have active status in a graduate program at a college or university.
Students that have completed a Masters degree and have not yet been
accepted into another graduate program may be eligible for the Post
Masters program and are also encouraged to apply.

Appointments are for 90 days up to one year. Salary ranges from $29,000
to $41,000, depending on the number of years of graduate school

We are currently unable to hire foreign nationals from the following
countries: Algeria, Armenia, Azerbaizan, Belarus, China, Cuba, Georgia,
India, Iran, Iraq, Israel, Kazakhstan, Kyrgyzstan, Libya, Moldova, North
Korea, Pakistan, Russia, Sudan, Syria, Taiwan, Tajikistan, Turkmenistan,
Ukraine, and Uzbekistan.

Applications must be received as soon as possible to be given fullest
consideration. Interested individuals are encouraged to send a copy of
their resume by electronic mail, fax, or U.S. mail to:

Mike DeLong
Los Alamos National Laboratory
Group CIC-19, MS B256
Los Alamos, NM 87545

FAX: (505) 667-1126

Los Alamos National Laboratory is an equal opportunity employer.


From: Rick Hathaway <r.hathaway@IEEE.ORG>
Date: Tue Nov 17 10:18:11 1998
Subject: Faculty Position at George Southern University

The Department of Mathematics and Computer Science at Georgia Southern
University invites nominations and applications for the Karl Peace Endowed
Chair. Starting date of the position is August 1, 1999. Applicants are
expected to have a Ph.D. in mathematics, computer science, statistics or a
closely related field, and credentials that merit appointment at the rank
of professor with tenure. We are searching for an individual with
distinguished academic credentials, the proven ability to conduct and
direct high quality research, and an established record of attracting
support for that research. Candidates should have the qualifications to
provide academic and scientific leadership to a developing department. The
successful candidate will be expected to establish a vigorous research
program, to have a commitment to excellence in undergraduate and graduate
education, and to lead our efforts to establish a cooperative program with
industry. We are particularly interested in an individual whose area of
expertise lies in the intersection of mathematics and computer science, but
exceptional candidates from all fields of the mathematical sciences will be
seriously considered. Among the duties will be program development, fund
raising and preparation of proposals, and involvement with the Center of
Applied Mathematical Sciences.

The Department of Mathematics and Computer Science, in the Allen E. Paulson
College of Science and Technology, offers programs in mathematics at the
baccalaureate and masters levels. Our B.S. in Computer Science is fully
accredited by the Computer Science Accreditation Commission. The
Department has five state-of-the-art computer laboratories, as well as a
networked computer (UNIX, PC or Mac) in the office of each faculty member.
The Department has steadily increased its quantity and quality of
scholarship during the past decade in applied mathematics, computer science
and statistics. Our web pages are at

Georgia Southern University, a unit of the University System of Georgia, is
the largest and leading center of higher education in the southern half of
Georgia and is third in student enrollment among public universities,
serving approximately 14,000 students. As a comprehensive, residential
university, its mission is strongly centered on the education of
undergraduate students. The University offers approximately 150 degree
programs at the baccalaureate, masters, and doctoral levels through six
colleges. Founded in 1906, Georgia Southern became a regional university in
1990. The 634-acre campus is located in Statesboro, a community of
approximately 30,000 residents, 50 miles northwest of historic Savannah and
200 miles southeast of Atlanta.

A complete application consists of a letter of application addressing the
above qualifications, a curriculum vitae, and five letters of reference.
Send application materials to Richard Hathaway, Search Chair, Karl Peace
Endowed Chair of Mathematics and Computer Science, PO Box 8093, Department
of Mathematics and Computer Science, Georgia Southern University,
Statesboro, GA 30460-8093. Review of the applications will begin on
February 15, 1999. Departmental representatives will be available at the
national AMS/MAA meeting in San Antonio in January 1999 to discuss this
position with interested parties.

Georgia Southern is an Equal Opportunity, Affirmative Action Institution.
Georgia is an Open Records state. Persons who need reasonable
accommodations in order to participate in the application process should
notify the search chair.


From: Lawrence Cowsar <>
Date: Tue, 17 Nov 1998 11:48:12 -0500
Subject: Research Position at Bell Laboratories, Lucent Technologies

The Scientific Computing Research Department at Bell Laboratories,
Lucent Technologies in Murray Hill, New Jersey seeks applicants for a
Member of Technical Staff position. The department is looking for
candidates with a strong background in computer science who have
conducted innovative research in large-scale scientific computation.
Strong preference will be given to researchers with demonstrated
expertise in numerical methods for partial differential equations,
experience with interdisciplinary research in the physical sciences,
and personal involvement in scientific software development.

Preference will also be given to candidates who have received their
Ph.D. within the last 4 years or anticipate receiving their Ph.D. by
the spring of 1999.

The members of the Scientific Computing Research Department conduct
research in the core areas of numerical analysis, as well as
computational geometry, pattern recognition, modeling languages, and
numerical modeling of physical systems including wave propagation,
fiber technology and semiconductor devices. The department is part of
the Computing and Mathematical Sciences Research Division which
includes groups working on a broad research program in the computer
and mathematical sciences as well as applications. Further background
information can be obtained via the following URL:

Interested applicants should submit a curriculum vitae and a
description of their computational and interdisciplinary experience
via electronic mail to LaTeX,
Postscript or HTML prefered.

Written inquiries should be directed to:

Lawrence Cowsar
Bell Laboratories
Room 2C-464
700 Mountain Avenue
Murray Hill, NJ 07974-2070.

Lucent Technologies is an equal opportunity employer.


From: Laura Kenny-Carlson <kenny@CS.Stanford.EDU>
Date: Tue, 17 Nov 1998 10:27:45 -0800
Subject: Faculty Position at Stanford University

Department of Computer Science
Faculty Opening

The Computer Science Department of Stanford University invites
applications for a tenure-track faculty position from candidates with
expertise in the areas of continuous and discrete modeling, numerical
analysis, or high-performance scientific computing. There is a
particular interest in candidates who wish to pursue a research program
on tools for high-performance computing (such as languages, compilers
and architectures). Candidates are also expected to be actively
interested in application areas which include, but are not
restricted to, some of the following: physical simulation, mining of
massive data sets, statistical learning, data visualization,
computational biology (e.g., protein folding, molecule binding), and
medical imaging. Higher priority will be given to the overall
innovation and promise of the candidate's work than to contributions to
any of these specific topics.

Applicants should have a Ph.D. in a relevant field. Evidence of the
ability to pursue a research program and a strong commitment to
graduate and undergraduate teaching are required. The successful
candidate will be expected to teach courses, both in the candidate's
specialty area and in related subjects, at the graduate and
undergraduate levels, and to build and lead a team of graduate students
in Ph.D. research.

The appointment will be made at the level of an Assistant Professor.
The position is available beginning Autumn 1999 and is offered in
collaboration with the Scientific Computing and Computational
Mathematics (SCCM) Program. Further information about
the Computer Science Department and the SCCM Program can be found at and,

Applications should include a curriculum vita, statements of research
and teaching interests and the names of five references. The
application should be sent to:

Professor Rajeev Motwani, Search Committee Chair
c/o Laura Kenny-Carlson
Computer Science Department
Stanford University
Gates 2B
Stanford, CA 94305-9025

The interview process will begin on January 15, 1999, but applications
will be accepted until February 15, 1999. Stanford University is an
equal opportunity employer and welcomes applications from women and
minority candidates.


From: Ronald F Boisvert <>
Date: Tue, 17 Nov 1998 16:58:41 -0500 (EST)
Subject: Postdoctoral Positions at NIST

The Mathematical and Computational Sciences Division (MCSD) of
the National Institute of Standards and Technology (NIST) invites
applicants for two-year postdoctoral research appointments beginning
in the fall of 1999. General areas of interest include mathematical
modeling, mathematical algorithms, and software. Examples of
topics of interest include the development of digital libraries
of mathematical reference data (e.g., for special functions),
modeling and analysis of computer networks and security systems,
and object-oriented numerical software development (e.g., Java).

NIST postdocs are chosen through a national competition
administered by the National Research Council. Deadline for
applications is January 15. Applicants must be US citizens.
NIST is located in Gaithersburg, Maryland, a suburb of
Washington, DC, with an additional facility in Boulder, Colorado.
Further information on opportunities within MCSD, as well as
details concerning the application procedure can be found at


From: Jacobo Bielak <>
Date: Tue, 17 Nov 1998 21:45:39 -0500
Subject: Faculty Position at Carnegie Mellon University

Carnegie Mellon University's Department of Civil and Environmental
Engineering invites applications for a tenure-track faculty position
in the area of computational mechanics. Preference will be given to
applicants at the Assistant Professor level. The successful candidate
must have the ability to teach effectively at both the undergraduate
and graduate levels and develop an active and significant research
program. The Department is particularly interested in applicants with
a demonstrated interest in biomechanics or multi-scale materials modeling.
Nonetheless, outstanding persons in all areas of computational mechanics
will be considered. The University has a long-standing tradition of
interdisciplinary research, and, thus, offers faculty an unusual
opportunity to interact with colleagues from other departments.
Applicants are required to have a doctorate in engineering by the
starting date. They should send a resume, transcripts, statement of
research and teaching interests, one or two of their papers, and a list
of references to Professor Jacobo Bielak; Chair, Computational Mechanics
Faculty Search Committee; Department of Civil and Environmental Engineering;
Carnegie Mellon University; Pittsburgh, PA 15213-3890. The appointment
starts in Fall 1999. Review of applications will begin in December 1998,
and will continue until the position is filled. Carnegie Mellon University
is an affirmative action/equal opportunity employer.


From: LSU <>
Date: Tue, 17 Nov 1998 21:44:44 -0600
Subject: Systems Administrator Position at LSU

Anticipated COMPUTER MANAGER 1 Department of Mathematics

Required Qualifications: Bachelor's degree; two or more years experience
with network system administration and hardware maintenance procedures on
Unix workstations; knowledge of Unix workstations (preferably SUN Solaris
operating system) including experience in configuration, security
assessment and problem resolution for software installation, hardware
maintenance, network protocols including configuration (100MB Ethernet)
and security analysis, distributed and parallel processing; excellent
communication and analytic skills.

Additional Qualifications Desired:

knowledge of mathematical numerical packages (MatLab), symbolic
computation languages (Mathematica, Maple, etc.), and the TeX mathematical
typesetting language (including macro writing); experience in working with
a diverse user population, management of personnel and coordination of
diverse computer related projects; experience in technology support in
higher education and/or mathematical research experience in areas
represented within the LSU Department of Mathematics. Salary will be
commensurate with qualifications and experience.

For full consideration, submit application by November 30, 1998.
Applications will be accepted until position is filled.

Submit letter of application and resume to:

Neal W. Stoltzfus,
Department of Mathematics
Louisiana State University
Ref: Log #580
Baton Rouge, LA 70803-4918

E-mail: OR

Phone: (225) 388-1665 FAX: (225) 388-4276


From: Ian Gladwell <>
Date: Thu, 19 Nov 1998 08:05:33 -0600
Subject: Faculty Positions at Southern Methodist University

Southern Methodist University
Department of Mathematics

Applications are invited for two tenure-track assistant professor
positions to begin in the Fall semester of 1999. Applicants must
provide evidence of outstanding potential for research in applied
mathematics and a strong commitment to teaching at all levels.
The Department of Mathematics has an active doctoral program in
applied mathematics, specializing in physical applied
mathematics, numerical mathematics and scientific computation.
Research interests include fluid mechanics, nonlinear dynamics
and the computational aspects of ordinary and partial differential
equations. For one position, preference will be given to candidates
whose research has an applied component related to industrial
applications and/or to other sciences or engineering. The second
position is open to any applied mathematician whose research is
closely related to the current interests in the department.

To apply, send a letter of application with a curriculum vita, a list of
publications, a research statement and a teaching statement to:
The Faculty Search Committee, Department of Mathematics,
Southern Methodist University, P. O. Box 750156, Dallas, Texas
75275-0156. Applicants must also arrange for three letters of
recommendation to be forwarded to the Faculty Search Committee.

The committee will begin its review of the applications on or about
January 5, 1999. To ensure full consideration for the position, the
application must be postmarked on or before January 5, 1999.

SMU is an Equal Opportunity/Affirmative Action/Title IX Employer.

Visit the Department=92s WWW site at,
and contact the Search Committee by sending e-mail to [Tel:(214)768-2506; Fax:(214)768-

Professor Ian Gladwell, Chair, Dept of Math, SMU,
Dallas, TX 75275-0156; Phone: (214)768-2506
Fax: (214)768-2355; email:


From: Andrea Piacentini <>
Date: Thu, 19 Nov 1998 16:21:51 +0100 (MET)
Subject: Research Position at CERFACS


Climate Modelling and Global Change Team
Parallel Algorithms Team

Position description:
the Climate Modelling Global Change Team and the Parallel Algorithms
Team at CERFACS have a computer scientist position available in the
field of data assimilation in oceanic models.
This position is open in the framework of the MERCATOR project which
goal is to implement an operational oceanic monitoring system.
The team looks for a highly qualified and motivated candidate with
strong experience in scientific computing.
The recruited computer scientist will work with the MERCATOR/PALM
group which is developing a universal software coupling oceanic data
and models through various assimilation methods.

Required qualifications:
computer scientist with strong
knowledge in parallel distributed computing and applied mathematics.

Additional qualifications:
experience in the development of large operational software.

Opening of the position:
the appointment is expected to be made by January 1st 1999,
or as mutually acceptable subject to position clearances.
Initial appointment is for one year, renewable for one year.
Salary will be commensurate with qualifications and experience.

Applications :
for full consideration, an application letter including a detailed
statement of background and knowledge, along with a curriculum vitae
and, if possible, reference letters, should be submitted as soon as
possible to

Luc Giraud, Parallel Algorithms Team
CERFACS, 42 Av. Coriolis, F-31057 Toulouse, France

Contacts can be taken at the following adresses:

Luc Giraud, E-mail:
Tel: (33) 5 61 19 30 25, Fax: (33) 5 61 19 30 00

Andrea Piacentini , E-mail:
Tel: (33) 5 61 19 30 49, Fax: (33) 5 61 19 30 00


From: Ulrich Ruede <>
Date: Fri, 20 Nov 1998 18:25:24 +0100 (CET)
Subject: Postdoctoral and Research Assistants at University of Erlangen

At University of Erlangen, the newly established
Chair for System Simulation
has openings for
Post Doctoral and Graduate Assistants

Successful candidates are expected to participate actively in our research
projects, including
adaptive algorithms for partial differential equations
multigrid methods
cache aware algorithms
high performance and parallel computing
We are especially interested in candidates having experience with large
scale simulations on clusters of workstations, since we expect too install
a fairly large cluster during 1999. The posts require a well founded
education in (computational) mathematics, computer science, or a related
field at a level equivalent to the German Diploma degree. Knowledge of
German would be a strong plus. Candidates are also expected to participate
in teaching in the department's "International Computational Engineering"
program. Salary is according to the German university system either BAT
IIa or BAT IIa/2, depending on qualification.

Please address your application, or further enquiries to (preferably by
Prof. Dr. Ulrich Ruede, Lehrstuhl fuer Informatik X
Universitaet Erlangen-Nuernberg, Martensstr. 3, D-91058 Erlangen, Germany

PS: Our research group does not yet have its own web pages, but information
about me and some of my research projects can be accessed from my old
web page:


From: David Lerner <>
Date: Fri, 20 Nov 1998 12:43:24 -0600 (CST)
Subject: Faculty Position at University of Kansas

Position in nonlinear dynamics/chaos
University of Kansas,
Department of Mathematics

Applications are invited for a tenure-track position at the assistant
professor level, to begin in August, 1999 or as negotiated. (The position
is contingent on final budgetary approval.)

Preference will be given to candidates in nonlinear dynamical systems and
chaos and otherwise to candidates in pure or applied mathematics or
statistics whose specialities mesh well with those already represented in
the department. Postdoctoral experience is preferred for this position.

Applicants should send a letter of application, a detailed resume with
description of research, an AMS application form and 3 letters of
recommendation to:

C. J. Himmelberg, Chair
Department of Mathematics
405 Snow Hall
University of Kansas,
Lawrence, KS 66045-2142 USA

Review of applications will begin January 1, 1999, and will continue until
the position is filled. The University of Kansas is an affirmative action,
equal opportunity employer.


From: Roderick Melnik <>
Date: Sat, 21 Nov 1998 10:41:42 +1000
Subject: Research Position at University of Southern Queensland

Institution/Company: University of Southern Queensland
Department: Department of Mathematics and Computing
Employer Type(s): Academic
Position Type(s): Non Tenure-Track Faculty
Mathematical Area(s): Applied and Computational Mathematics
Geographic Location of Position: Queensland, Australia


(Level A) Department of Mathematics and Computing,
University of Southern Queensland. The appointee will carry
out research on the construction and use of efficient numerical
algorithms for dynamic models of phase transitions in viscoelastic
and pseudoelastic materials and for nonlinear models of free surface
hydrodynamics. The appointment is at least for one year.
It is possible for the right applicant to be appointed on the full-time
basis for 2 years with both research and teaching duties.
See details at
Forward your inquiries to Professor A.J. Roberts (
or Dr R.V.N. Melnik (


From: Thomas Hogan <>
Date: Thu, 19 Nov 1998 14:55:29 -0500 (EST)
Subject: Contents, Journal of Approximation Theory

Table of Contents: J. Approx. Theory, Volume 95, Number 2, November 1998

In Memoriam

T. S. Chihara and M. E. H. Ismail
In Memoriam Waleed Al-Salam (July 15, 1926--April 13, 1996)

Regular Articles

Semyon Rafalson
Some sharp inequalities for algebraic polynomials

G. Loh\"ofer
Inequalities for the associated Legendre functions

Rong-Qing Jia
Stability of the shifts of a finite number of functions

Philippe Guillaume, Alain Huard, and Vincent Robin
Generalized multivariate Pad\'e approximants

Y. Makovoz
Uniform approximation by neural networks

Leonid Golinskii
Akhiezer's orthogonal polynomials and Bernstein-Szeg\H{o} method for a
circular arc

Zuhua Luo and Jeremy Levesley
Error estimates and convergence rates for variational Hermite

Tom Lyche, Larry L. Schumaker, and Sonya Stanley
Quasi-interpolants based on trigonometric splines

J. V. Stokman and T. H. Koornwinder
On some limit cases of Askey-Wilson polynomials


Volume {\bf 90}, Number 1 (1997), in Article No. AT973065, ``Umbrellas
and polytopal approximation of the Euclidean ball'' by Y. Gordon, S.
Reisner, and C. Sch\"utt, pages 9--22


From: Oleg Burdakov <>
Date: Thu, 19 Nov 1998 18:28:17 -0200 (EDT)
Subject: Contents, Optimization Methods and Software

Table of Contents
Optimization Methods and Software (OMS)
Volume 10, Number 2 (December, 1998)
Special Issue Celebrating the 65th Birthday of Professor Masao Iri

D. Avis
Computational experience with the reverse search vertex
enumeration algorithm

E.G. Birgin And Yu.G. Evtushenko
Automatic differentiation and spectral projected
gradient methods for optimal control problems

E. Boros, V. Gurvich and P.L. Hammer
Dual subimplications of positive Boolean functions

U. Buennagel, B. Korte and J. Vygen
Efficient implementation of the Goldberg-Tarjan minimum-cost
flow algorithm

R.E. Burkard, M. Hujter, B. Klinz, R. Rudolf and M. Wennink
A process scheduling problem arising from chemical production planning

J.B.G. Frenk, J.F. Sturm and S. Zhang
An interior-point based subgradient method for nondifferentiable
convex optimization

Z. Gaspar, N. Radics and A. Recski
Square grids with long "diagonals"

K. Hakata and H. Imai
Algorithms for the longest common subsequence problem for multiple
strings based on geometric maxima

K. Imai and H. Imai
Dynamic weighted Voronoi diagrams and weighted minimax matching of two
corresponding point sets

M. Kojima and L. Tuncel
Monotonicity of primal-dual interior-point algorithms for semidefinite
programming problems

H. Konno, T. Suzuki and D. Kobayashi
A branch and bound algorithm for solving mean-risk-skewness
portfolio models

K. Kubota
A Fortran77 preprocessor for reverse mode automatic differentiation
with recursive checkpointing

M. Li and M. Fushimi
The efficient shape of a skyscraper based on the vertical traffic

T. Minakawa and K. Sugihara
Topology-oriented construction of three-dimensional convex hulls

K. Murota and M. Scharbrodt
Computing the combinatorial canonical form of a layered mixed matrix

J. Stoer and M. Wechs
The complexity of high-order predictor-corrector methods
for solving sufficient linear complementarity problems

M. Yagiura, T. Yamaguchi and T. Ibaraki
A variable depth search algorothm with branching search for
the generalized assignment problem

H. Yamashita
A globally convergent primal-dual interior point method
for constrained optimization

Latex style files:

Instructions for authors, subscription information, free sample copies:

Complete table of contents for the journal OMS, forthcoming papers:


End of NA Digest