International Linear Algebra Year
Workshop on Direct Methods
September 26-29, 1995
Click here
for some pictures of the workshop.
Programme
Click the (underlined) title to download the abstract of the talk.
Some of the speakers have made available
the transparencies of their talk or a publication that is related to the
subject of the talk; these can be downloaded by clicking the item(s) after
the title.
A collection of all the
abstracts is also available.
Tuesday September 26 : Tutorial / industrial day
- I. Duff (CERFACS and RAL, United Kingdom),
Techniques and software in the
solution of sparse equations by direct methods,
(transparencies 905K)
- A. George (University of Waterloo, Canada),
A retrospective look at the
design of SPARSPAK and some considerations for a future release,
(transparencies 51K)
- E. Ng (ORNL, USA),
Direct solution of general sparse
linear systems: algorithms, codes, and performance,
(transparencies 58K)
- J. Reid (RAL, United Kingdom),
The use of Fortran 90 in
linear algebra codes,
(transparencies 13K)
- P. Bjørstad (University of Bergen, Norway),
Large scale direct solution
of finite element equations,
(transparencies 128K)
- J. Dongarra (University of Tennessee and ORNL, USA),
ScaLAPACK: a dense, linear
algebra library for message-passing computers,
(transparencies 175K)
Wednesday September 27 : Parallel methods
- H. Wijshoff (Leiden University, the Netherlands),
An implementation of a
distributed memory direct sparse unsymmetric linear system solver
- A. Gupta (IBM Watson, New York, USA),
Parallel sparse factorization
and triangular solution,
(paper 217K)
- R. Bisseling (Utrecht University, the Netherlands),
Sparse Cholesky factorisation
within the bulk synchronous parallel framework,
(paper 30K)
- P. Amestoy (ENSEEIHT-IRIT, France),
Multifrontal parallel LU and
QR factorizations,
(transparencies 93K)
- S. Kratzer (Bowie, USA),
Data-parallel sparse matrix
factorization,
(transparencies 28K)
Thursday September 28 : Reordering and partitioning
Friday September 29 : Sparse matrix factorizations
- J. Barlow (Pennsylvania State University, USA),
Computation of orthogonal factors
of sparse matrices,
(paper 78K)
- J. Gilbert (Xerox Palo Alto Research Center, USA),
A supernodal approach to sparse
partial pivoting
- J. Liu (York University, Canada),
On multisectors in sparse matrix
reorderings,
(transparencies 57K)
- X. Li (University of California, Berkeley, USA),
Sparse Gauss elimination on high
performance machines,
(transparencies 109K)
- D. Pierce (Boeing, Seattle, USA),
Insights and new advances for
rank-revealing factorizations,
(transparencies 52K),
(paper 133K)
- Z. Zlatev (National Environmental Research Institute,
Roskilde, Denmark),
Solving sparse linear least
squares problems on some supercomputers by using a sequence of large
dense blocks,
(transparencies 57K),
(paper 50K),
(paper 74K)
Local organizing committee
Iain Duff (CERFACS and RAL), Valerie Fraysse (CERFACS), Luc Giraud (CERFACS), Jacko Koster (CERFACS), Chiara Puglisi (CERFACS),
and Dominique Rault (CERFACS).
Location
The workshop took place in the UNESCO centre in
Toulouse.
Local transport was supported by
For more information, please contact:
ILAY Secretariat
CERFACS Fax : (+33) 5-61-19-30-00
Parallel Algorithms Project
42 Avenue G. Coriolis Email : wlay@cerfacs.fr
31057 Toulouse CEDEX
France
ILAY home page
Parallel Algorithms Team home page
Last Update: