NA Digest Sunday, March 17, 2002 Volume 02 : Issue 11

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

Submissions for NA Digest:

Mail to

Information via e-mail about NA-NET: Mail to


From: Max Gunzburger <>
Date: Thu, 14 Mar 2002 13:55:31 -0600
Subject: George Fix

It is with deep regret that I pass on the very sad news of the death
of George Fix on Sunday, March 10. George was one of the pioneers of
finite element methods; he wrote the first or one of the first papers
on finite element methods for eigenvalue problems, finite element
methods for time-dependent problems, finite element methods for
problems with singularities, least-squares finite element methods,
finite element methods for PDEs of mixed type, the effects of
quadrature errors on finite element solutions, finite element methods
for compressible flows, and mixed and hybrid finite element methods.
He was the co-author, along with Gil Strang, of the seminal book "An
Analysis of Finite Element Methods" which became one of the most
important and influential applied mathematics books ever published.
George was one of the co-developers of phase field methods for phase
transition problems. He also made significant contributions to
several other areas of applied mathematics, including computational
acoustics, computational fluids, computational geometry, and integral

George was a man of great energy, enthusiasm, knowledge, talent,
and most of all, of great heart. He gave unselfishly to his students
and co-workers, all of whom benefited greatly from interacting with
him. His colleagues, friends, and family will miss him immensely.


From: Tim Davis <>
Date: Mon, 11 Mar 2002 16:28:11 -0500
Subject: UMFPACK V4.0 Beta Version

