NA Digest Sunday, November 4, 2001 Volume 01 : Issue 41

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

Submissions for NA Digest:

Mail to na.digest@na-net.ornl.gov.

Information via e-mail about NA-NET: Mail to na.help@na-net.ornl.gov.

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

From: Fred Fritsch <fritsch@oldben.llnl.gov>
Date: Wed, 31 Oct 2001 16:58:45 -0800 (PST)
Subject: Donating a Journal Collection

I will be retiring the end of November and am looking for a home for
nearly complete collections of computing and mathematics journals I have
accumulated over the years.
Communications of the ACM, 1964-date
SIAM Journal on Numerical Analysis, 1964-1985
SIAM Journal on Scientific Computation, 1986-1995

There are a total of ten boxes of journals which I would like to share
with some college or library who could use them. Please let me know.

Fred N. Fritsch Commercial: (925)422-4275
Computer Applications Org., ICF Group Fax: (925)423-9969
Lawrence Livermore National Laboratory
P. O. Box 808 (L-31) e-mail: fnf@llnl.gov
Livermore, CA 94551-9900 (or) na.fritsch@na-net.ornl.gov

After 30 November 2001:
Dr. Fred N. Fritsch Phone: (925)447-2905
1381 Darwin Avenue
Livermore, CA 94550-6040 e-mail: fritschn@pacbell.net


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

From: Allison Bogardo <bogardo@siam.org>
Date: Wed, 31 Oct 2001 08:43:06 -0500
Subject: Nominations for George Polya Prize

CALL FOR NOMINATIONS
for
GEORGE POLYA PRIZE



The Polya Prize

The award will be presented at the SIAM 50th Anniversary Meeting in
Philadelphia, July 8-12, 2002. The award honors the memory of George
Polya and is given in even-numbered years for notable contributions
in two alternating categories. The 2000 Prize was given in
combinatorics. The 2002 Prize will be given for a notable
contribution in one of the following areas: approximation theory,
complex analysis, number theory, orthogonal polynomials,
probability theory, or mathematical discovery and learning.

Eligibility

There are no restrictions except that the prize is broadly intended to
recognize specific recent work.

Description of Award

The award will consist of an engraved medal and a $20,000 cash prize.
Travel expenses to the award ceremony will be provided by the prize
fund.

Nominations

A letter of nomination, including a description of achievement(s)
should be sent by December 1, 2001, to:

Professor Percy Deift
Chair, Selection Committee
George Polya Prize
c/o Allison Bogardo
Society for Industrial and Applied Mathematics
3600 University City Science Center
Philadelphia, PA 19104-2688
Telephone: 215-382-9800
Fax: 215-386-7999
E-mail: bogardo@siam.org


Selection Committee

Members of the selection committee are Percy Deift, Courant Institute
of Mathematical Sciences, New York University (chair); Ronald Graham,
University of California, San Diego; Andrew Odlyzko, University of
Minnesota; and Martin Gutknecht, ETH-Zurich, Switzerland.


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

From: Sara Triller <triller@siam.org>
Date: Thu, 01 Nov 2001 08:54:20 -0500
Subject: Ciarlet Text

Dear NA-Digest members,

Due to your generosity, SIAM now has sufficient copies of the Ciarlet
text, THE FINITE ELEMENT METHOD FOR ELLIPTIC PROBLEMS. For those of
you who are interested in purchasing a copy, the SIAM Classics version
of this book should publish some time in spring 2002.

Many thanks for your help,

Sara J. Triller
Developmental Editor, SIAM
triller@siam.org


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

From: Anshul Gupta <anshul@watson.ibm.com>
Date: Thu, 1 Nov 2001 11:48:24 -0500
Subject: Linear Programming in Watson Sparse Matrix Package

The Watson Sparse Matrix Package (WSMP) is a high-performance robust
direct solver for both symmetric and unsymmetric large sparse systems
of linear equations. Currently, it works in serial, multi-threaded
parallel, message-passing parallel, and a combination of message-passing
and multi-threaded modes on AIX. A Linux version is expected next year.

The symmetric solver has features to support barrier methods for solving
LP problems. For instance, it provides users a variety of options to
deal with small and negative pivots and the loss of rank.

We have recently added support in the unsymmetric solver that enables
it to be used in conjunction with the Simplex algorithm and other LP
techniques. This includes routines to factor a basis, update rows or
columns of a previously factored basis, obtain solutions with respect
to the latest updated basis and to obtain and refactor the current basis.

For more details, please visit http://www.cs.umn.edu/~agupta/wsmp.html
and send an e-mail to anshul@watson.ibm.com with "LINUX WSMP" in the
subject line if you wish to be notified when the Linux version becomes
available.


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

From: Nathalie Revol <nrevol@ens-lyon.fr>
Date: Fri, 2 Nov 2001 21:54:23 +0100 (MET)
Subject: Special Issue on Linear Algebra and Arithmetic

Following the conference ALA 2001 on Linear Algebra and Arithmetic:
Numerical, Symbolic and Parallel Computations, held in Rabat, Morocco,
in May 2001, the Journal of Computational and Applied Mathematics
has accepted to publish a special issue on the same topics. Scientists
interested in these and related topics are encouraged to submit a paper,
even if they did not attend the conference.

