Subject: NA Digest, V. 96, # 15
NA Digest Sunday, April 14, 1996 Volume 96 : Issue 15
Today's Editor:
Cleve Moler
The MathWorks, Inc.
moler@mathworks.com
Today's Topics:
Software for 3D Diffusion-reaction Equations
Identifying Non-efficient Vectors
Addendum to SciTools'96 announcement
ACM-SIAM Symposium on Discrete Algorithms
SIAM Conference on Discrete Mathematics
International Meshing Roundtable
Julia Robinson Celebration of Women in Math
Conference of the ILAS
Workshop on Optimal Control, Dynamic Games and Nonlinear Dynamics
European Community on Computational Methods in Applied Sciences
ISSAC'96 Registration Announcement
Building GUIs for FORTRAN programs with Tcl/Tk
Report on "State of the Art in Numerical Analysis" Conference
Positions Available at Apple Computer
Postdoctoral Position at Rice University
Postdoctoral Position at Sandia Laboratories, Livermore
Research Position at Newcastle upon Tyne
Position at ABB Corporate Research in Switzerland
Graduate Research Assistantships at Marquette
Contents, BIT
Contents, Applications of Mathematics
Contents, SIAM Discrete Mathematics
Contents, SIAM Applied Mathematics
Contents, J. Approximation Theory
Contents, Reliable Computing
Submissions for NA Digest:
Mail to na.digest@na-net.ornl.gov.
Information about NA-NET:
Mail to na.help@na-net.ornl.gov.
URL for the World Wide Web:
http://www.netlib.org/na-net/na_home.html
-------------------------------------------------------
From: Regine Model
Date: Tue, 09 Apr 1996 12:37:02 EDT
Subject: Software for 3D Diffusion-reaction Equations
I am working on an inverse problem of parameter
identification of diffusion equations of the following form
d u(x,t)/ dt = div(D(x)grad(u(x,t)) - m(x)u(x,t) + s(x,t) .
D(x) and m(x) are the unknown parameter functions.
s(x,t) and the flux in normal direction of u on the boundary is known
for different s(x,t), in general a delta-function in space and time.
The iterative inverse procedure is based on the repeated solution of
the forward problem with known parameter functions. I am looking for
a 3D solver for the diffusion equation, commercial or scientific
software possibly with source code. Any suggestions would be appriciated.
Thanks.
Regine Model
Physikalisch-Technische Bundesanstalt
Abbestrasse2-12, D-10587 Berlin
regine.model@ptb.de
fax: (+4930) 3481406
------------------------------
From: Indraneel Das
Date: Tue, 9 Apr 1996 13:25:09 -0500 (CDT)
Subject: Identifying Non-efficient Vectors
This is a problem of identifying the non-efficient vectors
given a set of potentially efficient/non-dominated vectors.
A typical application for this is multi objective optimization.
Consider a finite set S of vectors in R^m,
S = { v_1, v_2, ... , v_n }
A vector v_k in S is said to be efficient (or non-dominated or
Pareto-minimal) in S iff there does not exist j in {1,2,...,n}
such that
v_j(i) <= v_k(i) , for all i in {1,2,...,m}
[v_j(i) indicates the ith component of v_j]
and
v_j(i) < v_k(i) for some i in {1,2,...,m}
The problem is to weed out the non-efficient vectors from S
computationally. Naively, this can be done in O(mn) comparisons.
Is there a smarter way leading to a better complexity result ?
-- Indraneel Das
Department of Computational and Applied Mathematics
Rice University
Houston, TX 77251 -1892
Ph. (713) 527 8101 x3810 e-mail: indra@rice.edu
------------------------------
From: Are Magnus Bruaset
Date: Wed, 10 Apr 1996 11:59:23 +0200
Subject: Addendum to SciTools'96 announcement
SciTools'96
Updated call for papers
In the March 31 issue (13/96) of NA Digest we announced the SciTools'96
workshop to take place in Oslo, Norway this September. Since the
announcement was made, we have been contacted by the international
publisher Birkhauser concerning the possibility of publishing a book
based on carefully selected contributions to the workshop. We feel that
this information is important and it should therefore be communicated to
our potential contributors. For further details, see the workshop web
pages at http://www.oslo.sintef.no/SciTools96/.
On behalf of the SciTools'96 Organizing Committee,
Are Magnus Bruaset
SINTEF Applied Mathematics
------------------------------
From: Trini Flores
Date: Mon, 08 Apr 96 10:01:39 EST
Subject: ACM-SIAM Symposium on Discrete Algorithms
CALL FOR PAPERS
SODA 97
Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
January 5-7, 1997
Le Meridien New Orleans Hotel
New Orleans, Louisiana
This symposium concerns research on the use, design, and analysis of efficient
algorithms and data structures, in areas including, but not limited to:
o Combinatorial Structures
o Computational Biology
o Computational Geometry
o Databases and Information Retrieval
o Discrete Optimization
o Graphs and Networks
o Machine Learning
o Number Theory and Algebra
o On-line Problems
o Pattern Matching and Data Compression
o Random Structures
o Symbolic Computation
Papers will be selected for presentation based on extended abstracts.
Authors wishing to submit a paper should send nineteen copies (hard
copies only) of an extended abstract (not a full paper) to:
SIAM Conference Coordinator
3600 University City Science Center
Philadelphia, PA 19104-2688, U.S.A.
Abstracts must be received at the SIAM office by July 1, 1996 (or
postmarked by June 28, 1996 and sent airmail). This is a firm
deadline; submissions after the deadline will not be considered.
Further information regarding the Symposium can be accessed in electronic
format via SIAM's World Wide Web:
http://www.siam.org/meetings/da97/da97home.htm
------------------------------
From: Trini Flores
Date: Mon, 08 Apr 96 10:01:39 EST
Subject: SIAM Conference on Discrete Mathematics
June 17-20, 1996
Johns Hopkins University
Baltimore, Maryland
The conference preliminary program; dormitory, hotel, and registration
forms; and transportation information will be available through the
World Wide Web on April 15. Point your browser to:
http://www.siam.org/meetings/dm96/dm96home.htm
------------------------------
From: Scott Mitchell
Date: Mon, 8 Apr 1996 14:43:13 -0600
Subject: International Meshing Roundtable
Call for papers
5th International Meshing Roundtable
October 10-11, 1996
Pittsburgh, Pennsylvania, U.S.A.
The goal of the 5th International Meshing Roundtable is to bring
together researchers and developers from industry, academia, and
government labs for the exchange of technical information related to
automatic mesh generation. The Roundtable will include an invited
panel of experts discussing topics suggested by the attendees. There
will be numerous opportunities for informal dialog between attendees.
Accepted papers will be published (by Sandia National Laboratories) in
a proceedings, and made available on the WWW if possible.
Typical paper topics include:
* Unstructured triangular and tetrahedral mesh generation
* Unstructured quadrilateral and hexahedral mesh generation
* Mixed element meshing
* Geometry decomposition techniques
* Adaptive mesh generation and refinement, transition control
* Grid relaxation techniques
* Dirty geometry management for meshing
* Special purpose meshing algorithms for particular applications
* Theoretical or novel ideas with practical potential
June 14 - Paper submission deadline (10-15 pages)
July 26 - Acceptance/rejection notices sent to authors
August 23 - Final, camera-ready papers due
October 11-12 - 5th International Meshing Roundtable
The full call for papers and other information can be found at
http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96
------------------------------
From: Assn. for Women in Mathematics"
Date: Mon, 8 Apr 1996 16:59:54 -0400 (EDT)
Subject: Julia Robinson Celebration of Women in Math
TRAVEL FUNDS available for
WOMEN Graduate Students and Recent Ph.D.s
in the Mathematical Sciences
Julia Robinson Celebration of Women in Mathematics
to be held
July 1-3, 1996
at MSRI, Berkeley, California
supported by the National Security Agency, the
Mathematical Sciences Research Institute and the
Association for Women in Mathematics
The celebration of the 25th anniversary of the Association of Women
in Mathematics (AWM) will culminate in the Julia Robinson
Celebration of Women in Mathematics conference. All mathematicians
are invited to attend the conference. The goals of the celebration
are:
* to showcase the recent achievements of women in mathematics;
* to facilitate networking among women in various fields of
mathematics;
* to provide role models and offer mentoring for beginning women
mathematicians;
* outreach to area teachers and students.
The Celebration will be a two and a half day conference to be held
July 1-3, 1996, at the Mathematical Sciences Research Institute
(MSRI) in Berkeley, California. Details of the program can be found
in the MSRI homepage: http://www.msri.org/
Approximately 40 grants to attend the conference will be available to
women in the mathematical sciences. In awarding these grants, preference
will be given to women graduate students and recent Ph.D.s. Applicants
should include a cover letter, an outline of their research (maximum two
double-spaced pages) and a curriculum vita. Graduate student applicants
should also include a letter of recommendation from their advisors. All
non-U.S. citizen applicants must have a current U.S. address.
Send FIVE complete copies of the application materials (including
the cover letter) to:
Julia Robinson Conference Selection Committee
Association for Women in Mathematics
4114 Computer & Space Sciences Building
University of Maryland
College Park, Maryland 20742-2461
(Applications via e-mail or fax are not acceptable.)
ANY QUESTIONS? - PHONE: 301-405-7892 E-MAIL: awm@math.umd.edu
***** APPLICATION DEADLINE: MAY 10, 1996 ******
------------------------------
From: Matthias Bollhoefer
Date: Tue, 9 Apr 1996 13:50:14 +0200 (MESZ)
Subject: Conference of the ILAS
Second Announcement and Final Call for Papers
SIXTH CONFERENCE OF THE
INTERNATIONAL LINEAR ALGEBRA SOCIETY
August 14-17, 1996, Chemnitz (GERMANY)
PURPOSE
To bring together researchers and educators in all fields of Linear Algebra
from Numerical Linear Algebra to Algebra, pure and applied, allowing a broad
exchange of ideas and discussion of recent developments in these areas.
Special emphasis: Numerical Linear Algebra, Computational Algebra.
INVITED SPEAKERS
R. Bapat (New Dehli), L. Berg (Rostock), R. Byers (Lawrence), J.-L. Dorier
(Grenoble), M. Eiermann (Freiberg), R. Gow (Dublin), F. Hall (Atlanta),
U. Helmke (W"urzburg), D. Hershkowitz (Haifa), C.-K. Li (Williamsburg),
R. Mathias (Williamsburg), N. Nichols (Reading), B. Parlett (Berkeley),
T. Pate (Auburn), C. Ringel (Bielefeld), P. Van Dooren (Louvain La Neuve).
Olga Taussky-Todd speaker: R. Guralnick (Los Angeles)
After diner speaker: B. Huppert (Mainz)
MINISYMPOSIA
G. Michler: Parallel Computations in Algebra
B. Silbermann: C^*-Algebra Techniques in Computational Linear Algebra
R. Horn: Canonical Forms
N. Higham: Perturbation Theory
ORGANIZING COMMITTEE
B. De Moor (Leuven), G. De Oliveira (Coimbra), L. Elsner (Bielefeld),
T. Laffey (Dublin), V. Mehrmann (Chemnitz, Chairman), G. Michler (Essen),
M. Neumann (Storrs), F. Uhlig (Auburn).
LOCAL ARRANGEMENTS COMMITTEE
D. Happel, F. Lowke, C. Rost, B. Silbermann.
CALL FOR PAPERS
Contributed papers from all areas of linear algebra and applications are
solicited. Papers fitting within the scope of the conference will be
accepted, subject to unavoidable limitations of space and time. Selected
papers will be scheduled as 15(+5)-minute presentations in concurrent
sessions.
Two copies of an extended one-page abstract should be submitted by May 1,
1996, to
Volker Mehrmann email: mehrmann@mathematik.tu-chemnitz.de
Fakult"at f"ur Mathematik fax: +49-(0)371-531-2657
TU Chemnitz-Zwickau
D-09107 Chemnitz, GERMANY
Electronic submissions are encouraged. Abstracts should mention all authors
and their affiliations. Please also provide the postal and e-mail address
(or fax number) of the corresponding author to facilitate correspondence.
The abstracts will be collected in a book of abstracts distributed at the
conference. A selection of papers will also be collected in the conference
proceedings but these have to be submitted separately.
For more information contact
Heike Weichelt email: ilas@mathematik.tu-chemnitz.de
Fakult"at f"ur Mathematik phone: +49-(0)371-531-2659
TU Chemnitz-Zwickau fax: +49-(0)371-531-2657
D-09107 Chemnitz, GERMANY
or use our website at the URL http://www.tu-chemnitz.de/ilas/
------------------------------
From: Michael Breitner
Date: Tue, 9 Apr 1996 16:23:32 +0200 (DFT)
Subject: Workshop on Optimal Control, Dynamic Games and Nonlinear Dynamics
First Announcement and Call for Papers
Sixth Viennese Workshop on
Optimal Control, Dynamic Games and Nonlinear Dynamics
Theory and Applications in Economics and OR/MS
Vienna , May 21-23, 1997
After five successful workshops on various similar topics the Sixth Viennese
workshop on Optimal Control, Dynamic Games and Nonlinear Dynamics will again
bring together researchers interested in the application of nonlinear methods
in economics, operations research and management science. Topics of interest
are optimal control theory, dynamic programming, differential games,
evolutionary games, learning, economic modelling, chaos theory, complex
systems and related fields. Theoretical contributions to one of these fields
which are relevant to problems from economics or OR/MS are especially welcome
but also applied modelling will be covered.
The attendance will be limited, and due to the lack of sufficient financial
support by private and public organizations a registration fee of ATS 1500.-
(approx. US$150.-) will be charged. In addition to the scientific program an
extensive social program will be organized.
If you wish to participate in the Workshop please send an email to
ws_vie97@e119ws1.tuwien.ac.at
If you have no access to electronic mail please contact
Prof. Gustav Feichtinger,
Department of Operations Research and Systems Theory,
Vienna University of Technology
Argentinierstrasse 8/119
A-1040 Vienna, AUSTRIA
Fax: +43-1-5054524
by surface mail or fax. To facilitate fast and efficient communication,
answers by email are prefered.
------------------------------
From: Patrick Le Tallec
Date: Tue, 09 Apr 1996 18:40:57 +0200
Subject: European Community on Computational Methods in Applied Sciences
European Community on Computational Methods in Applied Sciences
ECCOMAS 96
Paris, September 9-13, 1996
- SECOND ECCOMAS CONFERENCE ON
NUMERICAL METHODS IN ENGINEERING
- THIRD ECCOMAS COMPUTATIONAL FLUID
FLUID DYNAMICS CONFERENCE
Topics: Computational Methods in Applied Sciences, Fluid
Mechanics and Engineering.
Format: 15 invited speakers, 19 Special Technological Sessions,
27 minisymposia, 360 contributed papers.
Programme: The programme of the conference and the registration forms
are now available on the web at
//www.inria.fr/Colloques/ECCOMAS-eng.html
------------------------------
From: Manuel Bronstein
Date: Fri, 12 Apr 1996 18:13:00 +0200
Subject: ISSAC'96 Registration Announcement
I S S A C ' 9 6
International Symposium on Symbolic and Algebraic Computation
July 24-26, 1996 Zurich, Switzerland
Sponsored by ACM SIGSAM and ACM SIGNUM
Registration/Accomodation information and registration forms for ISSAC'96
are now available from the ISSAC'96 homepage at either one of:
http://www.inf.ethz.ch/ISSAC96/ISSAC96.html
http://www.inf.ethz.ch/department/WR/html/ISSAC96
------------------------------
From: Venkat Sastry
Date: Sun, 14 Apr 1996 12:30:36 +0100 (BST)
Subject: Building GUIs for FORTRAN programs with Tcl/Tk
Two Day Course on
Building GUIs for FORTRAN programs with Tcl/Tk
10 -- 11 June 1996
Tool Command Language (Tcl)/ Tool Kit (Tk) is a GUI development tool which
has been increasingly adapted in a variety of applications. This two day course
is aimed at programmers and project managers with particular interest in the
development of inexpensive but effective GUIs for their applications.
For further details contact:
Mrs C Lankaster,
Department of Applied Mathematics and Operational Research,
Cranfield University,
RMCS Shrivenham,
Swindon, Wilts. SN6 8LA,
Tel: 01793 785316
Fax: 01793 784196
Email: amor@rmcs.cran.ac.uk
------------------------------
From: Hans Munthe-Kaas
Date: Tue, 9 Apr 1996 10:25:07 +0200
Subject: Report on "State of the Art in Numerical Analysis" Conference
State of the art in Numerical Analysis?
What has happened in Numerical Analysis during the last 10 years, and
what are the most interesting future developments in the field? These
questions were the topics in the conference 'State of the art in Numerical
Analysis' held April 1-4 in York, England. The conference has been
arranged every tenth year since 1966 by IMA (The Institute of Mathematics
and its Applications), and this year it gathered 112 mathematicians from
about 16 countries. Gene Golub asked me to summarize the conference for
the NA-Net readers:
The conference centered around the central themes in numerical analysis:
- Linear algebra
- Ordinary differential equations
- Integral equations
- Approximation
- Optimization
- Partial differential equations
And in addition there was a session on new applications. I will here give
a brief personal summary of the various topics, which of course to some
extent is colored by my own personal interests. All the talks will appear in
the conference proceedings, published by IMA. Judged from the quality of
the talks, this will be a very valuable reference source.
Linear Algebra:
Talks were given by Nick Higham (dense linear algebra), Iain Duff (sparse
direct methods), Gene Golub (iterative methods for linear systems) and
Henk van der Vorst (sparse eigenproblems). The main developments in dense
linear algebra during the last 10 years has been centered around all the work
with the LAPACK project for dense linear algebra. Parallel computers have been
around only for about a decade, so most of the work on parallel linear
algebra is done in this period. This is now seen through the organization
of algorithms around block formulations via the BLAS 2 and 3 routines.
Interestingly, also sequential computers gain speed by this organization.
Also in sparse computations, much of the activity has been inspired by
parallel computers. For iterative methods, the main contributions during
the last decade is perhaps the development of Krylov subspace techniques
for unsymmetric systems (GMRES, CGS, Bi-CGSTAB, QMR). And in eigenproblems
there have been a significant development of Lanczos and Arnoldi type
methods. Some old methods have gained new significance (Jacobi) and some
new ideas have been introduced due to parallel computers (divide and
conquer algorithms). Even some new basal mathematical tools have gained
significant importance (pseudospectra).
Where are we going now? It seems as parallelism per se is not a topic of
major popularity, but it will of course remain constantly in our heads when
we contemplate over new algorithms. Since the 'black box' software
packages in linear algebra is now so excellent, much work in the future will be
centered around exploiting structures which arise in various application
areas. This was pointed out by Gene, who said that he 'just late in life'
realized the importance of exploiting all the information which comes from
knowing the structure of the underlying problems. A lot of this
information is lost if we regard our problems as being 'purely' linear
algebra.
Ordinary differential equations:
In this area, the need for alternatives to the 'black box' software was
even more emphasized than in linear algebra. All the three speakers; Chus
Sanz-Serna (geometric integrators), Andrew Stuart (dynamical systems) and Arieh
Iserles (beyond the classical theory of ODEs), pointed out that there is a
major need for understanding how to conserve various properties of equations
that are essential mathematically, and which has not been given enough
consideration numerically. Chus summarized the work done during the last 10
years on preserving symplecticity and Andrew Stuart talked about recovering
the correct asymptotic properties of dissipative dynamical systems (limit
sets and attractors). Here the classical notion of measuring quality
by the global error is not relevant. Ariehs talk summarized the work done
on delay differential equations and differential algebraic systems during the
last decade. He pointed out some areas of significant current research,
where we may gain major insight in the next decade. This includes the work
currently undertaken to understand the integration of equations where the
solution is known to sit on a specific manifold or on a Lie group. In the
discussion someone pointed out that "Whereas one 20 years ago didn't need
to know much about differential equations to work with numerical solutions
of them, this is no longer the case".
Integral equations:
Two talks were given about integral equations; Christopher Baker (Volterra
functional and integral equations), Kendall Atkinson (Boundary integral
equations). Also in these areas the last decade has been very fruitful. For
boundary integral equations much of the understanding of the numerical
analysis of corner singularities have been gained in this period. For me
as an outside viewer in this field, the most fascinating developments have
perhaps been the various fast algorithms for solving the dense matrix
problems arising in these fields. (Fast multipole algorithms and algorithms
based on wavelet compression and multiresolution analysis). Now the
solution techniques for these dense linear algebra problems have become so fast
that it is important not to form the coefficient matrix explicitly. (The
complexity of solving the linear systems is smaller than the complexity of
assembling the coefficient matrix!)
Approximation:
Talks were given by Alistair Watson (emphasis on the univariate case),
Mike Powell (multivariate interpolation), David Broomhead (neural net
approximations). The most important development in approximation has
probably been the field of wavelets, briefly summarized in Watsons talk.
Optimization:
Three talks in this field: Jorge Nochedal (unconstrained optimization),
David Shanno (interior point methods), Nick Gould (nonlinear constraints).
There has been a tremendous amount of work on interior point methods this
decade, and Shanno referred to large industrial optimization problems where
interior point methods beat simplex by a factor 50 in speed.
Partial diff. eqn:
The talks on PDEs were: Franco Brezzi (Stabilization techniques and
subgrid scales capturing), Charlie Elliott (Large approximation of
curvature dependent interface motion), Endre Suli (Finite element methods
for hyperbolic problems: stability, accuracy, adaptivity), Bill Morton
(Approximation of multi-dimensional hyperbolic PDEs). Some keywords from these
talks are error control and adaptivity.
New applications:
There were two talks on applications; Frank Natterer (Tomography) and
Jean-Michel Morel (nonlinear filtering and PDEs). Morels talk about the
connection between filtering techniques in computer vision and partial
differential evolution equations was highly inspiring. The idea is to
classify various families of discrete image filters via the PDEs they
approximate. In some sense, the work in this field resembles the early work
on statistical mechanics/ transport theory/ continuum mechanics in the
last century. This is an area in its infancy, where the basic
understanding of the processes involved is being developed in the language
of PDEs.
Concluding remarks:
It is hard to summarize all the developments that has been going on in
numerical analysis during the last decade. It has been an immensely
fruitful period, and the subject is truly alive and developing.
It is also a pleasure to remark that the numerical analysis community consists
of a bunch of cheerful people, and that the friendly spirit of the 'late
hours' is also a part of the 'State of the Art' in our field. This was
evident in the hilarious dinner speech by John C. Mason. Thanks to the
organizing committee chaired by Alistair Watson, and to Pamela Bye for
arranging all the practical details.
Info is also found at:
http://www.amtp.cam.ac.uk/user/na/SotANA/SotANA.html
Hans Munthe-Kaas
University of Bergen
Norway
------------------------------
From: Ken Turkowski
Date: Mon, 8 Apr 1996 15:05:25 -0700
Subject: Positions Available at Apple Computer
Image Mosaicing: Utilization of Computer Vision techniques to extract
relative 3D information from a set of images and construct a panoramic
environment.
Skills Required: C/C++, Vector Calculus, Projective Geometry, Optimization,
3D Computer Graphics, Computer Vision.
Stereographic Object Reconstruction: Develop a geometric model and texture
map from several photographs of an object.
Skills Required: C/C++, Vector Calculus, Projective Geometry, Optimization,
3D Computer Graphics, Computer Vision, Optic Flow.
Please send CV's and relevant experience to
Ken Turkowski
Apple Interactive Media Group
Apple Computer, Inc.
1 Infinite Loop
MS 301-3M
Cupertino, CA 95014
turk@apple.com
------------------------------
From: Teresa Anne Parks
Date: Wed, 10 Apr 1996 08:57:42 -0500 (CDT)
Subject: Postdoctoral Position at Rice University
RESEARCH SCIENTIST - RICE UNIVERSITY
The Optimization Project of the Center for Research on Parallel Computation
has a postdoctoral position in applications and algorithm development for
large scale numerical nonlinear programming. This position will be under
the direction of Professor John Dennis and Professor Matthias Heinkenschloss
and will be a research appointment in the Department of Computational &
Applied Mathematics.
DUTIES: Conduct independent and joint research in computational
optimization problems rooted in engineering. Specific areas of activity
include optimization software development, development of research
directions, interface with application scientists and engineers,
supervision of graduate and undergraduate research assistant, including
research seminar organization.
QUALIFICATIONS: Applicant must have excellent communication skills and an
ability to work with specialists in varied fields. Applicant must have
demonstrated interest and expertise in at least two of the following:
Algorithm development for nonlinear programming, numerical software
development, nonlinear programming approaches to engineering design or
parameter identification. Ph.D. or equivalent. Applicant's record of
publication will be considered.
TERM: One year commencing June 1, 1996 with possible renewal.
SALARY: Competitive
APPLICATION DEADLINE: April 26, 1996
SEND RESUME TO: RICE UNIVERSITY, EMPLOYMENT OFFICE-MS 56,
6100 MAIN STREET, HOUSTON, TEXAS 77005-1892
AN EQUAL OPPORTUNITY, AFFIRMATIVE ACTION EMPLOYER
------------------------------
From: Juan Meza
Date: Thu, 11 Apr 1996 10:15:39 -0800 (PDT)
Subject: Postdoctoral Position at Sandia Laboratories, Livermore
Research Fellowship
Sandia National Laboratories
Livermore, California
Sandia National Laboratories invites outstanding candidates to apply
for a postdoctoral position in computational sciences. Postdoctoral
positions at Sandia provide an exceptional opportunity for innovative
research in scientific computing on advanced architectures and are
intended to promote the transfer of technology from the laboratory
research environment to industry and academia through the advanced
training of new computational scientists. Candidates should have a
Ph.D. or the equivalent in applied mathematics, computer science, or a
related field, and have a strong interest in computational modeling
research.
Sandia has strong research programs in scientific and parallel
computing and computational mathematics. We seek a candidate with a
research agenda to augment these programs in addition to a strong
interest in the development of state-of-the-art methods for solving
computational science problems. Sandia supports an excellent
computational environment that includes high-performance scientific
workstations and access to state-of-the-art parallel computers.
The postdoctoral position can be for periods of one, two, or three
years. Applications should be addressed to: Sandia National
Laboratories, attn: Anna Isham, Mail Stop 9111, HR Department,
8522-CA0011, P.O. Box 969, Livermore, CA 94551, and must include a
resume' and the names and addresses of three references.
For further information contact Juan Meza (e-mail: meza@ca.sandia.gov,
WWW: http://midway.ca.sandia.gov/~meza)
Sandia National Laboratories is an Equal Opportunity Employer /
Affirmative Action Employer. U.S. Citizenship is required.
------------------------------
From: Chris Petrie
Date: Fri, 12 Apr 1996 14:28:45 +0100 (BST)
Subject: Research Position at Newcastle upon Tyne
UNIVERSITY OF NEWCASTLE UPON TYNE
DEPARTMENT OF ENGINEERING MATHEMATICS
RESEARCH ASSOCIATE
Theoretical study of two-phase gas-solid and gas-liquid flow.
This is a new three year EPSRC funded post in the area of turbulent two-phase
flow modelling. The research will involve the development and analysis of a
variety of mathematical models using both two-fluid and kinetic approaches,
and will contribute to on-going studies in this area within the Department.
Candidates should have a background in theoretical fluid dynamics and, ideally,
should have some knowledge of multi-phase systems. Experience in computer
programming and a knowledge of numerical methods applied to fluid dynamics
will also be an advantage.
Starting salary will be up to GBP16,628 pa on the Grade 1A scale
(GBP14,317 - GBP21,519 pa) according to qualifications and experience.
For information about the Department, see WWW URL http://www.ncl.ac.uk/~nengm/
For further details please contact Professor Yuri Sergeev
Department of Engineering Mathematics, University of Newcastle
Newcastle upon Tyne, NE1 7RU, UK.
tel: (+44)(0) 191 222 6284
email: Yuri.Sergeev@ncl.ac.uk
with whom applications, with full c.v. and the names and addresses of three
referees, should be lodged not later than 1st May 1996.
------------------------------
From: Claude Pommerell
Date: Fri, 12 Apr 1996 19:21:33 +0200
Subject: Position at ABB Corporate Research in Switzerland
ABB is a world-wide leader in power generation and distribution, industrial
automation, and mass transportation. In our Swiss Research Center near Zurich,
approximately 200 scientists and engineers are working on the basics of new
products for ABB. We have research projects in the areas of combustion
engineering, aerodynamics, environmental technology, materials science,
measurement techniques, and computer science.
Within our Computer Engineering Department, we have an immediate opening for a
permanent position as a
Scientific Computing Expert
The candidate should have a broad background in scientific computing. He or she
should be able to analyse practices in computational environments, identify
problems and find solutions, and should have experience in most of the
following levels of scientific computing:
- mathematical modeling
- numerical analysis
- parallel computing
- high-performance computing environments
- commercial simulation software
- UNIX system tuning
- computer networks
Furthermore, experience in the following fields is a plus:
- computational fluid dynamics
- benchmarking
- WWW technology
Communicative skills are essential, since the candidate will often have to
interface between scientists, engineers, and managers in very different fields,
advise them on improvements, and articulate ideas in their own terminology.
The position requires the willingness to learn German.
Interested applicants should submit a curriculum vitae by e-mail (ASCII or
PostScript) to , or to
Claude Pommerell
ABB Corporate Research
CH-5405 Baden-Daettwil
Switzerland
------------------------------
From: George Corliss
Date: Fri, 12 Apr 96 16:56 CDT
Subject: Graduate Research Assistantships at Marquette
Industrial-Based Graduate Research Assistantships
Marquette University, Milwaukee, Wisconsin, USA
Department of Mathematics, Statistics, and Computer Science
The Marquette University Department of Mathematics, Statistics,
and Computer Science has openings for two Industrial-Based
Graduate Research Assistantships in industrial and applied
mathematics. Students will pursue a Master of Science degree
while working closely with industrial sponsors Johnson Controls
and SC Johnson Wax. One assistantship requires skills in
operations research, the other in statistics and database
design.
Number of openings: two.
Duration: June 3 or August 15, 1996, through December, 1997.
Annual stipend: $12,000 + 18 tuition credits per year.
Deadline: All applications received by May 6 will be considered. If
no suitable candidates are found, applications will be welcomed,
and the positions will be filled by the first suitable applicant.
The NSF funding requires students to be citizens of the USA
or lawfully admitted permanent resident aliens.
An on-site interview at the applicant's expense will be required.
Students from groups traditionally underrepresented in the field
are especially sought.
For information: Dr. George Corliss (georgec@mscs.mu.edu)
Specifics? http://studsys.mscs.mu.edu/~georgec/Jobs/indust_gra.html
------------------------------
From: Ake Bjorck
Date: Tue, 9 Apr 1996 09:46:52 +0200
Subject: Contents, BIT
CONTENTS BIT Volume 36, No. 2 (1996)
ISSN 0006-3835
Roundoff error analysis of algorithms based on Krylov subspace methods
M. Arioli and C. Fassino, pp. 189--205
Checking robust nonsingularity of tridiagonal matrices in linear time
I. Bar-On, B. Codenotti and M. Leoncini, pp. 206--220
The iterative correction method for Volterra integral equations
H. Brunner, L. Qun, Y. Ningning, pp. 221--228
A composition law for Runge-Kutta methods applied to index-2
differential-algebraic equations
R. P. K. Chan and P. Chartier, pp. 229--246
Perturbation and error analyses for block downdating of a Cholesky decomposition
L. Eld\'en and H. Park, pp. 247--263
Optimized look-ahead recurrences for adjacent rows in the Pad\'e table
M. Gutknecht and M. Hochbruch, pp. 264--286
Limitations of the L-curve method in ill-posed problems
M. Hanke, pp. 287--301
Finding roots of a real polynomial simultaneously by means of Bairstow's method
W. S. Luk, pp. 302--308
Continuous extensions to Nystr\"om methods for second order initial
value problems
A. Marthinsen, pp. 309--332
Diagonal forms of the translation operators in the fast multipole
algorithm for scattering problems
J. Rahola, pp. 333--358
On fair parametric rational cubic curves
M. Sakai and A. Usmani, pp. 359-377
On some stability bounds subject to Hille-Yosida resolvent conditions
J. Sand, pp. 378--386
Automatic quadrature of functions of the form $g(|f(x)|)$
A. Venter and D. P. Laurie, pp. 387--394
SCIENTIFIC NOTES
High order iterative methods for approximating square roots
B. Kalantari and I. Kalantari, pp. 395--399
------------------------------
From: Petr Prikryl
Date: Tue, 9 Apr 1996 12:38:33 +0200 (MET DST)
Subject: Contents, Applications of Mathematics
APPLICATIONS OF MATHEMATICS
Contents
Volume 41, Number 3 (1996)
B. Rie\v can: On the entropy and generators of dynamical systems
M. Pokorn\'y: Cauchy problem for the non-newtonian viscous
incompressible fluid
D. Goeleven: Noncoercive hemivariational inequality and its
applications in nonconvex unilateral mechanics
News and Notices:
Professor Ivo Babuska is seventy
70th birthday of Vratislav Hor\'alek
Book reviews
------------------------------
From: SIAM
Date: Tue, 09 Apr 96 14:23:43 EST
Subject: Contents, SIAM Discrete Mathematics
SIAM Journal on Discrete Mathematics
May 1996
Volume 9, Number 2
pp. 167-348
Finding a Domatic Partition of an Interval Graph in Time O(n)
Glenn K. Manacher and Terrance A. Mankus
On a Question of Erdos on Subsequence Sums
Don Coppersmith and Steven Phillips
Spanning Trees-Short or Small
R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, and S. S. Ravi
On the Nonexistence of Perfect Codes in the Johnson Scheme
Tuvi Etzion
A Graph-Coloring Result and its Consequences for Polygon-Guarding Problems
Frank Hoffmann and Klaus Kriegel
Classifying Hyperplanes in Hypercubes
Oswin Aichholzer and Franz Aurenhammer
Packing Steiner Trees: Separation Algorithms
M. Grotschel, A. Martin, and R. Weismantel
On the Power of Democratic Networks
E. N. Mayoraz
Bounding Functions and Rigid Graphs
Michael O. Albertson and Ruth Haas
A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
Binay Bhattacharya, Pavol Hell, and Jing Huang
The Ultimate Categorical Independence Ratio of a Graph
Jason I. Brown, Richard J. Nowakowski, and Douglas Rall
Random Walks on Regular and Irregular Graphs
Don Coppersmith, Uriel Feige, and James Shearer
The L(2,1)-Labeling Problem on Graphs
Gerard J. Chang and David Kuo
Realizing Degree Sequences in Parallel
Srinivasa R. Arikati and Anil Maheshwari
The Total Interval Number of a Graph II: Trees and Complexity
Thomas M. Kratzke and Douglas B. West
------------------------------
From: SIAM
Date: Fri, 12 Apr 96 08:46:24 EST
Subject: Contents, SIAM Applied Mathematics
SIAM JOURNAL ON Applied Mathematics
JUNE 1996 Volume 56, Number 3
CONTENTS
Symmetric Singularity Formation in Lubrication-Type Equations for Interface
Motion
Andrea L. Bertozzi
An Inverse Problem in Thermal Imaging
Kurt Bryan and Lester F. Caudill, Jr.
Layer Stripping for the Helmholtz Equation
John Sylvester, Dale Winebrenner, and Fred Gylys-Colwell
Integral Geometry in Hyperbolic Spaces and Electrical Impedance Tomography
Carlos A. Berenstein and Enrico Casadio Tarabusi
Matrix Lie Group-Theoretic Design of Coupled Linear Optical Waveguide Devices
R. W. C. Vance
C^1-Arcs for Minimizers of the Mumford-Shah Functional
Guy David
Slow Passage Through a Pitchfork Bifurcation
G. J. M. Maree
Stochastic Models with Multistability and Extinction Levels
Fritz Colonius, F. Javier de la Rubia, and Wolfgang Kliemann
Information Capacity of Channels with Partially Unknown Noise. I.
Finite-Dimensional Channels
C. R. Baker and I.-F. Chao
------------------------------
From: Marilyn Radcliff
Date: Fri, 12 Apr 1996 09:03:59 -0400 (EDT)
Subject: Contents, J. Approximation Theory
Table of Contents: J. Approx. Theory, Volume 85, Number 1, April 1996
Peter Math\'e
On the existence of unbiased Monte Carlo estimators
1--15
Ying Guang Shi
Necessary conditions for $L_p$ convergence of Lagrange interpolation
on an arbitrary system of nodes
16--26
Michael Prophet
Codimension one minimal projections onto the quadratics
27--42
Jorge Bustamante Gonzalez
Asymptotics for Angelesco-Nikishin systems
43--68
Thomas Bagby, Len Bos, and Norman Levenberg
Quantitative approximation theorems for elliptic operators
69--87
Dimitar K. Dimitrov
On a conjecture concerning monotonicity of zeros of ultraspherical
polynomials
88--97
Y. Makovoz
Random approximants and neural networks
98--109
Note
Kamen G. Ivanov and Boyan Popov
On convex approximation by quadratic splines
110--114
------------------------------
From: Vladik Kreinovich
Date: Sat, 13 Apr 96 17:26:02 MDT
Subject: Contents, Reliable Computing
Reliable Computing. - 1996. - N 2 (2). - 114 p.
CONTENTS
Preface 95
Mechanising the theory of intervals using OBJ3
Marcilia A. Campos, Augusto C. A. Sampaio, and Alexandre H. F.
Brainer 97
Errors in vector processing and the library libavi.a
Tiaraju A. Diverio, Ursula A. Fernandes, and Dalcidio
M. Claudio 103
Chebyshev acceleration techniques for large complex non
Hermitian eigenvalue problems
Vincent Heuveline and Miloud Sadkane 111
Interval methods that are guaranteed to underestimate (and the
resulting new justification of Kaucher arithmetic)
Vladik Kreinovich, Vyacheslav M. Nesterov, and Nina A. Zheludeva 119
On the computational complexity of the solution of linear
systems with moduli
Anatoly V. Lakeyev 125
Software for high radix on-line arithmetic
Thomas Lynch and Michael J. Schulte 133
Self-correcting polynomial programs
Guevara Noubir and Henri J. Nussbaumer 139
Reducing division latency with reciprocal caches
Stuart F. Oberman and Michael J. Flynn 147
Interval approach challenges Monte Carlo simulation
Janne Pesonen and Eero Hyvonen 155
Interval operations involving NaNs
Evgenija D. Popova 161
Enclosing solutions of overdetermined systems of linear interval
equations
Jiri Rohn 167
Numerical solutions of Burgers' equation with a large Reynolds
number
Masaaki Sugihara and Seiji Fujino 173
Rank of convex combinations of matrices
Tomasz Szulc 181
Locating, characterizing and computing the stationary points of
a function
Michael N. Vrahatis and Evangelia C. Triantafyllou 187
Reviews
Applications of Reliable Scientific Computing 195
Addresses of the Editorial Board members 204
Information for authors 206
Contents 207
The contents of all the issues, as well as other information related to
interval computations, is placed on the Interval Computations website
http://cs.utep.edu/interval-comp/main.html
(for journal, click on the Journal link in the main menu)
------------------------------
End of NA Digest
**************************
-------