URL for the World Wide Web:
http://www.netlib.org/na-net/na_home.html
-------------------------------------------------------
From: NA Digest <na.digest@na-net.ornl.gov>
Date: Mon 08/16/1998 14:22:50.95
Subject: NA Digest Calendar
The Netlib Conferences Database is on the Web at:
http://www.netlib.org/confdb/Conferences.html
NA Digest Calendar
Date Topic Place NA Digest #
Aug. 18-27 International Congress of Mathematicians Berlin, Germany 14
Aug. 18-27 ICM98 Session on Mathematical Software Berlin, Germany 97:27
Aug. 18-27 VideoMath Festival Berlin, Germany 52
Aug. 19-23 Numerical Methods and Applications Sofia, Bulgaria 13
Aug. 19-23 Incompressible Visous Flow Sofia, Bulgaria 07
Aug. 24-26 European Symposium on Algorithms Venice, Italy 06
Aug. 24-26 Hydroinformatics Copenhagen, Denmark 97:25
Aug. 24-27 Computational Mechanics Miskolc, Hungary 03
Aug. 31... Mathematics of Surfaces Birmingham, UK 15
Aug. 31... IFIP World Computer Congress Vienna and Budapest 96:46
Sep. 1- 3 Dynamics, Monitoring and Control Manchester, UK 21
Sep. 1- 4 Parallel Computing Southampton, UK 47
Sep. 1- 4 Numerical Methods inParallel Computing Southampton, UK 48
Sep. 1- 5 Solid Mechanics Zakopane, Poland 37
Sep. 2- 4 Computational Methods in Engineering Ghent, Belgium 34
Sep. 2- 5 Computational Physics Granada, Spain 05
Sep. 7- 9 Control and Data Processing Prague, Czech Republic 39
Sep. 7-12 PDE Meeting in the Sun Mission Beach, Austral.11
Sep. 7-14 Analytic Number Theory and Space Tilings Kyiv, Ukraine 11
Sep. 14-16 Software Tools for Scientific Computing Oslo, Norway 49
Sep. 14-18 Partial Differential Equations Marrakech, Morocco 97:20
Sep. 22-25 Validated Numerics Budapest, Hungary 25
Sep. 23-25 Dutch Numerical Mathematicians Woudschoten, N'lands 17
Sep. 24-25 SYNAPSE*3 Matrix, Neurocomputer Clausthal-Zellerfeld, Germany 27
Sep. 24-26 Computer Mathematics Athens, Greece 04
Sep. 28-30 Iterative Methods for Elasticity Nijmegen, Netherlands 17
Sep. 30... Computing in Electrical Engineering Berlin, Germany 25
Sep. 30... Operational Research Rovinj, Croatia 10
Oct. 1- 3 Parallel Symbolic Workshop Berkeley, CA 30
Oct. 1- 3 Industrial Flow Problems Barcelona, Spain 08
Oct. 4- 9 School on Wavelets in the Geosciences Delft, Netherlands 22
Oct. 5- 8 Multigrid Methods Bonn, Germany 12
Oct. 7-11 Operator Theory Winnipeg, Canada 05
Oct. 8-10 Randomization and Approximation Barcelona, Spain 23
Oct. 14-16 Simulation of Devices and Technologies Cape Town, So. Africa 11
Oct. 14-17 Mathematical Physics Knoxville, TN 48
Oct. 18-20 Iterative Methods Austin, TX 25
Oct. 20-23 SIBGRAPI'98 Rio de Janeiro, Brazil 13
Oct. 21-23 Object Oriented Methods Yorktown Heights NY 21
Oct. 22-23 Mathematical Foundations for CAD Troy, MI 13
Oct. 25-28 Operations Research Seattle, WA 11
Oct. 26-28 Circuits, Systems and Computers Piraeus, Greece 97:20
Oct. 26-29 Air Pollution Modelling Paris, France 48
Oct. 27-29 Continuum Mechanics Rostov-on-Don, Russia 28
Oct. 28-31 Parallel and Distributed Computing Las Vegas, NV 17
Nov. 15-20 ASME, Parallel Computing Anaheim, CA 09
Nov. 18-20 50th Anniversary Applied Math ETH Zuerich, Switzerland 29
Nov. 30... Complex Systems Sydney, Australia 12
Dec. 4- 5 Southern Symposium on Computation Hattiesburg, MS 24
Dec. 6- 9 Modelling and Simulation Hamilton, New Zealand 19
Dec. 7-11 Scientific Computing Hong Kong 10
Dec. 14-16 Scientific and Engineering Computing Pune, India 29
Dec. 15-18 Nonlinear Programming Hong Kong 43
Dec. 16 Honor Dave Sloan Strathclyde, UK 12
Dec. 19-21 Operations Research Agra, India 09
1999
Jan. 8- 9 Conference for Bob Plemmons Winston-Salem, NC 02
Jan. 11-15 Independent Component Signal Analysis Aussois, France 16
Jan. 21-23 Applied Linear Algebra Bielefeld, Germany 23
Feb. 28-Mar. 2 Approximation and Complexity University of Florida 23
Mar. 22-26 Numerical Analysis Workshop Havana, Cuba 27
Apr. 15-20 Scattered Data Fitting Puerto Vallarta, Mex. 06
May 7- 9 Optimization in Computational Chemistry Princeton, NJ 27
May 10-14 Theoretical and Computational Acoustics Trieste, Italy 01
May 24-28 Applications of Dynamical Systems Snowbird, UT 23
June 2- 6 Large-Scale Scientific Computation Sozopol, Bulgaria 21
June 7- 9 Operational Research In Motion Windsor, Ontario 29
June 7-11 Monte Carlo Methods Varna, Bulgaria 22
June 14-18 Householder Symposium Whistler B.C., Canada 49
June 29-July 2 Numerical Analysis Dundee, Scotland 49
July 1- 7 Curves and Surfaces Saint-Malo, France 15
July 12-16 System Modelling and Optimization Cambridge, UK 04
July 18-28 Foundations of Computational Mathematics Oxford, UK 21
July 26-30 Numerical Mathematics and Applications Jyvaskyla, Finland 21
------------------------------
From: Heike Fassbender <heike@math.Uni-Bremen.DE>
Date: Sun, 16 Aug 1998 14:27:57 +0200 (MET DST)
Subject: Pat Eberlein
We have very sad news to share.
Pat Eberlein died on Tuesday, Aug 11, at her home in Buffalo.
She was surrounded by many of her children and her grandchildren.
She did not suffer long; despite being on oxygen for the last
two weeks, she went to dinner with friends at a Thai restaurant
just this past Friday, and to a movie on Saturday!
Any condolence to her family send to nil.mackey@wmich.edu will
be forwarded to Pat's family. If desired, remembrances may be
made to a charity fund that has been set up. We will be posting
a more extensive obituary and details on the charity fund shortly.
Nil Mackey and Heike Fassbender
------------------------------
From: Allison Bogardo <bogardo@siam.org>
Date: Thu, 13 Aug 98 13:14:08 -0500
Subject: SIAM Activity Group on Optimization Prize
Call for Nominations
SIAM Activity Group on Optimization Prize
The SIAM Activity Group on Optimization Prize (SIAG/OPT) will be
awarded at the Sixth SIAM Conference on Optimization to be held
in Atlanta, May 10-12, 1999.
The prize is awarded to the author(s) of the most outstanding
paper, as determined by the prize committee, on a topic in
optimization published in English in a peer-reviewed journal.
Eligibility
Candidate papers must be published in English in a peer-reviewed
journal bearing a publication date within the period January 1,
1995 to December 31, 1998. The paper must contain significant
research contributions to the field of optimization, as commonly
defined in the mathematical literature, with direct or potential
applications.
Description of the Award
The award will consist of a plaque and a certificate. The chair
of the prize committee will notify the recipient(s) of the award
in advance of the award date. An invitation will be extended to
the recipient(s) to attend the award ceremony to receive the award
and to present the paper. At least one of the awardees is expected
to attend the ceremony and present the winning paper.
Nominations
Nominations, which should consist of a copy of the paper and a
cover letter, must be received in the SIAM Office by JANUARY 15,
1999. Please send nominations to:
SIAG/OPT Prize Selection Committee c/o
c/o Allison Bogardo
SIAM
3600 University City Science Center
Philadelphia, PA 19104-2688
Fax: 215-386-7999
Telephone: 215-382-9800, Ext. 302
E-mail: bogardo@siam.org
Members of the selection committee are John Birge (University of
Michigan), Roger Fletcher (University of Dundee), Jan Karel
Lenstra (Technical University of Eindhoven), Stephen M. Robinson
(University of Wisconsin), and Stephen J. Wright, chair (Argonne
National Laboratory).
------------------------------
From: David H Bailey <dhb@nersc.gov>
Date: Sat, 15 Aug 1998 12:08:55 -0700
Subject: Parallel Symbolic Workshop
Workshop on Parallel Symbolic Computation
hosted by
the Mathematical Sciences Research Institute (MSRI)
and the Lawrence Berkeley National Laboratory (NERSC Division)
Berkeley, California, USA
October 1-3, 1998
A workshop on parallel symbolic computation will be held October 1-3
at MSRI, which is near the campus of the University of California,
Berkeley, CA, USA. Participants will include mathematicians, computer
scientists and scientific users of symbolic computing tools.
This workshop is inspired by the rapidly increasing requirements for
symbolic computing tools by scientists, and the recognition that
computing platforms, from desktop systems to supercomputers, are
rapidly moving to parallel designs. It is a common experience of many
users of symbolic computing software that some of these computations
can take enormous amounts of run time. Thus symbolic computing is
definitely an area that could benefit from the potential of highly
parallel computing. On the other hand, the field of high performance
computing stands to benefit from the unique perspective of symbolic
computing, with its distinctive algorithms, sophisticated data
structures and advanced user interfaces. This meeting will promote
the needed cross-fertilization between these disciplines.
If you are interested in attending this workshop, please see
http://www.msri.org/activities/programs/9899/symbcomp/parallelsc/
or send email to parallelsc@msri.org.
Some additional slots are available for speakers, and some travel
support is available. If you are interested in participating as a
speaker, contact the program committee directly.
Program Committee:
David H Bailey NERSC, Lawrence Berkeley Laboratory; Berkeley, CA, USA
dhb@nersc.gov
Daniel R Grayson University of Illinois, Urbana-Champaign; Urbana, IL, USA
dan@math.uiuc.edu
Alyson Reeves Center for Computing Sciences; Bowie, MD, USA
reeves@super.org
Nobuki Takayama Kobe University; Kobe, Japan
taka@math.s.kobe-u.ac.jp
David H. Bailey "Computo ergo sum."
NERSC, Lawrence Berkeley Lab. T: 510-495-2773 (MWF)
Mail Stop 50B-2239 T: 408-255-2264 (TTh)
Berkeley, CA 94720 E: dhb@nersc.gov
------------------------------
From: Michal Kocvara <kocvara@fauam1e.am.uni-erlangen.de>
Date: Wed, 12 Aug 98 14:17:26 CEST
Subject: New Book, Nonsmooth Approach to Optimization Problems
We would like to announce a new book
Nonsmooth Approach to Optimization Problems with
Equilibrium Constraints.
Theory, Applications and Numerical Results.
Jiri Outrata, Michal Kocvara and Jochem Zowe
This book presents an in-depth study and a solution technique for an
important class of optimization problems. This class is characterized
by special constraints: parameter-dependent convex programs,
variational inequalities or complementarity problems. All these
so-called equilibrium constraints are mostly treated in a convenient
form of generalized equations. The book begins with a chapter on
auxiliary results followed by a description of main numerical tools: a
bundle method of nonsmooth optimization and a nonsmooth variant of
Newton's method. Following this, stability and sensitivity theory for
generalized equations is presented, based on the concept of strong
regularity. This enables to apply the generalized differential
calculus for Lipschitz maps to derive optimality conditions and to
arrive at a solution method. A large part of the book focuses on
applications coming from continuum mechanics and mathematical
economy. A series of nonacademic problems is introduced and analyzed in
detail. Each problem is accompanied with examples that show the
efficiency of the solution method.
This book is addressed to applied mathematicians and engineers
working in continuum mechanics, operations research and economic
modelling. Students interested in optimization will find the book
useful as well.
For further information go to
http://www.wkap.nl/book.htm/0-7923-5170-3
------------------------------
From: Francoise Chatelin <Francoise.Chatelin@cerfacs.fr>
Date: Tue, 11 Aug 1998 19:05:25 +0200 (MET DST)
Subject: Postdoctoral Position at CERFACS
URGENT : Post-doc position at CERFACS / Qualitative Computing Group
A one year post-doc research position is open at CERFACS in the
Qualitative Computing Group lead by Prof. Chaitin-Chatelin. The
main research activities in this Group are:
- study of the stability and the reliability of numerical methods,
specifically in the neighbourhood of singularities,
- design of robust codes for computing some eigenelements of very large
and nonnormal matrices (Arnoldi Tchebycheff method),
- influence of high nonnormality on reliability of numerical methods,
- software tools for assessing the quality (reliability, robustness) of
numerical methods.
This Group is part of the Parallel Algorithms Project lead by Iain Duff.
The successful candidate is expected to have strong interest, background
and experience in scientific computing, numerical analysis and possibly
functional analysis. He/she is expected to interact strongly with the other
members of the Group. Starting date is October 1, 1998, at the latest.
For detailed information about CERFACS
URL address : http://www.cerfacs.fr/algor
For more information about Toulouse, the city where CERFACS is located
URL address : http://www.mairie-toulouse.fr/accueilU.htm
The CERFACS recruitment procedure is described at the URL address:
http://www.cerfacs.fr/admin/rules.html
Send the application to Mme Campassens at CERFACS. For any scientific
question regarding this position, please send email to
Prof. Chaitin-Chatelin (chatelin@cerfacs.fr).
------------------------------
From: David Keyes <keyes@cs.odu.edu>
Date: Tue, 11 Aug 1998 17:10:47 -0400 (EDT)
Subject: Positions at Old Dominion University
Faculty, Post-doctoral, and Graduate Fellowship Openings
in High-performance Computing and Communications
at Old Dominion University
Three faculty positions, two post-doctoral research positions, and two
doctoral fellowships are available in a steadily growing group of HPCC
researchers in the Computer Science Department at Old Dominion University,
Norfolk, VA. The department has strong ties to the Institute for Computer
Applications in Science and Engineering (ICASE) at the nearby NASA Langley
Research Center, and growing links to DOE's nearby Thomas Jefferson
National Accelerator Facility (TJNAF). The department hosts an NSF
Multidisciplinary Computing Challenges center, a DOE ASCI Level-2 center,
and a Department of Education "Graduate Assistantships in Areas of
National Need" (GAANN) program.
The faculty positions are tenure-track at the assistant professor level in
any area of HPCC, with starting dates as early as January 1999. Formal
position announcements are in preparation.
The post-doctoral research associate positions are in the following areas:
(1) parallel multilevel and domain decomposition methods, and (2)
organizing PDE computations for efficient performance on distributed and
multilevel memory hierarchies, and are available as of October 1998. U.S.
citizenship or permanent residency is preferred for these positions.
The doctoral fellowships are tenable in any area of HPCC and available for
immediate or January 1999 starts. The GAANN fellowship packages include
attractive stipends and funds for books and research travel. U.S.
citizenship or permanent residency is required. (Non-U.S. doctoral degree
seekers with HPCC interests are also welcomed in the regular admissions
process.)
Interested candidates are encouraged to contact Professors David Keyes,
Kurt Maly, or Alex Pothen at {keyes,maly,pothen}@cs.odu.edu for further
information.
------------------------------
From: Jack Dongarra <dongarra@cs.utk.edu>
Date: Fri, 14 Aug 1998 07:13:51 -0400
Subject: Research Position at the University of Tennessee
Research Position available at The University of Tennessee in
High-Performance Distributed Computing
Applications are invited for a postdoctoral research position in
high-performance distributed computing at the Innovative Computing
Laboratory of the University of Tennessee. The candidate selected will
help lead collaborative research projects investigating innovative
software systems and tools for building computational grids and problem
solving environments. The initial focus will be on NetSolve (see
http://www.cs.utk.edu/netsolve/ ) and associated technologies.
The position requires experience in the development of parallel and
distributed computing tools, especially in C, Java, and Fortran.
Familiarity with scientific computing, parallel architectures, and
emerging network technologies is also desired. Responsibilities as a
participant in the research team include designing, prototyping,
testing, maintaining, and documenting computer systems related to these
network computing projects.
Among the benefits of the position are a competitive salary, travel
opportunities, access to state-of-the-art computational facilities
(including parallel architectures, high-performance workstations, and
high-performance networks), and opportunities to participate in leading
research collaborations in advanced scientific computing involving an
international community.
Inquiries should be directed to dongarra@cs.utk.edu
------------------------------
From: Thomas Hogan <hogan@math.ohio-state.edu>
Date: Tue, 11 Aug 1998 17:29:36 -0400 (EDT)
Subject: Contents, Journal of Approximation Theory
Table of Contents: J. Approx. Theory, Volume 94, Number 1, July 1998
Paul Erd\H{o}s (1913--1996)
1--41
Vadim I. Filippov
On the completeness and other properties of some function systems in
$L_p$, $0<p<\infty$
42--53
F. S. De Blasi and J. Myjak
On a generalized best approximation problem
54--72
Alexei Zhedanov
On some classes of polynomials orthogonal on arcs of the unit circle
connected with symmetric orthogonal polynomials on an interval
73--106
F. Marcell\'an and I. A. Rocha
Complex path integral representation for semiclassical linear
functionals
107--127
R. W. Barnard, G. Dahlquist, K. Pearce, L. Reichel, and K. C. Richards
Gram polynomials and the Kummer function
128--143
F. J. Mu\~noz-Delgado, V. Ram\'\=ED{r}ez-Gonz\'alez, and D. C\'ardenas-Mo=
rales
Qualitative Korovkin-type results on conservative approximation
144--159
Shunsheng Guo, Cuixiang Li, Yiguo Sun, Ge Yang, and Shujie Yue
Pointwise estimate for Szasz-type operators
160--171
Table of Contents: J. Approx. Theory, Volume 94, Number 2, August 1998
Luca Brandolini
Imbedding theorems for Lipschitz spaces generated by the weak-$L^p$
metric
173--190
M. A. Skopina
Local convergence of Fourier series with respect to periodized wavelets
191--202
Jean-Paul Penot
Proximal mappings
203--221
Douglas Bridges and Wang Yuchuan
Constructing best approximations on a Jordan curve
222--234
S. B. Damelin
The Lebesgue function and Lebesgue constant of Lagrange interpolation
for Erd\H{o}s weights
235--262
S. Fridli and F. Schipp
Strong approximation via Sidon type inequalities
263--284
Sen-Yen Shaw
Non-optimal rates of ergodic limits and approximate solutions
285--299
Vilmos Totik
Counterexample to a problem on tensor product approximation
300--305
Yasuo Kageyama
Generalization of the left Bernstein quasi-interpolants
306--329
------------------------------
End of NA Digest
**************************
-------
Date: Mon 07/06/1998 21:30:54.15
Subject: NA Digest Calendar
The Netlib Conferences Database is on the Web at:
http://www.netlib.org/confdb/Conferences.html
NA Digest Calendar
Date Topic Place NA Digest #
Aug. 18-27 International Congress of Mathematicians Berlin, Germany 14
Aug. 18-27 ICM98 Session on Mathematical Software Berlin, Germany 97:27
Aug. 18-27 VideoMath Festival Berlin, Germany 52
Aug. 19-23 Numerical Methods and Applications Sofia, Bulgaria 13
Aug. 19-23 Incompressible Visous Flow Sofia, Bulgaria 07
Aug. 24-26 European Symposium on Algorithms Venice, Italy 06
Aug. 24-26 Hydroinformatics Copenhagen, Denmark 97:25
Aug. 24-27 Computational Mechanics Miskolc, Hungary 03
Aug. 31... Mathematics of Surfaces Birmingham, UK 15
Aug. 31... IFIP World Computer Congress Vienna and Budapest 96:46
Sep. 1- 3 Dynamics, Monitoring and Control Manchester, UK 21
Sep. 1- 4 Parallel Computing Southampton, UK 47
Sep. 1- 4 Numerical Methods inParallel Computing Southampton, UK 48
Sep. 1- 5 Solid Mechanics Zakopane, Poland 37
Sep. 2- 4 Computational Methods in Engineering Ghent, Belgium 34
Sep. 2- 5 Computational Physics Granada, Spain 05
Sep. 7- 9 Control and Data Processing Prague, Czech Republic 39
Sep. 7-12 PDE Meeting in the Sun Mission Beach, Austral.11
Sep. 7-14 Analytic Number Theory and Space Tilings Kyiv, Ukraine 11
Sep. 14-16 Software Tools for Scientific Computing Oslo, Norway 49
Sep. 14-18 Partial Differential Equations Marrakech, Morocco 97:20
Sep. 22-25 Validated Numerics Budapest, Hungary 25
Sep. 23-25 Dutch Numerical Mathematicians Woudschoten, N'lands 17
Sep. 24-25 SYNAPSE*3 Matrix, Neurocomputer Clausthal-Zellerfeld, Germany 27
Sep. 24-26 Computer Mathematics Athens, Greece 04
Sep. 28-30 Iterative Methods for Elasticity Nijmegen, Netherlands 17
Sep. 30... Computing in Electrical Engineering Berlin, Germany 25
Sep. 30... Operational Research Rovinj, Croatia 10
Oct. 1- 3 Parallel Symbolic Workshop Berkeley, CA 30
Oct. 1- 3 Industrial Flow Problems Barcelona, Spain 08
Oct. 4- 9 School on Wavelets in the Geosciences Delft, Netherlands 22
Oct. 5- 8 Multigrid Methods Bonn, Germany 12
Oct. 7-11 Operator Theory Winnipeg, Canada 05
Oct. 8-10 Randomization and Approximation Barcelona, Spain 23
Oct. 14-16 Simulation of Devices and Technologies Cape Town, So. Africa 11
Oct. 14-17 Mathematical Physics Knoxville, TN 48
Oct. 18-20 Iterative Methods Austin, TX 25
Oct. 20-23 SIBGRAPI'98 Rio de Janeiro, Brazil 13
Oct. 21-23 Object Oriented Methods Yorktown Heights NY 21
Oct. 22-23 Mathematical Foundations for CAD Troy, MI 13
Oct. 25-28 Operations Research Seattle, WA 11
Oct. 26-28 Circuits, Systems and Computers Piraeus, Greece 97:20
Oct. 26-29 Air Pollution Modelling Paris, France 48
Oct. 27-29 Continuum Mechanics Rostov-on-Don, Russia 28
Oct. 28-31 Parallel and Distributed Computing Las Vegas, NV 17
Nov. 15-20 ASME, Parallel Computing Anaheim, CA 09
Nov. 18-20 50th Anniversary Applied Math ETH Zuerich, Switzerland 29
Nov. 30... Complex Systems Sydney, Australia 12
Dec. 4- 5 Southern Symposium on Computation Hattiesburg, MS 24
Dec. 6- 9 Modelling and Simulation Hamilton, New Zealand 19
Dec. 7-11 Scientific Computing Hong Kong 10
Dec. 14-16 Scientific and Engineering Computing Pune, India 29
Dec. 15-18 Nonlinear Programming Hong Kong 43
Dec. 16 Honor Dave Sloan Strathclyde, UK 12
Dec. 19-21 Operations Research Agra, India 09
1999
Jan. 8- 9 Conference for Bob Plemmons Winston-Salem, NC 02
Jan. 11-15 Independent Component Signal Analysis Aussois, France 16
Jan. 21-23 Applied Linear Algebra Bielefeld, Germany 23
Feb. 28-Mar. 2 Approximation and Complexity University of Florida 23
Mar. 22-26 Numerical Analysis Workshop Havana, Cuba 27
Apr. 15-20 Scattered Data Fitting Puerto Vallarta, Mex. 06
May 7- 9 Optimization in Computational Chemistry Princeton, NJ 27
May 10-14 Theoretical and Computational Acoustics Trieste, Italy 01
May 24-28 Applications of Dynamical Systems Snowbird, UT 23
June 2- 6 Large-Scale Scientific Computation Sozopol, Bulgaria 21
June 7- 9 Operational Research In Motion Windsor, Ontario 29
June 7-11 Monte Carlo Methods Varna, Bulgaria 22
June 14-18 Householder Symposium Whistler B.C., Canada 49
June 29-July 2 Numerical Analysis Dundee, Scotland 49
July 1- 7 Curves and Surfaces Saint-Malo, France 15
July 12-16 System Modelling and Optimization Cambridge, UK 04
July 18-28 Foundations of Computational Mathematics Oxford, UK 21
July 26-30 Numerical Mathematics and Applications Jyvaskyla, Finland 21
From: Heike Fassbender <heike@math.Uni-Bremen.DE>
Date: Sun, 16 Aug 1998 14:27:57 +0200 (MET DST)
Subject: Pat Eberlein
We have very sad news to share.
Pat Eberlein died on Tuesday, Aug 11, at her home in Buffalo.
She was surrounded by many of her children and her grandchildren.
She did not suffer long; despite being on oxygen for the last
two weeks, she went to dinner with friends at a Thai restaurant
just this past Friday, and to a movie on Saturday!
Any condolence to her family send to nil.mackey@wmich.edu will
be forwarded to Pat's family. If desired, remembrances may be
made to a charity fund that has been set up. We will be posting
a more extensive obituary and details on the charity fund shortly.
Nil Mackey and Heike Fassbender
------------------------------
From: Allison Bogardo <bogardo@siam.org>
Date: Thu, 13 Aug 98 13:14:08 -0500
Subject: SIAM Activity Group on Optimization Prize
Call for Nominations
SIAM Activity Group on Optimization Prize
The SIAM Activity Group on Optimization Prize (SIAG/OPT) will be
awarded at the Sixth SIAM Conference on Optimization to be held
in Atlanta, May 10-12, 1999.
The prize is awarded to the author(s) of the most outstanding
paper, as determined by the prize committee, on a topic in
optimization published in English in a peer-reviewed journal.
Eligibility
Candidate papers must be published in English in a peer-reviewed
journal bearing a publication date within the period January 1,
1995 to December 31, 1998. The paper must contain significant
research contributions to the field of optimization, as commonly
defined in the mathematical literature, with direct or potential
applications.
Description of the Award
The award will consist of a plaque and a certificate. The chair
of the prize committee will notify the recipient(s) of the award
in advance of the award date. An invitation will be extended to
the recipient(s) to attend the award ceremony to receive the award
and to present the paper. At least one of the awardees is expected
to attend the ceremony and present the winning paper.
Nominations
Nominations, which should consist of a copy of the paper and a
cover letter, must be received in the SIAM Office by JANUARY 15,
1999. Please send nominations to:
SIAG/OPT Prize Selection Committee c/o
c/o Allison Bogardo
SIAM
3600 University City Science Center
Philadelphia, PA 19104-2688
Fax: 215-386-7999
Telephone: 215-382-9800, Ext. 302
E-mail: bogardo@siam.org
Members of the selection committee are John Birge (University of
Michigan), Roger Fletcher (University of Dundee), Jan Karel
Lenstra (Technical University of Eindhoven), Stephen M. Robinson
(University of Wisconsin), and Stephen J. Wright, chair (Argonne
National Laboratory).
------------------------------
From: David H Bailey <dhb@nersc.gov>
Date: Sat, 15 Aug 1998 12:08:55 -0700
Subject: Parallel Symbolic Workshop
Workshop on Parallel Symbolic Computation
hosted by
the Mathematical Sciences Research Institute (MSRI)
and the Lawrence Berkeley National Laboratory (NERSC Division)
Berkeley, California, USA
October 1-3, 1998
A workshop on parallel symbolic computation will be held October 1-3
at MSRI, which is near the campus of the University of California,
Berkeley, CA, USA. Participants will include mathematicians, computer
scientists and scientific users of symbolic computing tools.
This workshop is inspired by the rapidly increasing requirements for
symbolic computing tools by scientists, and the recognition that
computing platforms, from desktop systems to supercomputers, are
rapidly moving to parallel designs. It is a common experience of many
users of symbolic computing software that some of these computations
can take enormous amounts of run time. Thus symbolic computing is
definitely an area that could benefit from the potential of highly
parallel computing. On the other hand, the field of high performance
computing stands to benefit from the unique perspective of symbolic
computing, with its distinctive algorithms, sophisticated data
structures and advanced user interfaces. This meeting will promote
the needed cross-fertilization between these disciplines.
If you are interested in attending this workshop, please see
http://www.msri.org/activities/programs/9899/symbcomp/parallelsc/
or send email to parallelsc@msri.org.
Some additional slots are available for speakers, and some travel
support is available. If you are interested in participating as a
speaker, contact the program committee directly.
Program Committee:
David H Bailey NERSC, Lawrence Berkeley Laboratory; Berkeley, CA, USA
dhb@nersc.gov
Daniel R Grayson University of Illinois, Urbana-Champaign; Urbana, IL, USA
dan@math.uiuc.edu
Alyson Reeves Center for Computing Sciences; Bowie, MD, USA
reeves@super.org
Nobuki Takayama Kobe University; Kobe, Japan
taka@math.s.kobe-u.ac.jp
David H. Bailey "Computo ergo sum."
NERSC, Lawrence Berkeley Lab. T: 510-495-2773 (MWF)
Mail Stop 50B-2239 T: 408-255-2264 (TTh)
Berkeley, CA 94720 E: dhb@nersc.gov
------------------------------
From: Michal Kocvara <kocvara@fauam1e.am.uni-erlangen.de>
Date: Wed, 12 Aug 98 14:17:26 CEST
Subject: New Book, Nonsmooth Approach to Optimization Problems
We would like to announce a new book
Nonsmooth Approach to Optimization Problems with
Equilibrium Constraints.
Theory, Applications and Numerical Results.
Jiri Outrata, Michal Kocvara and Jochem Zowe
This book presents an in-depth study and a solution technique for an
important class of optimization problems. This class is characterized
by special constraints: parameter-dependent convex programs,
variational inequalities or complementarity problems. All these
so-called equilibrium constraints are mostly treated in a convenient
form of generalized equations. The book begins with a chapter on
auxiliary results followed by a description of main numerical tools: a
bundle method of nonsmooth optimization and a nonsmooth variant of
Newton's method. Following this, stability and sensitivity theory for
generalized equations is presented, based on the concept of strong
regularity. This enables to apply the generalized differential
calculus for Lipschitz maps to derive optimality conditions and to
arrive at a solution method. A large part of the book focuses on
applications coming from continuum mechanics and mathematical
economy. A series of nonacademic problems is introduced and analyzed in
detail. Each problem is accompanied with examples that show the
efficiency of the solution method.
This book is addressed to applied mathematicians and engineers
working in continuum mechanics, operations research and economic
modelling. Students interested in optimization will find the book
useful as well.
For further information go to
http://www.wkap.nl/book.htm/0-7923-5170-3
------------------------------
From: Francoise Chatelin <Francoise.Chatelin@cerfacs.fr>
Date: Tue, 11 Aug 1998 19:05:25 +0200 (MET DST)
Subject: Postdoctoral Position at CERFACS
URGENT : Post-doc position at CERFACS / Qualitative Computing Group
A one year post-doc research position is open at CERFACS in the
Qualitative Computing Group lead by Prof. Chaitin-Chatelin. The
main research activities in this Group are:
- study of the stability and the reliability of numerical methods,
specifically in the neighbourhood of singularities,
- design of robust codes for computing some eigenelements of very large
and nonnormal matrices (Arnoldi Tchebycheff method),
- influence of high nonnormality on reliability of numerical methods,
- software tools for assessing the quality (reliability, robustness) of
numerical methods.
This Group is part of the Parallel Algorithms Project lead by Iain Duff.
The successful candidate is expected to have strong interest, background
and experience in scientific computing, numerical analysis and possibly
functional analysis. He/she is expected to interact strongly with the other
members of the Group. Starting date is October 1, 1998, at the latest.
For detailed information about CERFACS
URL address : http://www.cerfacs.fr/algor
For more information about Toulouse, the city where CERFACS is located
URL address : http://www.mairie-toulouse.fr/accueilU.htm
The CERFACS recruitment procedure is described at the URL address:
http://www.cerfacs.fr/admin/rules.html
Send the application to Mme Campassens at CERFACS. For any scientific
question regarding this position, please send email to
Prof. Chaitin-Chatelin (chatelin@cerfacs.fr).
------------------------------
From: David Keyes <keyes@cs.odu.edu>
Date: Tue, 11 Aug 1998 17:10:47 -0400 (EDT)
Subject: Positions at Old Dominion University
Faculty, Post-doctoral, and Graduate Fellowship Openings
in High-performance Computing and Communications
at Old Dominion University
Three faculty positions, two post-doctoral research positions, and two
doctoral fellowships are available in a steadily growing group of HPCC
researchers in the Computer Science Department at Old Dominion University,
Norfolk, VA. The department has strong ties to the Institute for Computer
Applications in Science and Engineering (ICASE) at the nearby NASA Langley
Research Center, and growing links to DOE's nearby Thomas Jefferson
National Accelerator Facility (TJNAF). The department hosts an NSF
Multidisciplinary Computing Challenges center, a DOE ASCI Level-2 center,
and a Department of Education "Graduate Assistantships in Areas of
National Need" (GAANN) program.
The faculty positions are tenure-track at the assistant professor level in
any area of HPCC, with starting dates as early as January 1999. Formal
position announcements are in preparation.
The post-doctoral research associate positions are in the following areas:
(1) parallel multilevel and domain decomposition methods, and (2)
organizing PDE computations for efficient performance on distributed and
multilevel memory hierarchies, and are available as of October 1998. U.S.
citizenship or permanent residency is preferred for these positions.
The doctoral fellowships are tenable in any area of HPCC and available for
immediate or January 1999 starts. The GAANN fellowship packages include
attractive stipends and funds for books and research travel. U.S.
citizenship or permanent residency is required. (Non-U.S. doctoral degree
seekers with HPCC interests are also welcomed in the regular admissions
process.)
Interested candidates are encouraged to contact Professors David Keyes,
Kurt Maly, or Alex Pothen at {keyes,maly,pothen}@cs.odu.edu for further
information.
------------------------------
From: Jack Dongarra <dongarra@cs.utk.edu>
Date: Fri, 14 Aug 1998 07:13:51 -0400
Subject: Research Position at the University of Tennessee
Research Position available at The University of Tennessee in
High-Performance Distributed Computing
Applications are invited for a postdoctoral research position in
high-performance distributed computing at the Innovative Computing
Laboratory of the University of Tennessee. The candidate selected will
help lead collaborative research projects investigating innovative
software systems and tools for building computational grids and problem
solving environments. The initial focus will be on NetSolve (see
http://www.cs.utk.edu/netsolve/ ) and associated technologies.
The position requires experience in the development of parallel and
distributed computing tools, especially in C, Java, and Fortran.
Familiarity with scientific computing, parallel architectures, and
emerging network technologies is also desired. Responsibilities as a
participant in the research team include designing, prototyping,
testing, maintaining, and documenting computer systems related to these
network computing projects.
Among the benefits of the position are a competitive salary, travel
opportunities, access to state-of-the-art computational facilities
(including parallel architectures, high-performance workstations, and
high-performance networks), and opportunities to participate in leading
research collaborations in advanced scientific computing involving an
international community.
Inquiries should be directed to dongarra@cs.utk.edu
------------------------------
From: Thomas Hogan <hogan@math.ohio-state.edu>
Date: Tue, 11 Aug 1998 17:29:36 -0400 (EDT)
Subject: Contents, Journal of Approximation Theory
Table of Contents: J. Approx. Theory, Volume 94, Number 1, July 1998
Paul Erd\H{o}s (1913--1996)
1--41
Vadim I. Filippov
On the completeness and other properties of some function systems in
$L_p$, $0<p<\infty$
42--53
F. S. De Blasi and J. Myjak
On a generalized best approximation problem
54--72
Alexei Zhedanov
On some classes of polynomials orthogonal on arcs of the unit circle
connected with symmetric orthogonal polynomials on an interval
73--106
F. Marcell\'an and I. A. Rocha
Complex path integral representation for semiclassical linear
functionals
107--127
R. W. Barnard, G. Dahlquist, K. Pearce, L. Reichel, and K. C. Richards
Gram polynomials and the Kummer function
128--143
F. J. Mu\~noz-Delgado, V. Ram\'\=ED{r}ez-Gonz\'alez, and D. C\'ardenas-Mo=
rales
Qualitative Korovkin-type results on conservative approximation
144--159
Shunsheng Guo, Cuixiang Li, Yiguo Sun, Ge Yang, and Shujie Yue
Pointwise estimate for Szasz-type operators
160--171
Table of Contents: J. Approx. Theory, Volume 94, Number 2, August 1998
Luca Brandolini
Imbedding theorems for Lipschitz spaces generated by the weak-$L^p$
metric
173--190
M. A. Skopina
Local convergence of Fourier series with respect to periodized wavelets
191--202
Jean-Paul Penot
Proximal mappings
203--221
Douglas Bridges and Wang Yuchuan
Constructing best approximations on a Jordan curve
222--234
S. B. Damelin
The Lebesgue function and Lebesgue constant of Lagrange interpolation
for Erd\H{o}s weights
235--262
S. Fridli and F. Schipp
Strong approximation via Sidon type inequalities
263--284
Sen-Yen Shaw
Non-optimal rates of ergodic limits and approximate solutions
285--299
Vilmos Totik
Counterexample to a problem on tensor product approximation
300--305
Yasuo Kageyama
Generalization of the left Bernstein quasi-interpolants
306--329
------------------------------
End of NA Digest
**************************
-------