Journal of Computational and Applied Mathematics
Special issue on Linear Algebra and Arithmetic:
Numerical, Symbolic and Parallel Computations

Guest editors: S. El Hajji, N. Revol and P. Van Dooren.

TOPICS: computational linear algebra and arithmetic, with an emphasis on
numerical, symbolic and parallel aspects.
They include but are not restricted to the following list:
linear algebra, matrices normal forms, sparse matrices,
eigenvalues and eigenvectors problems, singular values problems,
least squares problems, linear algebra and control, numerical stability,
floating point arithmetic, interval arithmetic, computer algebra,
parallel algorithms, applications.

IMPORTANT DATES:
- deadline for submission: 30 November 2001
- notification of acceptance or rejection: 31 January 2002
- final version: 28 February 2002

For more information, in particular on how to submit, please consult
the CFP Web page:
http://www.ens-lyon.fr/LIP/Arenaire/ALA2001/ALA-JCAM2001


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

From: Daniela Calvetti <dxc57@lanczos.MATH.cwru.edu>
Date: Wed, 31 Oct 101 10:18:58 -0500 (EST)
Subject: Report from Conference Honoring Claude Brezinski

Numerical Algorithms 2001

The International Conference on Numerical Algorithms dedicated to Claude
Brezinski on the occasion of his 60th birthday took place in Marrakesh,
Morocco, October 1-5, 2001. The conference was attended by approximately 170
participants from 4 continents, and was characterized by a warm and friendly
atmosphere. The week-long meeting featured a wealth of high quality talks on
many diverse topics, from Pade' and rational approximation, orthogonal
polynomials, extrapolation methods, quadrature, the solution of large linear
or nonlinear systems of equations, inverse problems and optimization,
reflecting the multifaceted nature of Claude Brezinski's research interests
and scientific contributions. During his successful and productive career,
Claude Brezinski (co)authored eleven books, over 160 research papers, started
three scientific journals and served as a model and an inspirator for a large
number of students and colleagues. Many of Claude's students, it was pointed
out at the opening of the conference by the rector of the University of
Marrakesh, are from Morocco, and Claude's work with these students and
continued mentoring has been greatly beneficial to the growth of numerical
analysis in Morocco.

In addition to attending the lectures, the participants also had several
opportunities to experience the magic charm of Morocco thanks to a full
social program, which included mint tea in a palm orchard, dinner at an
outdoor restaurant with a traditional Moroccan show, an excursion to Essaouira
on the Atlantic coast, and a conference banquet complete two belly dancers
and reminiscences by Peter Graves-Morris on the topic ``My Conferences with
Claude.''

Claude's high level of energy and vitality permeated the whole conference and
was quite contagious. At the conference banquet he gave a presentation,
complete with slides, on ``What Really Happens at Conferences - and Never
Gets Reported in the NA-Digest.'' Needless to say, details of Claude's
talk cannot be revealed here.

The organizing committee, which included

B. Beckermann, A. Bentbib, B. Germain-Bonne, J.-P. Chehab,
M. El Alaoui-Talibi, A. Lembarki, M. Prevost, A. Matos, A. Messaoudi,
M. Redivo Zaglia, R. Sadaka, H. Sadok, and J. Van Iseghem

did an excellent job and the conference ran extremely smoothly in spite of
the many disruptions caused by the September 11 events. The members of
committee were very helpful also with practical algorithms, like offering
advice on what to eat and drink, how to negotiate a taxi fare and where and
how to buy local crafts.

Congratulations, Claude! You've got your transit papers.

Daniela Calvetti and Lothar Reichel


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

From: Shaun Forth <s.a.forth@rmcs.cranfield.ac.uk>
Date: Fri, 02 Nov 2001 09:12:01 +0000
Subject: Fortran 95 Course

May I bring to your attention the following course.

Fortran 95 for Fortran 77 Programmers: 3 - 5 December 2001

An intensive 3-day course for programmers experienced in Fortran 77, C
or other high level language, will be running 3 - 5 December 2001. The
course has run some 5 or 6 times in the last few years and always been
well received.

The course includes:
* Lectures Covering the Key Concepts
* Hands-On Programming Practicals to Assist in Understanding Concepts
and Learning Syntax
* Distinguished External Speakers heavily Involved in Design/Use Of
Fortran 95: John Reid (Fortran standardisation, numerical methods for
sparse matrices, automatic differentiation) and Sven Hammarling
(numerical linear algebra, high performance computing, portable
numerical software and associated standards).

For more details see

http://www.rmcs.cranfield.ac.uk/amorg

and follow link to `Short Courses' and then `Fortran 95 for Fortran 77
Programmers'
or telephone +44 (0) 1793 785316
or email: amor@rmcs.cranfield.ac.uk

Shaun Forth


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

From: Luc Wuytack <wuytack@uia.ua.ac.be>
Date: Mon, 29 Oct 2001 09:52:24 +0100 (MET)
Subject: International Congress on Computational and Applied Mathematics