UMFPACK V4.0 is a package written in C for sparse LU factorization. The
current version (V4.0beta) can now handle real or complex matrices,
square or rectangular matrices, and non-singular or singular matrices.
A simple MATLAB interface is provided. For example, x = umfpack (A, '\', b)
is like the MATLAB statement x = A\b.

The V4.0Beta version is stable, as far as I can tell. Once it seems some use,
I'll release the final V4.0. The code can be found at

Tim Davis
Univ. of Florida


From: Tim Davis <>
Date: Tue, 12 Mar 2002 14:27:59 -0500
Subject: Downloading Sparse Matrices in MATLAB

We'd like to announce the V1.0beta release of a simple MATLAB and JAVA code
that you can use to download sparse matrices from the UF sparse matrix
collection directly into your MATLAB workspace. Matrices that you download
are kept in a local directory on your own computer, which speeds up reloading
of the matrix. No web browser is needed.

See for a full description, or
to download just the required M-files and Java files.

Just download UFsparse1.0beta.tar.gz and uncompress it (gunzip and tar on
Unix, or WinZip on MS Windows), start MATLAB, go to your UFsparse1.0beta
directory, and type


which downloads all symmetric non-binary matrices, in increasing order of
the number of rows in the matrix, and plots each matrix.

To see a list of matrices in the collection (841 matrices in 758 MB, as of
March 2002, including all of the Netlib LP test problems in MATLAB form), type


To get a particular matrix, type (for example)

Problem = UFget ('HB/arc130')

As we add more matrices to the collection, your local index will be
automatically updated (every 30 days, by default). No need to dig around
the UF sparse matrix web page to look for new matrices as they arrive.

To submit sparse matrices to the collection (large ones or "interesting" ones),
please email Tim Davis at

Tim Davis,
Erich Mirabal,


From: David Watkins <>
Date: Tue, 12 Mar 2002 13:49:13 -0800
Subject: New Edition, Fundamentals of Matrix Computations

David S. Watkins

Dear NA Digest Readers,

Two weeks ago I announced that the second edition of my book
"Fundamentals of Matrix Computations" will soon be available.
I just want to add that you can now download a pdf file containing the
frontmatter, including table of contents, from my website

with best regards,
David Watkins


From: Paul Favre <>
Date: Mon, 11 Mar 2002 15:09:52 -0600
Subject: New Book, Data Mining for Scientific and Engineering Applications

Data Mining for Scientific and Engineering Applications.
Robert L. Grossman, Chandrika Kamath, Philip Kegelmeyer,
Vipin Kumar, and Raju Namburu,
Kluwer Academic Publishers, October 2001

Advances in technology are making massive data sets common in many
scientific disciplines, such as astronomy, medical imaging,
bio-informatics, combinatorial chemistry, remote sensing, and physics.
To find useful information in these data sets, scientists and engineers
are turning to data mining techniques. This book is a collection of
papers based on the first two in a series of workshops on mining
scientific datasets. It illustrates the diversity of problems and
application areas that can benefit from data mining, as well as
the issues and challenges that differentiate scientific data mining from
its commercial counterpart. While the focus of the book is on mining
scientific data, the work is of broader interest as many of the techniques
can be applied equally well to data arising in business and web applications.

Vipin Kumar


From: Noel Barton <>
Date: Fri, 15 Mar 2002 17:21:16 +1100
Subject: International Congress on Industrial and Applied Mathematics

ICIAM 2003

Please allow me to update a posting that first occurred on 3 September 2000.

The Fifth International Congress on Industrial and Applied Mathematics,
ICIAM 2003, will be held in Sydney, Australia from 7-11 July 2003.

ICIAM 2003 is held under the auspices of the International Council for
Industrial and Applied Mathematics. Previous Congresses in the series were
held at Paris (1987), Washington (1991), Hamburg (1995) and Edinburgh

ICIAM 2003 will be hosted by ANZIAM, the regional professional body for
applied mathematicians. The Congress will feature plenary speakers,
minisymposia, contributed papers, poster sessions, industrial discussion
sessions and six embedded meetings. The principal venue is the Sydney
Convention and Exhibition Centre, located in Darling Harbour and adjacent to
the central business district of Sydney. We plan to attract 2000 delegates.

The invited speakers are

Brian Anderson Australia
Marsha Berger USA
Yann Brenier France
Franco Brezzi Italy
Jennifer Tour-Chayes USA
Mark Davis UK
James Demmel USA
Peter Deuflhard Germany
David Donoho USA
Yoshikazu Giga Japan
Alice Guionnet France
Tom Hou USA
Jon Keating UK
Rupert Klein Germany
Nancy Kopell USA
Tom Leighton USA
Peter Markowich Austria
Alexander Mielke Germany
Harald Niederreiter Singapore
Michael Ortiz USA
George Papanicolaou USA
Philippe Toint Belgium
Ernie Tuck Australia
Neil Sloane USA
Henk van der Vorst Netherlands
Long-an Ying China
Vladimir Zakharov USA

Key dates

from early April 2002: distribution of registration circular
from mid April 2002: online submission of abstracts

Submission deadlines
31 August 2002: early deadline for minisymposia proposals;
31 Oct 2002: normal deadline for minisymposia proposals;
deadline for contributed presentations;
(proposals received after this date will be by poster session)
31 January 2003: deadline for abstract submissions
(minisymposia and contributed talks)
final deadline for abstract submissions to poster sessions.

Registration deadlines
30 Nov 2002: deadline for early-bird registration
31 March 2003: deadline for normal registration fee
30 June 2003: deadline for late registration fee
on-site registration is possible but expensive

Further details: (website for ICIAM 2003 and the International Council)


From: Arieh Iserles <>
Date: Tue, 12 Mar 2002 09:52:40 GMT
Subject: Conference in Minneapolis on Foundations of Computational Mathematics

Second Announcement & Call for Registration
Minneapolis, 5-14 August 2002

The next Foundations of Computational Mathematics conference will be
held at University of Minnesota on 5-14 August 2002, as guests of the
Institute for Mathematics and its Applications.

The conference, organised by Society for Foundations of Computational
Mathematics, is next in a sequence that commenced with Park City, Rio
de Janeiro and Oxford FoCM meetings. The format will be similar:
plenary invited lectures in the mornings, theme-centred parallel
workshops in the afternoons. Each workshop will be go on for three
days and the conference will consist of three `periods', comprising of
different themes.


Ian ANDERSON (Utah State) Teresa KRICK (Buenos Aires)
Philippe CIARLET (Paris 6) Pierre Louis LIONS (Paris 9)
Albert COHEN (Paris 6) Dan LOZIER (NIST)
Tony DeROSE (Pixar) Volker MEHRMANN (TU Berlin)
Herbert EDELSBRUNNER (Duke) Andrew ODLYZKO (Minnesota)
Michael FREEDMAN (Microsoft) Edriss TITI (UC Irvine)
Wolfgang HACKBUSCH (Kiel) Mike TODD (Cornell)
Stefan HEINRICH (Kaiserslautern) Vladimir VAPNIK (AT&T Research)
Pascal KOIRAN (ENS Lyon) Grace WAHBA (Wisconsin)

The overall oversight of FoCM'02 is the responsibility of the FoCM
Executive Committee whose current Chair is Ron DeVORE (University
of South Carolina). The organisation is managed by the Local
Organising Committee: Carme CALDERER, Bernardo COCKBURN, Jianhong
(Jackie) SHEN, Willard MILLER, Peter OLVER and Victor REINER.

WORKSHOPS and their organisers:
* Foundations of numerical PDEs
Philippe Ciarlet (Paris 6), Mitch Luskin (Minnesota) & Eitan Tadmor (UCLA)
* Geometric integration and computational mechanics
Debra Lewis (UC Santa Cruz) & Hans Munthe-Kaas (Bergen)
* Information-based complexity
Erich Novak (Jena), Greg Wasilkowski (Lexington) & Henryk
Wozniakowski (Columbia & Warsaw)
* Learning theory
Tomaso Poggio (MIT) & Steve Smale (UC Berkeley)
* Optimization
Michael Overton (NYU), Bill Pulleyblank (IBM Yorktown Heights) & Jim
Renegar (Cornell)
* Special functions
Tom Koornwinder (Amsterdam) & Adri Olde Daalhuis (Edinburgh)
* Approximation theory
Allan Pinkus (Haifa) & Amos Ron (Madison)
* Computational algebraic geometry
Askold Khovanskii (Toronto) & Teresa Krick (Buenos Aires)
* Computational number theory
Richard Brent (Oxford), Dennis Hejhal (Minnesota & Uppsala) & Carl
Pomerance (Bell Labs)
* Multiresolution and adaptivity in numerical PDEs
Wolfgang Dahmen (Aachen), Raytcho Lazarov (Texas A&M) & Endre Suli (Oxford)
* Numerical linear algebra
Alan Edelman (MIT) & Steve Vavasis (Cornell)
* Quantum computing
Charles Bennett (IBM Yorktown Heights), Michael Freedman (Microsoft Research)
* Complexity
Gregorio Malajovich (Rio de Janeiro) & Pascal Koiran (Lyon)
* Computational dynamics
George Sell (Minnesota) & Warwick Tucker (Cornell)
* Geometric modelling and animation
Malcolm Sabin(Cambridge), Larry Schumaker(Nashville), Wim Sweldens(Bell Labs)
* Image and signal processing
Albert Cohen (Paris 6) & Guillermo Sapiro (Minnesota)
* Stochastic computation
Des Higham (Strathclyde) & Andrew Stuart (Warwick)
* Symbolic analysis
Ian Anderson(Utah State), Liz Mansfield(Canterbury), Peter Olver(Minnesota)

CONTACT INFORMATION: For further information, see
or email
REGISTRATION now open at


From: Pierre Gremaud <>
Date: Wed, 13 Mar 2002 12:10:29 -0500
Subject: Workshop at NC State on Industrial Mathematics Modeling

2002 Industrial Mathematics Modeling Workshop
for Graduate Students
July 20-July 30, 2002
Center for Research in Scientific Computation
North Carolina State University &
Statistical and Applied Mathematical Sciences Institute


Expose about 40 graduate students in mathematics to challenging
and exciting real-world problems arising in industrial and
government laboratory research

Introduce students to the team approach to problem solving


This workshop will be the 8th one of this type to be held at NCSU.
We offer the support of experienced faculty and staff as well as
extensive financial support (local living expenses and allocation for
travel) to all selected students who are affiliated to a US institution.
The workshop is supported by the National Science Foundation as well as
by the new Statistical and Applied Mathematical Sciences Institute (see for more information).


The students are divided into six-member teams to collaborate on
industrial mathematics projects presented by experienced scientists
and enginners. The corresponding problems are not the kind of academic
exercises often considered in classrooms. The challenges they raise
typically require fresh new insight for both formulation and solution.
During the workshop, each group is mentored by both the problem presenter
and a faculty adviser.


Battelle Memorial Institute: material sciences, control theory.
Glaxo-Smith-Kline: data mining, predictive toxicology.
Jenike & Johanson: plasticity, modeling of frictional effects.
Kirtland Air Force Base: material sciences, control theory.
National Institute of Environmental Health Sciences: computational
biology, risk analysis.
Sandia National Laboratories: advanced automatic train control.
Summus: mechanics of sand, wave propagation, image processing.

More details about this and previous workshops can be found at


Pierre Gremaud, North Carolina State University
Zhilin Li, North Carolina State University
Ralph Smith, North Carolina State University
Hien Tran, North Carolina State University


Graduate students in mathematics, applied mathematics, or statistics
can be nominated for this program through a letter of recommendation
from a faculty member. In addition, the student is required to send
a copy of a recent transcript as well as a brief cover letter stating
his/her research interests. The deadline for application is April 15,
2002 and successful applicants will be notified by May 1, 2002.

Completed applications or inquiries concerning this Workshop should be
submitted to:

Pierre A. Gremaud
Center for Research in Scientific Computation
North Carolina State University
Raleigh, NC 27695-8205

Telephone: (919) 515-3085
Fax: (919) 515-1636


From: Iain Duff <>
Date: Fri, 15 Mar 2002 10:02:16 GMT
Subject: Contents, IMA Journal of Numerical Analysis

Contents of Volume 22, Number 2

Michael Dellnitz, Oliver Sch\"utze and Stefan Sertl
Finding zeros by multilevel subdivision techniques.
pp 167-185

J.A. Ezquerro and M.A. Hern\'andez
Generalized differentiability conditions for Newton's method.
pp 187-205

J.-J. Gervais and H Sadiky
A new steplength control for the continuation with the asymptotic numerical
pp 207-229

Amiya K. Pani and Graeme Fairweather
$H^1$-Galerkin mixed finite element methods for parabolic partial
integro-differential equations.
pp 231-252

Mario Ohlberger and Christian Rohde
Adaptive finite volume approximations for weakly coupled convection dominated
parabolic systems.
pp 253-280

D. Kessler and J.-F. Scheid
A priori error estimates of a finite element method for an isothermal
phase-field model related to the solidification process of a binary alloy.
pp 281-305

M. Ainsworth and P. Coggins
A uniformly stable family of mixed $hp$-finite elements with continuous
pressures for incompressible flow.
pp 307-327


From: Marcin Paprzycki <>
Date: Mon, 11 Mar 2002 20:13:37 -0600 (CST)
Subject: Contents, Structured Matrices: Recent Advances and Applications

Advances in Computation: Theory and Practice Bookseries
Volume 4
Structured Matrices: Recent Advances and Applications
edited by D. A. Bini, E. Tyrtyshnikov and P. Yalamov


D. A. Bini, E. Tyrtyshnikov and P. Yalamov, Editors

Part 1

Twenty Old and New Asymptotic Results on Toeplitz Band Matrices
A. B=F6ttcher and S. Grudsky

On the Spectral Distribution of Certain Sequences of Band Matrices
C. de Lellis and P. Tilli

Part 2

Solving Block Banded Block Toeplitz Systems with Structured Blocks:
Algorithms and Applications
D. A. Bini and B. Meini

Isospectral Flows on Displacement Structured Matrix Spaces
Dario Fasino

Solving Ill-Conditioned Toeplitz Systems via Index Cancellation
G. Heinig, P. Kravanja, and M. Van Barel

Unitary Hessenberg Matrices and the Generalized Parker-Forney-Traub
Algorithm for Inversion of Szego-Vandermonde Matrices
Vadim Olshevsky

Newton's Iteration for the Inversion of Structured Matrices
V. Y. Pan and Y. Rami

Solution Methods for Semi-Infinite Linear Systems of Block Toeplitz and
Their Perturbations
C. V. M. Van Der Mee, S. Seatzu, and G. Rodriguez

On the Stability of Some Algorithms for Polynomial Multiplication and Division
Plamen Y. Yalamov

Part 3

Polynomial Factors, Lemniscates and Structured Matrix Technology
Luca Gemignani

Representations of Cauchy Matrices with Chebyshev Nodes Using
Trigonometric Transforms
Georg Heinig and Karla Rost

A Matrix View on the Root Distribution for Orthogonal Polynomials
Eugene Tyrtyshnikov

Part 4

Circulant Preconditioners for Solving Ordinary Differential Equations
R. H. Chan, M. K. Ng, and X.-Q. Jin

Exploiting Matrix Structures in Spect Models
P. Brianzi and F. Di Benedetto

Iterative Regularization for Ill-Posed Imaging Problems Using Neumann
Boundary Conditions
W. C. Kwan and M. K. Ng

Structured Preconditioning of Optimal Preconditioners for 2D Collocations
Linear Systems
S. Serra Capizzano and C. Tablino Possio


End of NA Digest