Congress Announcement: ICCAM-2002
An International Congress on Computational and Applied Mathematics will be
organized on July 22-July 26, 2002 at the University of Leuven, Belgium.
The congress will bring together people working on the analysis and
application of computational techniques for solving real sctientific problems.
The list of invited speakers include: Budd Chris (U.K.), Bultheel Adhemar
(Belgium), Schulz Volker (Germany), Sommeijer Ben (The Netherlands), Sugihara
Masaaki (Japan), Van Dooren Paul (Belgium).
Short communications will be accepted for presentation. A short abstract
(at most 1 page) should be sent, before March 30, 2002 to:
Prof. M. Goovaerts, K.U. Leuven
CRIR, Minderbroederstraat 5, B-3000 Leuven (Belgium)
e-mail: Marc.Goovaerts@econ.kuleuven.ac.be
Several survey talks will be given covering different fields of numerical
analysis. The Proceedings will be published in the Journal on Computational and Applied Mathematics.
More information can found at:
http://www.cs.kuleuven.ac.be/conference/iccam2002/iccam.htm


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

From: S.H.M.J. Houben <houben@natlab.research.philips.com>
Date: Tue, 30 Oct 2001 14:03:05 +0100
Subject: Conference on Scientific Computing in Electrical Engineering

SCEE2002 -- Call for Papers
23-28 June 2002
Eindhoven, The Netherlands
http://www.win.tue.nl/scee2002

The 4th International Conference on Scientific Computing in Electrical
Engineering SCEE2002 will be organised from 23 to 28 June, 2002, in
Eindhoven, The Netherlands. This conference, which has been organised
twice before as a German conference and in 2000 as an international
conference, will again aim at an international audience. To stress this
fact, the conference will this year be organised in The Netherlands.
We aim to reach both mathematicians and electrical engineers,
both from industry and from the academic world.

The SCEE2002 conference will address the following topics:

* Computational electromagnetics
* Computational electrodynamics
* Circuit simulation
* Coupled problems

We have found several experts in the field willing to give a plenary lecture.

Prof. Dr. Susan C. Hagness
University of Wisconsin-Madison, USA
Dr. Patrick Joly
INRIA, Le Chesnay, France
Dr.-Ing. Ralph Schuhmann
TU Darmstadt, Germany
Prof. Dr. Weng Cho Chew
University of Illinois at Urbana-Champaign, USA
Dr.-Ing. habil. Peter Schwarz
Fraunhofer-Institut f=FCr Integrierte Schaltungen, Dresden, Germany
Dr. Tom A.M. Kevenaar
Philips Research Laboratories, Eindhoven, The Netherlands
Prof. Antonio Di Carlo
Universit=E0 degli Studi "Roma Tre", Italy

Apart from those lectures, we will have a number of contributed talks
and poster sessions. To stress that posters are of equal importance
as contributed talks, poster contributions are also eligible for the
"Best Paper Award". Poster contributions also have equal opportunities
to appear in the Proceedings; our review procedure makes no difference
between poster sessions and contributed talks in this respect.

Submissions for abstracts for oral and poster presentation are handled
through our web site: http://www.win.tue.nl/scee2002

To stress the importance of new computational methods for the industry,
a special Industry Day will be organised, in which people from industry
are asked to present to give their opinion on what research is needed in
the near future. Also, there will be presentations about successful
co-operations between industry and universities. In this way, we hope to
foster such co-operations and show that research is driven by
industrial needs.

Important dates:
* Deadline for submission of abstracts: January 31, 2002
* Notification of acceptance: March 15, 2002
* Deadline for early registration: June 15, 2002

We hope to meet you in Eindhoven!

The Local Organising Committee,

Prof. Dr. W.H.A. Schilders (Eindhoven Univ. of Technology, Philips
Research)
Dr. E.J.W. ter Maten (Philips Research)
S.H.M.J. Houben, M.Sc. (Eindhoven Univ. of Technology)

For more information, please contact:
S.H.M.J. Houben
phone: +31-40-2743497
mailto:stephanh@win.tue.nl


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

From: Marc Thiriet <thiriet@apron.inria.fr>
Date: Tue, 30 Oct 2001 17:36:23 +0100
Subject: Conference at Rocquencourt on Computer-aided Medicine and Surgery

MS4CMS02 - Conference announcement

A 1st symposium on
Modelling & Simulation for
Computer-aided Medecine and Surgery
MS4CMS'02
will be held
from November 12 to 15th, 2002.
at INRIA Rocquencourt
Domaine de Voluceau - Rocquencourt
B.P. 105
78153 Le Chesnay Cedex - France

The programme will be divided into 4 main themes:
D1 Tuesday 12/11: image and signal processing
D2 Wednesday 13/11: medical applications of computer graphics
and virtual reality
D3 Thursday 14/11: biomechanics applied to computed-assisted procedures
D4 Friday 15/11: robotics and system control

Informations on MS4CMS'02
can be obtained from our web site at:
http://conference.inria.fr/MS4CMS/MS4CMS02.html


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

From: ISSAC <Conference.Issac2002@lifl.fr>
Date: Wed, 31 Oct 2001 17:56:12 +0100 (MET)
Subject: International Symposium on Symbolic and Algebraic Computation

CALL FOR PAPERS
ISSAC 2002
International Symposium on Symbolic and Algebraic Computation
University of Lille I, France, July 7-10, 2002
http://www.lifl.fr/issac2002

ISSAC is the yearly premier international symposium in Symbolic and
Algebraic Computation. It provides an opportunity to learn of new
developments and to present original research results in all areas of
symbolic mathematical computation. Planned activities include invited
presentations, research and survey papers, poster sessions, tutorial
courses, vendor exhibits and software demonstrations.

ISSAC'2002 will be held at the University of Lille I.

Important Dates

- Deadline for Submissions: January 7, 2002
- Notification of Acceptance: February 28, 2002
- Camera-ready copy received: March 22, 2002

Conference Topics

Topics of the meeting include, but are not limited to :

- Algorithmic mathematics. Algebraic, symbolic and symbolic-numeric
algorithms. Simplification, function manipulation, equations,
summation, integration, ODE/PDE, linear algebra, number theory,
group and geometric computing.

- Computer Science. Theoretical and practical problems in symbolic
computation. Systems, problem solving environments, user interfaces,
softwares, libraries, parallel/distributed computing and programming
languages for symbolic computation, concrete analysis, benchmarking,
theoretical and practical complexity of computer algebra algorithms,
automatic differentiation, code generation, mathematical data
structures and exchange protocols.

- Applications. Problem treatments using algebraic, symbolic or
symbolic-numeric computation in an essential or a novel way.
Engineering, economics and finance, physical and biological
sciences, computer science, logic, mathematics, statistics,
education.

Original research results and insightful analyses of current concerns
are solicited for submission. Submissions must not substantially
duplicate work published or submitted for publication elsewhere. Late
submissions will be rejected.

Survey articles may be suitable for submission if identified as such,
they will be considered in a separate category from the research
papers. Papers will be reviewed by a program committee and additional
referees. Proceedings will be distributed at the symposium.

Electronic submission is encouraged. Please follow the ISSAC'2002
Electronic Submission Instructions at the web page :
http://www.lifl.fr/issac2002/callpaper.html

Best student author award.

This award will be given to the best student author. An author is
eligible if full-time student at the time of submission, this should
be indicated.

Conference Committee:

General Chair: Marc Giusti
Program Committee Chair: Luis Miguel Pardo Vasallo
Local Arrangements Chair: Marc Moreno Maza
Treasurer and Registration Chair: Nicole Dubois
Proceedings Editor: Teo Mora
Exhibits: Gr{\'e}goire Lecerf, Marc Moreno Maza, Renaud Rioboo
Publicity Chair and Webmaster: Fran{\c{c}}ois Lemaire

Program Committee:

Jacques Calmet Rob Corless
Erich Kaltofen Daniel Lazard
Teo Mora (Proceedings Editor) Fran{\c{c}}ois Ollivier
Luis Miguel Pardo (Chair) Bruno Salvy
Michael Singer Mike Stillman
Mark Van Hoeij Gilles Villard
Stephen Watt Volker Weispfenning
Jean-Claude Yakoubsohn


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

From: Eilish Hathaway <eilish@ipam.ucla.edu>
Date: Tue, 30 Oct 2001 15:27:25 -0800
Subject: Program at IPAM in Large Scale Communications Networks

Program in Large Scale Communications Networks at the Institute for Pure
and Applied Mathematics (IPAM): IPAM is excited to announce a semester
long program in Large Scale Communications Networks from March 11 - June
14, 2001. The program will take place at the IPAM building on the
campus of UCLA in Los Angeles. The program is organized by Walter
Willinger (AT&T Labs-Research), David Donoho (Stanford),
John Doyle (CalTech),Deborah Estrin (UCLA), Kristina Lerman (USC/ISI),
and Mark Green (IPAM and UCLA). The Internet has become a gold mine for
new, exciting and challenging mathematical problems, where scale,
complexity, and dynamic play key roles. The goal of this program on the
interface between the mathematical/physical sciences and
computer/engineering sciences is to initiate, facilitate or foster
interactions among researchers with diverse backgrounds who seek to
unravel the ill-understood dynamics of large-scale complex internetworks
such as the Internet.
WORKSHOP I: Large-Scale Communication Networks: Topology, Routing,
Traffic, and Control
Date: March 18-22 2002
Organizers: David Donoho (Stanford), John Doyle (Caltech), Frank Kelly
(Cambridge), and Walter Willinger (AT&T Research Labs)
WORKSHOP II: "Large-Scale Engineering Networks: Robustness,
Verifiability, and Convergence"
Date: April 15-19 2002
Organizers: John Doyle (Caltech), Eric Feron, R. Murray, Walter
Willinger (AT&T Research Labs)
WORKSHOP III: "On Massively Distributed Self-Organizing Networks"
Date: May 13-17 2002
Organizers: John Doyle (Caltech), Debra Estrin (UCLA), Kristina Lerman
(USC)
Full details of the program and its workshops can be found at
http://www.ipam.ucla.edu/programs/cn2002/. Program specific questions
can be addressed to cn2002@ipam.ucla.edu .
FUNDING IS AVAILABLE FOR GRADUATE STUDENTS, POST-DOCS AND YOUNG
ACADEMICS IN THE JUNIOR STAGES OF THEIR CAREER WHO WISH TO ATTEND THE
ENTIRE PROGRAM. APPLICATION FORM IS ON ABOVE WEBSITE.


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

From: Eilish Hathaway <eilish@ipam.ucla.edu>
Date: Tue, 30 Oct 2001 15:42:37 -0800
Subject: Workshop at IPAM on Multilevel Optimization in VLSICAD

Program in "Multilevel Optimization in VLSICAD: Computer-Aided Design of
Very-Large-Scale Integrated Circuits"
IPAM is pleased to announce a workshop on Multilevel Optimization in
VLSICAD that will run from December 3-5, 2001. The program will take
place at the IPAM building on the campus of UCLA in Los Angeles. The
program is organized by Achi Brandt (Weizmann Institute of Science,
Isreal), Jason Cong (CS, UCLA), and Joseph R. Shinnerl (CS, UCLA). The
goal of this workshop is to provide much needed innovation to the
VLSICAD field. The prevailing VLSICAD methodology is facing serious
challenges due to the rapid increase of design complexity and
interconnect bottleneck in deep submicron technologies. The program
includes tutorials in general VLSICAD and combinatorial multilevel
algorithms, as well as talks by specialists on state-of-the art
solutions to some of the most difficult problems in the field. Full
information about the workshop, including speaker list, schedule and
online registration form is available at the following website:
http://www.ipam.ucla.edu/programs/mov2001/index.html=20
Program specific questions can be directed to mov2001@ipam.ucla.edu


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

From: Eilish Hathaway <eilish@ipam.ucla.edu>
Date: Tue, 30 Oct 2001 16:09:10 -0800
Subject: Workshop at IPAM on Contemporary Methods in Cryptography

Workshop on "Contemporary Methods in Cryptography"
IPAM is pleased to announce a workshop on "Contempory Methods in
Cryptography" which will run from January 9-13, 2002. The program will
take place at the IPAM building on the campus of UCLA in Los Angeles.
The program is organized by Don Blasius (UCLA), William Duke (UCLA), and
Jonathan Rogawski (UCLA) [Local organizing committee] and Dan Boneh
(Stanford University), Cynthia Dwork (Compaq Systems Research Center),
Joseph Silverman (NTRU Cryptosystems/Brown University)
[Scientific Committee]. The need to securely transmit ever-increasing
quantities of data over the internet has given rise to a new set of
problems and solutions which lie on the interface between number theory,
complexity theory, and computer science. This has led to active
collaborations between academic researchers and their counterparts in
the industry. This program will present recent advances in the science
of cryptography. Emphasis will be on the mathematical aspects of the
field as opposed to dealing with the practical implementation of secure
communications networks. Topics of interest include: public key
cryptography and attacks on them (factorization, discrete logs, elliptic
curves, lattices, non-abelian groups), pseudo-random number generators,
hash functions, symmetric ciphers, DES, AES/Rijndael, provable
cryptographic constructions, digital signatures, and lattice basis
reduction cryptosystems.
Some funding is available for graduate students and post-docs and young
academics.
Full information about the workshop, including speaker list, schedule
and online registration form is available at the following website:
http://www.ipam.ucla.edu/programs/cry2002/=20
Program specific questions can be directed to cry2002@ipam.ucla.edu


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

From: Will Zimmerman <w.zimmerman@sheffield.ac.uk>
Date: Thu, 1 Nov 2001 22:04:49 -0000
Subject: Conference in Linz on Mechatronics

Dear Colleagues,

I write to inform you, the members of na-digest, as a fellow na-netter,

about

MECH2K2: International Conference on MECHATRONICS, 3-6 July
2002, Linz, Austria, hosted by the Mechatronics Institute of the
Johannes Kepler University.

I am a member of the organizing committee and convening the
session on NONLINEAR MECHANICS. There are also parallel
sessions dedicated to
ACOUSTICS, NOISE, and VIBRATIONS
and
NON-SMOOTH MECHANICS

Our website is

http://eyrie.shef.ac.uk/mech2k2/

The conference programme is taking shape, so you might consider
submitting a paper or participating the the conference. Please refer
to the web-site for the Call for Papers in pdf form

http://eyrie.shef.ac.uk/mech2k2/MECH2K2call.pdf

Should you be interested in pursuing this avenue, please reply to:
mech2k2@shef.ac.uk

or fill in the online pre-registration form.

Many thanks for your consideration of this matter. Please pass
this information along to your colleagues who may have an interest.

Yours sincerely,

WBJ Zimmerman


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

From: Jerzy Wasniewski <unijw@unidhp1.uni-c.dk>
Date: Thu, 1 Nov 2001 08:33:05 +0100 (MET)
Subject: Workshop at ICCS on Modern Numerical Algorithms

Workshop on
Modern Numerical Algorithms
to be held in conjunction with the
ICCS 2002 Conference on Computational Science

April 21 -- 24, 2002
Amsterdam, The Netherlands
http://www.science.uva.nl/events/ICCS2002/

A limited number of contributed, either 20 or 30 minutes talks will be
selected for this session. Extended abstracts no more than two pages
should be sent as soon as possible. The text can be in Latex, Postscript
or pure ASCII. The acceptance will be send no later than in one or two
days. After acceptance, full papers, from 6 to 10 pages, formatted
according to the rules of the LNCS, in order to be published in the ICCS
2002 proceedings, should be sent to me before November 26, 2001. The style
files for the LNCS can be found at

http://www.springer.de/comp/lncs/authors.html

These submitted papers will be read again, and the incorrect and wrongly
formatted papers will have to be submitted again. The camera ready papers
and pre-registrations must be done before January 10, 2002. Some papers
may be selected for publication in special issues of regular scientific
journals.

Summary, Important Dates and Notes:

November 26, 2001 -- Paper Submission (full papers, see above)
January 10, 2002 -- Camera Ready Papers and Pre-registration

The Extended Abstracts and the papers of this Workshop should be
sent to me
jerzy.wasniewski@uni-c.dk

The payments, registration, hotel reservation and other conference
matters should be managed according to the ICCS2002 roles.


The organizer of the Workshop:
Jerzy Wasniewski
UNI-C, Danish IT Center
for Education and Research
Danish Technical University
Lyngby, Denmark


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

From: Martin Buecker <buecker@sc.rwth-aachen.de>
Date: Sun, 04 Nov 2001 12:33:29 +0100
Subject: Workshop at ICCS on Automatic Differentiation

Workshop on
Automatic Differentiation and Applications
in conjunction with the
2002 International Conference on
Computational Science
Amsterdam, The Netherlands, April 21-24, 2002
http://www.science.uva.nl/events/ICCS2002/

Authors are invited to submit original and unpublished
papers in all areas of automatic differentiation with
an emphasis on successful applications.

Accepted papers will be published in ICCS 2002 Proceedings
in the Springer Verlag Lecture Notes in Computer Science
(LNCS) series.

Important Dates:

Draft Full Papers: December 7, 2001
Notification of Acceptance: December 17, 2001
Registration: December 21, 2001
Camera-Ready Papers: January 15, 2002
ICCS Conference: April 21-24, 2002

For detailed information, please visit the workshop
website at
http://www.sc.rwth-aachen.de/iccs02/

Organizers:
C. Bischof and M. Buecker
Aachen University of Technology


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

From: Bill Briggs <wbriggs@math.cudenver.edu>
Date: Thu, 1 Nov 2001 08:20:59 -0700 (MST)
Subject: Chair Position at University of Colorado at Denver

Announcement for Mathematics Department Chair Position
University of Colorado at Denver
October 11, 2001

The Mathematics Department at the invites
applications and nominations for the positions of Professor and Chair; the
appointments begin on July 1, 2002. The faculty has 22 full-time members whose
research and teaching cover a wide range of areas:
* computational and engineering mathematics,
* discrete mathematics, finite geometry, and combinatorics,
* operations research and optimization,
* probability and statistics.

The Chair will be a person of vision who brings excellence in research and
teaching, commensurate with the rank of (full) Professor, and demonstrated
success in administration. In addition, he or she should have a commitment to
integrating the Department's teaching and research missions at both the
undergraduate and graduate levels.

The Department is in the third year of a five-year Center of Excellence grant
from the State, the highest and most generously funded award that the state
confers on academic programs. The Department is also a major participant in the
Center for Computational Mathematics and the newly created Center for
Computational Biology. The Chair will possess the scholarship and leadership
that will enable the Department to build on these opportunities and achieve a
new level of national and international recognition.

CU-Denver, located in the heart of thriving downtown Denver, is the urban campus
of the University of Colorado system. Roughly half of CU-Denver's 11,000
students are in graduate or professional programs. The Department has
approximately 70 M.S. and Ph.D. students, and 100 undergraduate mathematics
majors. The quality of life in Denver is exceptionally high with both the
cultural benefits of a large city and endless mountain recreation.

Applications must include a letter of intent; full curriculum vita; statement
outlining personal strengths and leadership philosophy; name, address, phone,
and email of three references; and reprints of five recent publications. Review
of applications will begin on January 15, 2001, and will be ongoing.

Applications should be sent to:

Chair Search Committee
Mathematics Department, Box 170
University of Colorado at Denver
P.O. Box 173364
Denver, CO 80217-3364

Visit the Department web site at http://www-math.cudenver.edu/chair.html.

The Colorado Open Records Act (C.R.S. 24-72-204) requires a written request for
confidentiality at the time of application. Applications without a written
request for confidentiality may be required to be disclosed. The University of
Colorado at Denver is an equal opportunity educator and employer committed to
excellence through inclusiveness.


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

From: Iraj Kalantari <iraj_kalantari@ccmail.wiu.edu>
Date: Wed, 31 Oct 2001 16:11:33 -0500
Subject: Faculty Positions at Western Illinois University

TWO TENURE-TRACK POSITIONS, Assistant Professor, August 2002.

One position is open to applicants from all areas of mathematical sciences. The
second position is in statistics. Expertise in Financial Mathematics is
desirable. Three-course teaching (with appropriate integration of computing
technology), research, and service expected.

QUALIFICATIONS: Ph.D. (or imminent) in a mathematical sciences area;
demonstrated, or potential for, excellence in teaching; a record of, or
potential for, research; a record of, or commitment to, service.

SCREENING BEGINS December 15, 2001; continues until position filled.
Preliminary interviews at San Diego Joint Meeting.

Send letter, vita, teaching philosophy, research description, three reference
letters, and transcripts (photocopies) to:

Iraj Kalantari, Chair
Mathematics Department
Western Illinois University
Macomb, IL 61455-1390

URL: http://www.wiu.edu/mathematics/

WIU is an Equal Opportunity and Affirmative Action employer. We are especially
interested in applications from women and minorities, and individuals with
disabilities. All positions are subject to State funding.


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

From: Saleet Jafri <jafri@utdallas.edu>
Date: Tue, 30 Oct 2001 17:22:49 -0600
Subject: Postdoctoral Position at University of Texas at Dallas

Position: Research Associate (postdoctoral)
Institution: The University of Texas at Dallas
Location: Richardson, TX
Deadline: December 1, 2001 or when position is filled
Start date: January 1, 2002

Project Description: The Human Genome Project and modern molecular biology
techniques have produced an abundance of data on the genes and gene
products, in particular proteins, that control cell function. On average,
proteins interact with five other proteins to form the complex signaling and
regulatory networks that integrate the input signals to a cell and
orchestrate its response. Pharmaceutical companies are very interested in
understanding how malfunctioning regulatory networks can lead to disease;
indeed, of the 500 different molecular targets at which current drug
therapies are aimed, about half are cell surface receptors, the starting
point of signaling networks. Unlocking the therapeutic potential of the
remaining, downstream components of signaling networks will require more
knowledge of protein-protein interactions, but will also need mathematical
and computational tools for integrating these isolated pieces of data into a
single system, whose overall response can then be studied. The goal of this
project is to develop mathematical techniques and tools for modeling and
analyzing receptor-mediated signaling networks. The project is a part of a
multidiscliplinary effort that involves collaboration with a major
pharmaceutical company. The postdoctoral fellow will have the opportunity to
interact with both experimental and theoretical scientists in both the
academic and industrial environment. The position starts January 1, 2002
and lasts for two years. Review of applications will begin December 1,
2001.

Qualifications: Candidate should have a Ph.D. or M.D. with experience in
mathematical and computational modeling of biological systems.

Application: Send curriculum vitae, the names of three references, and a
description of past research experience and research interests to the
following address:

M. Saleet Jafri
Department of Mathematical Sciences EC35
The University of Texas at Dallas
Box 830688
Richardson, TX 75083
Phone: 972-883-4436
Fax: 972-883-6622
email: jafri@utdallas.edu

UT-Dallas is an EEO/AA employer


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

From: Ulrich Ruede <Ulrich.Ruede@informatik.uni-erlangen.de>
Date: Fri, 2 Nov 2001 10:59:09 +0100 (CET)
Subject: Student and Postdoctoral Positions at University of Erlangen

The "Lehrstuhl fuer Systemsimulation" at the University of
Erlangen-Nuremberg has several openings for Research Assistants and
Postdocs.

1. Modeling and simulation of natural attenuation with supercomputers:

This project is part of a Bavaria-wide collaborative
research project in natural attenuation processes, see
(http://www.altlasten-bayern.de/frame_gab.htm), in particular the
modeling and simulation of groundwater pollution effects. Our
subproject is focused on high performance computing and is in
close collaboration with the Department of Applied Mathematics
(http://www.am.uni-erlangen.de/) at University of Erlangen-Nuremberg.

2. Inverse Bioelectric and Biomagnetic Field Problems:

Bioelectric and biomagnetic activity in the human body has long been used
for diagnostic purposes. With modern numerical simulation algorithms it
becomes possible to reconstruct the three dimensional electromagnetic
fields from EEG and MEG measurements and use it for localizing e.g. the
focus of an epileptic seizure. As any such inverse problem this involves
advanced mathematical techniques. The project is done in collaboration
with the computer graphics group (http://www9.informatik.uni-erlangen.de/)
and the Neurochirurgische Klinik at University of Erlangen
(http://www.uni-erlangen.de/neurochirurgie/dstaff.htm),
and the Fachhochschule Schweinfurt
(http://www.fh-sw.de/sw/fachb/et/einf/intro.html).

3. Graduiertenkolleg "Dreidimensionale Bildanalyse und Synthese"
(special PhD program "3D Image Analysis and Synthesis")
(see http://www9.informatik.uni-erlangen.de/~gradkoll/).
We offer PhD research topics involving parallel multilevel
methods and PDE based models for image matching/registration and image
segmentation.

For all positions, a degree equivalent to the German Diploma (Master's
degree) in computer science, mathematics, physics, or a technical
discipline is required. Knowledge of German is a plus. For 1 and 2,
the salary will be according to the applicant's qualification and the
German BAT. For 3) stipends are available according to the rules of the
German Science Foundation (DFG). If you are interested, please send your
inquiries or application to

Prof. Dr. Ulrich Ruede
Lehrstuhl fuer Simulation
Universitaet Erlangen-Nuernberg
Cauerstr. 6
D-91058 Erlangen
Germany
e-mail: ruede@informatik.uni-erlangen.de
URL: http://www10.informatik.uni-erlangen.de/~ruede


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

From: Jens Burmeister <jb@numerik.uni-kiel.de>
Date: Fri, 2 Nov 2001 15:13:00 +0100
Subject: Doctoral Scholarship at University of Kiel

The UNIVERSITY OF KIEL and the UNIVERSITY OF LUEBECK (both Germany)
invite applications for

DOCTORAL SCHOLARSHIPS

starting at any time within November 2001 - January 2002.

The positions are located within the graduate school

"Efficient Algorithms and Multiscale Methods" ,

sponsored by the German Research Foundation (DFG).

Beside the topics Numerical and Discrete Mathematics,
Computer Science and Electrical Engineering
special emphasis is put on the subject

COMPUTATIONAL ELECTROMAGNETICS:

* Efficient Hybrid Methods
(Example: Combinations with Multipole Methods
including the Fast Multipole Method)

* Finite-Difference Time-Domain Methods
(Example: Recursive techniques for dispersive media
and for near-to-far-field transforms).

The graduate school is interdisciplinarily organized by the professors

Betten, Carstensen, Fischer, Hackbusch, Prestin, Srivastav (Mathematics)
Jansen, Sommer (Computer Science)
Brocks, Dirks, Heute, Klinkenbusch, Roeck (Engineering)

and offers an oustanding educational and research program which has been
especially developed for the scholarship holders.

Each grant amounts to 2000 DM monthly for 3 years (tax-free) plus
-if applicable- a family subsidy. Travel expenses to national and
international meetings and symposia are refunded separately.
Admission requires holding or expecting (in the near future)
a rapid and above-average graduation, and the will to work
interdisciplinarily.

Please send your application (including a curriculum vitae,
copies of the certificates, a letter of recommendation, and a
statement to the desired field of research)
as soon as possible to:

Prof. Dr. Anand Srivastav
Mathematisches Seminar
Universitaet zu Kiel
Ludewig-Meyn-Str. 4, D-24098 Kiel
Germany
e-mail: asr@numerik.uni-kiel.de
FAX: +49-431-880 1725


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

From: Michael Shub <mshub@us.ibm.com>
Date: Mon, 29 Oct 2001 15:22:50 -0500
Subject: Contents, Foundations of Computational Mathematics

Foundations of Computational Mathematics
Table of Contents Vol. 1 Issue 4

Elizabeth L. Mansfield:
Algorithms for Symmetric Differential Systems
Found. Comput. Math. 1 (2001) 4, 335-383

L. Baratchart, V. A. Prokhorov, E. B. Saff:
Best Meromorphic Approximation of Markov Functions on the Unit Circle
Found. Comput. Math. 1 (2001) 4, 385-416

G. W. Wasilkowski, H. Wozniakowski:
On the Power of Standard Information for Weighted Approximation
Found. Comput. Math. 1 (2001) 4, 417-434


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

From: Ake Bjorck <akbjo@mai.liu.se>
Date: Tue, 30 Oct 2001 17:05:45 +0100 (MET)
Subject: Contents, BIT Numerical Mathematics

CONTENTS BIT Numerical Mathematics
Volume 41, Issue 4 (December 2001)
For information to contributers and about subscriptions see
http://math.liu.se/BIT/


Acceleration of convergence of static and dynamic iterations
K. Burrage, G. Hertono, Z. Jackiewicz,
and B. D. Welfert, pp. 645--655

A reliable error estimation for diagonally implicit multistage
integration methods
J. C. Butcher and Z. Jackiewicz, pp. 656--665

Approximation of the weighted Hilbert transform on the real
line by an interpolatory process
M. R. Capobianco, G. Criscuolo, and R. Giova, pp. 666--682

A heuristic rejection criterion in interval global
optimization algorithms
L. G. Casado, I. Garc{\'\i}a, and T. Csendes, pp. 683--692

Computing row and column counts for sparse $QR$ and
$LU$ factorization
J. R. Gilbert, X. S. Li, E. G. Ng,
and B. W. Peyton, pp. 693--710

Pathwise approximation of random ordinary differential
equations
L. Gr\"une and P. E. Kloeden, pp. 711--721

Fast computation of $\zeta (3)$ and of some special integrals
using the Ramanujan formula and polylogarithms
E. A. Karatsuba, pp. 722--730

ROS3P---An accurate third-order Rosenbrock solver designed for
parabolic problems
J. Lang and J. Verwer, pp. 731--738

Computation of optimal backward perturbation bounds for
large sparse linear least squares problems
A. Malyshev and M. Sadkane, pp. 739--747

Optimal cubature formulae and recovery of fast-oscillating
functions from an interpolational class
K. N. Melnik and R. V. N. Melnik, pp. 748--775

Mono-implicit Runge--Kutta--Nystr\"om methods with application
to boundary value ordinary differential equations
P. H. Muir and M. Adams, pp. 776--799

Towards a tighter coupling of bottom-up and top-down sparse
matrix ordering methods
J. Schulze, pp. 800--841

SCIENTIFIC NOTES

A formula for the exponential matrix of a real skew-symmetric
matrix of order 4
T. Politi, pp. 842--845


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

End of NA Digest

**************************
-------