[ut.na] truncated NA-NET message

krj@na.toronto.edu (Ken Jackson) (03/28/89)

Somehow the mail system lost the first section of the following NA-NET 
article.  If I can recover the lost portion, I will repost this message.

							krj
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

TENDANCE

      I plan to attend the ILAS Inaugural Conference.

      I don't plan to attend the ILAS Inaugural Conference.

2. ACCOMODATION and BOARD:

      I have returned the Housing form to BYU

      I have not returned the Housing form.

      Please send information on off-campus housing.

3. TALK:

      I wish to give a contributed talk.
      Title and abstract, typed on one page only, should be
      sent by July 1 to

                     Wayne Barrett
                     Department of Mathematics
                     Brigham Young University
                     Provo, Utah 84602
                     U.S.A.

4. LUCHEON BUFFET:

      I plan to attend the luncheon buffet on August 13.

5. MEMBERSHIP IN ILAS:

      I wish to become a member of ILAS.

      I wish to become a member of ILAS.
      Please waive my membership fee.

6. PAYMENT:

      Luncheon buffet($15) 
                    
      ILAS membership($12)

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

From: Jack Dongarra <dongarra@antares.mcs.anl.gov>
Date: Wed, 22 Mar 89 07:31:57 CST
Subject: Argonne Wilkinson Fellow Named

   EWERBRING NAMED AS WILKINSON FELLOW IN COMPUTATIONAL MATHEMATICS

L. Magnus Ewerbring of Cornell University has been named the 1989-90 
Wilkinson Fellow in Computational Mathematics.  The fellowship is awarded 
by the Mathematics and Computer Science Division at Argonne National Laboratory
to a young scientist actively engaged in computational mathematics and parallel 
computing research.  Ewerbring will join the Mathematics and Computer Science
Division for a one-year term beginning in September 1989.

Ewerbring will receive a Ph.D. degree from Cornell University in August 1989.  
For his thesis, he has derived generalizations of the singular value 
decomposition that have important applications in canonical correlations and 
are well suited for parallel machines.  In addition to conducting his doctoral 
research, he has worked at Thinking Machines Corp.  developing code for linear 
algebra routines on the massively parallel Connection Machine.  As part of his 
research there, Ewerbring devised techniques for ensuring that data are 
efficiently mapped onto processors, realizing a savings in computation time of 
up to 33 percent.

Currently, Ewerbring is a Graduate Fellow of the Mathematical Sciences 
Institute at Cornell University.

The Wilkinson Fellowship was created by Argonne's Mathematics and Computer 
Science Division in memory of Dr. James Hardy Wilkinson, F.R.S., who for
many years acted as a consultant and guiding spirit for such efforts as the 
EISPACK and LINPACK projects.  The fellowship is intended to assist a young 
scientist who is actively engaged in state-of-the-art research in computational
mathematics, numerical linear algebra, and parallel computing.

Further information about the fellowship can be obtained from Jack Dongarra;
Argonne National Laboratory, Argonne, Illinois 60439; dongarra@mcs.anl.gov.


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

From: John Lewis <@atc.boeing.com:jglewis@priapus>
Date: Wed, 22 Mar 89 07:55:58 PST
Subject: Program for SIAM Symposium on Sparse Matrices

				PROGRAM
		   SIAM SYMPOSIUM ON SPARSE MATRICES
			 SALISHAN LODGE, OREGON
                             MAY 22-24, 1989

The program for the SIAM Symposium on Sparse Matrices is attached.
Further information on the meeting can be obtained from SIAM
at `na.siam@na-net.stanford.edu' or from John Lewis at `na.lewis...'.

==================================================================

Overview:

Talks selected for extended presentations are given in pairs, each
talk consisting of a 40 minute presentation and a five minute
question period.  Extended presentations will be given in the
Longhouse Ballroom.

Formal workshop sessions comprise five or six standard presentations,
each 15 minutes followed by a five minute question period.
Prescheduled workshop sessions will be given in the forward part of
the Ballroom (rooms B and C) and in the Cedar Tree Room.

Facilities will be provided for participants to organize their own
informal workshops to extend the discussions of the formal workshops
or to address topics not otherwise addressed in the formal
presentations.  The Sunset Suite will be available at all times for
scheduling small impromptu workshops.  The Cedar Tree Room will be
available during the extended presentations, and the rear part of the
Ballroom (room A) can be used for additional parallel workshops
during formal workshop sessions. These rooms will be reserved on a
first-come first-serve sign-up basis.

======================================================================

                                  Sunday, May 21

 8:00 - 10:00  Reception and Beer Party (Sunset Suite)   

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

                                  Monday, May 22

 8:30 - 10:00  J. Grcar, Operator Coefficient Iterations
               C.-C. Kuo, C. Tong and T. Chan, Multilevel Filtering (MF)
                    Preconditioners for Elliptic Problems
10:00 - 10:30  coffee
10:30 - 12:00  C. Ashcraft, Exploiting Structure in Sparse Matrix
                    Computations:  The Domain/Segment/Separator Model
               P. Amestoy and I. Duff, Efficient and Portable
                    Implementation of a Multifrontal Method on a range of
                    MIMD Computers
12:00 -  2:00  lunch
 2:00 -  4:00  workshops: Iterative Methods for General Systems
                          Least Squares Problems
 4:00 -  4:30  coffee
 4:30 -  6:00  B. Parlett and H. Chen, Damped Oscillations and Hermitian
                    Pencils
               A. Ruhe, How to use Spectral Transformation on Sparse
                    Nonlinear and Nonsymmetric Eigenvalue Problems
 6:00 -  8:00  dinner
 8:00 - 10:00  workshops: Sparse Matrix Standards:  Sparse BLAS2 and Beyond
                          Engineering Applications

     -----------------------------------------------------------------
                                     
                                  Tuesday, May 23

 8:30 - 10:00  E. Ng, A Comparison of Some Methods for Solving Sparse
                    Nonsymmetric Linear Systems
               T. Davis and P-C Yew, A Stable Parallel Algorithm for
                    General Unsymmetric Sparse LU Factorization
10:00 - 10:30  coffee
10:30 - 12:00  M. Arioli, J. Demmel and I. Duff, Condition Numbers and
                    Backward Error Analysis in Solving Sparse Systems
               D. Gay and M. Wright, Remedying Normal-Equations Failures in
                    Interior-Point Algorithms for LP
12:00  - 2:00  lunch
 2:00 -  4:00  workshops: Implementation of General Direct Solvers
                          Eigenvalue Problems
 4:00 -  4:30  coffee
 4:30 -  6:00  J. Lewis, B. Peyton and A. Pothen, A Fast Algorithm for
                    Reordering Sparse Matrices for Parallel Factorization
               A. Pothen and H. Simon, Partitioning Sparse Matrices with
                    Eigenvectors of Graphs
 6:00 -  8:00  clambake
 8:00 - 10:00  workshops: Reordering for Sparse Cholesky Factorization
                          Iterative Algorithms for Symmetric Systems

     -----------------------------------------------------------------
                                     
                                 Wednesday, May 24

 8:30 - 10:00  C. Ashcraft, S. Eisenstat, J. Liu and A. Sherman, Three
                    Distributed Sparse Factorization Algorithms
               J. Gilbert and R. Schreiber, Highly Parallel Sparse Cholesky
                    Factorization
10:00 - 10:30  coffee
10:30 - 11:30  workshops: Tools for Sparse Matrix Computations
                          Parallel Solution of Triangular Systems
11:30 -  1:15  lunch
 1:15 -  3:15  workshops: Implementation of Sparse Cholesky Factorization
                          Reordering for Sparse LU Factorization
 3:15 -  3:30  coffee
 3:30 -  5:00  R. Freund, Conjugate Gradient Type Methods for Linear
                    Systems with Complex Coefficient Matrices
               S. Ashby, Adaptive Polynomial Preconditioning for Hermitian
                    Linear Systems
 5:00 -  7:00  impromptu workshops / nature walk
 7:00 -  8:00  Stragglers Buffet
 8:00 - 10:00  Informal Oregon Wine Tasting (Sunset Suite)

     -----------------------------------------------------------------
     -----------------------------------------------------------------
                                     
                                 WORKSHOPS
                                     
                             Monday Afternoon

Iterative Methods for General Systems:
     T. Chan, Fourier Analysis of Blended Incomplete Factorization
          Preconditioners
     R. Freund and Y. Saad, A Comparison of Polynomial Based Iterative
          Methods for Large Nonsymmetric Linear Systems
     A. Sameh and Z. Zlatev, A Robust Parallel Linear System Solver
     H. Elman, Block Iterative Methods for Cyclically Reduced Elliptic
          Problems
     A. Baker, W. Noronha and E. Wachspress, Consistent Sparse
          Factorization of Elliptic Difference Equations
     W. Tang, Relief from the Pain of Overlap --- Generalized Schwarz
          Splittings

Least Squares Problems:
     D. O'Leary, On Iteratively Reweighted Linear Least Squares Problems
     P. Raghavan and A. Pothen, Parallel Orthogonal Factorization
     E. Chu and A. George, Parallel Orthogonal Decomposition of Large
          Sparse Matrices
     C. Johnson, D. Olesky and P. vandenDriessche, Sparsity Analysis for
          the QR Factorization
     J. Barlow, The Accurate Solution of Sparse Weighted and Equality
          Constrained Least Squares Problems Using a Static Data Structure


                              Monday Evening
                                     
Engineering Applications:
     A. Coon and M.Stadtherr, Sparse Matrix Methods for the Parallel
          Solution of Equation-Based Chemical Process Flowsheeting Matrices
     R. Tewarson and J. Stephenson, Use of Sparse Matrix Techniques in
          Fluid Flow Networks
     B. Nour-Omid, M. Wright and R. Calalo, Partitioning Finite Element
          Mesh for Concurrent Computing
     P. Bjorstad, Iterative Substructure Algorithms in a Large Scale
          Structural Analysis Code - Will it ever be Practical?
     J. Braekhus, Design and Experience with an Algorithm for Parallel
          Block Linear Algebra on Shared Memory Architecture
     A. Hvidsten, On Parallelizing a very large Finite Element Structural
          Analysis Program

Sparse Matrix Standards:  Sparse BLAS2 and Beyond:
     S. Ashby and M. Seager, A Proposed Standard for Iterative Linear
          Solvers
     T. Oppe and D. Kincaid, Sparse Iterative BLAS
     G. Radicatti, Vectorization and Storage Schemes for Irregular Sparse
          Matrices
     I. Duff, Sparse BLAS2: the way forward or the way back
     R. Grimes, BLAS for the Supernodal General Sparse and Multifrontal
          Methods
     R. Grimes, Sparse Matrix Vector Multiplication for the Lanczos
          Algorithm
     I. Duff, R. Grimes and J. Lewis, The Boeing-Harwell Sparse Matrix Test
          Collection -- an update


                             Tuesday Afternoon
                                     
Implementation of General Direct Linear Equation Solvers:
     S. Wright, Parallel Solvers for General Banded Systems
     G.-C. Yang, DSpack:  A Direct Sparse Matrix Software Package for
          Shared-Memory Parallel Machines
     I. Duff and J. Reid, MA48 - A New Package for Solving Sparse
          Unsymmetric Sets of Linear Equations
     Y-A Fan, A. Horvath, J. Li, D. Neaderhouser and P. Smith, A General
          Sparse Matrix Solver
     U. Suhl, L. Aittoniemi and J. Su, Computing LU-Factorizations for
          Large Sparse General Matrices
     F. Gustavson, Aspects of Dense Sparse LU Factorizations for Vector
          Processing

                                     
Eigenvalue Problems:
     J. Barlow and J. Demmel, Computing Accurate Eigensystems of Scaled
          Diagonally Dominant Matrices
     R. Morgan, Computing Interior Eigenvalues of Large Matrices
     J. Cullum and R. Willoughby, A Shift and Invert Strategy for Lanczos
          Procedures
     R. Pantazis and D. Szyld, Parallel Algorithms for the Banded Symmetric
          Eigenvalue Problem Ax = lambda Bx
     K. Gates, Efficient Eigenvalue Solvers for a Hypercube Multiprocessor


                              Tuesday Evening

Reordering for Sparse Cholesky Factorization:
     J. Grcar, Matrix Stretching
     H. Simon, A Parallel Iterative Algorithm for Envelope Reduction
     A. Yeremin, Multilevel Cross Merging Algorithms for High Order Finite
          Element Problems
     B. Peyton, A Tie-Breaking Scheme for the Minimum Degree Algorithm
     E. Zmijewski, Communication-Reducing Nested Dissection Orderings for
          Parallel Sparse Cholesky Factorization
     F.Alvarado, D. Yu  and R. Betancourt, Ordering Schemes for Partitioned
          Sparse Inverses

Iterative Algorithms for Symmetric Systems:
     A. Greenbaum and G. Rodrigue, Optimal Preconditioners of a Given
          Sparsity Pattern
     J. Cosgrove, J. Diaz and A. Griewank, Approximate Inverse
          Preconditionings for Sparse Linear Systems
     A. Ramage and A. Wathen, On Element Preconditioning for Galerkin
          Finite Element Equations
     P. Frederickson and H. Simon, Totally Parallel Multilevel Algorithms
     E. Kaasschieter, A General Finite Element Preconditioning for The
          Conjugate Gradient Method
     G.-Y.  Lei, Preconditioned CG Methods Based on Ordering and Gaussian
          Elimination

                             Wednesday Morning

Tools for Sparse Matrix Computations:
     Y. Saad, SparsKit: a basic tool kit for sparse matrix computations
     Y. Saad and H. Wijshoff, A Comparative Study of the CRAY Family of
          Supercomputers using a Sparse Benchmark Package
     F. Alvarado, The Sparse Matrix Manipulation System

Parallel Solution of Triangular Systems:
     S. Hammond and R. Schreiber, Efficient ICCG on a Shared Memory
          Parallel Processor
     J. Saltz, Solution of Sparse Triangular Systems on a Range of Parallel
          Architectures
     R. Bisseling, Parallel Solution of Sparse Triangular Systems on a Mesh
          of Transputers
     
     
                            Wednesday Afternoon
                                     
Implementation of Sparse Cholesky Factorization:
     J. Liu, Sparse Matrix Factorization by Rows
     C. Bischof, J. Lewis and D. Pierce, An Incremental Condition Estimator
          for Sparse Triangular Matrices and Applications
     G. Geist and E. Ng, A Partitioning Strategy for Sparse Matrix
          Factorization on Multiprocessors
     H. Simon, P. Vu and C. Yang, Sparse Matrix Factorization at 1.68
          GFLOPS
     D. Warner, The Clique-Tree Algorithm and Its Implications for
          Parallel-Vector Architectures
     P. Sadayappan, Distributed Sparse Factorization of Circuit Matrices
          via Recursive E-tree Partitioning

Reordering for Sparse LU Factorization:
     P. Aitchison, Tearing and Sparse Matrix Computations
     M. Bravo, C. Maulino and O. Ordaz, Quotient Bipartite Graph Model in
          the Solution of AX = B
     S. Buitrago, O. Jimenez and C. Maulino, Ordering Techniques for Sparse
          Linear Systems arising in Reservoir Simulation
     C. Johnson, Principal Submatrices and Structure of Sparse Matrices
     D. Wise and P. Beckman, Selecting Pivots under Quadtree Matrix
          Representation
     E. Ganuza, An Implementation in Microcomputers of the Lexicografic
          Algorithm


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

From: David Levine <levine@antares.mcs.anl.gov>
Date: Thu, 23 Mar 89 11:25:43 CST
Subject: Argonne Parallel Programming Class

Argonne National Laboratory has set up the Advanced Computing Research
Facility (ACRF) for the study of parallel computing.  To encourage the
use of the ACRF,  Argonne offers classes on parallel computing to
familiarize potential users with the ACRF multiprocessors and parallel
programming in general.  The next class will be held May 3-5, 1989.
Topics to be covered include:

1) Parallelizing compilers.
2) The Monitor and Schedule packages for portable parallel programming.
3) Hypercube programming.
4) DAP Programming.
5) Connection Machine Programming.

A portion of the third day will be devoted to each attendee's particular
project.  The format of the course is alternating lectures and hands-on
work with the parallel computers in the ACRF.  At its completion participants
will have written and run programs on each machine, and should be familiar
with the ACRF environment.  Fortran will be emphasized as the primary
programming language.  Knowledge of Fortran and Unix will be assumed.

Parallel computers currently in the ACRF are:

    4-processor Ardent Titan
    8-processor Alliant FX/8
   16-processor Intel iPSC-VX hypercube
   20-processor Encore Multimax
   24-processor Sequent Balance 21000
   32-processor Intel iPSC hypercube
 1024-processor Active Memory Technology DAP
16384-processor Thinking Machines CM-2

Those interested in the classes should contact

Teri Huml
Mathematics and Computer Science Division
Argonne National Laboratory
Argonne, IL  60439-4844
(312) 972-7163
huml@mcs.anl.gov

There will be a $25.00 registration fee per person for universities,
federal laboratories and government organizations and $100.00 for
industrial corporations.


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

From: E. C. Gartland <gartland%kent.edu@relay.cs.net>
Date: Thu, 23 Mar 89 18:40:34 EST
Subject: Varga Conference, Final Announcement

			   
			       A Conference On

              APPROXIMATION THEORY AND NUMERICAL LINEAR ALGEBRA
	      
	                 in honor of Richard S. Varga
                     on the occasion of his 60th birthday
		    
                       March 30, 31, and April 1, 1989
		       
                            Kent State University
                               Kent, Ohio  USA

PROGRAM:
  Thursday AM:
    G. Birkhoff,     "Some Current Questions on Solving Elliptic Problems."
    L.A. Hageman,    "An Eigenvalue Bound for Doubly Cyclic Matrices."
    P.G. Ciarlet,    "A New Class of Variational Problems Arising in the
                      Modeling of Elastic Multi-Structures."
    L.N. Trefethen,  "Non-Normal Matrices and Approximate Eigenvalues."
  Thursday PM:
    J.W. Jerome,     "Hierarchical Semiconductor Modeling: Analytical Results
                      for Discretization and Approximation."
    G.G. Lorentz,    "Bivariate Interpolation."
    L.L. Schumaker,  "On Multivariate Splines."
  Friday AM:
    R.J. Plemmons,   "Substructuring and Nullspace Methods for Equilibrium
                      Equations."
    W.C. Rheinboldt, "On a Computational Method for the Second Fundamental
                      Tensor and its Application to Bifurcation Problems."
    T.J. Rivlin,     "Some Algebraic Aspects of the Chebyshev Polynomials."
    A. Sharma,       "Equiconvergence of Some Complex Interpolatory
                      Polynomials."
    J. Szabados,     "Fine and Rough Theory for the Derivatives of Lagrange
                      Interpolation."
  Friday PM:
    M.H. Gutknecht,  "Modified Moments for Nonpositive Weight Functions."
    H. Berens,       "A Globally Lipschitz-Continuous Selection of the Metric
                      Projection in Matrix Approximation."
    Y.A. Kuznetsov,  "Matrix Iterative Analysis in Subspaces."
  Saturday AM:
    G.L. Csordas,    "Convexity and the Riemann Hypothesis."
    D. Gaier,        "The Bieberbach Polynomials in Conformal Mapping."
    W. Gautschi,     "Vandermonde Matrices on the Circle."
    Cai D.-Y.,       "Structural Singular Values of Matrices."
  Saturday PM:
    W. Niethammer,   "Results from Approximation Theory Applied to Problems
                      in Numerical Linear Algebra."
    E.B. Saff,       "Weighted Analogues of Capacity, Transfinite Diameter,
                      and Chebyshev Constants."

  In addition, there will be 30 contributed papers presented in parallel
sessions.  All talks will be in Henderson Hall on the Kent State University
Campus.

SOCIAL FUNCTIONS:
  Thursday, 5:00--7:00 p.m., Reception (KSU Student Center).
  Friday, 7:00 p.m., Conference Banquet (KSU Student Center).
  Saturday, 6:30--7:30 p.m., Recital (Per Enflo, Ludwig Recital Hall).
            8:00 p.m., Reception hosted by Prof. and Mrs. Varga (Twin Lakes
                       Country Club).

  The conference is being sponsored by Kent State University, the Department
of Mathematical Sciences and the Institute for Computational Mathematics.
It is being co-sponsored by the Society for Industrial and Applied Mathematics,
and it has the endorsement of the International Mathematical Union.  External
support is being provided by the Air Force Office of Scientific Research,
The U.S. Department of Energy, and the National Science Foundation, with
additional funding by the Central States Universities, Inc., and the Kent State
Research Council and Office for Institutional Advancement.

INFORMATION: E.C. Gartland, Jr. (Varga Conference)
             Department of Mathematical Sciences
	     Kent State University
	     Kent, OH 44242  USA

E-mail: gartland@kent.edu
        egartlan@kentvm.bitnet


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

From: Boleslaw Szymanski <szymansk@turing.cs.rpi.edu>
Date: Fri, 24 Mar 89 07:21:12 EST
Subject: Fifth Parallel Circus

			FIFTH PARALLEL CIRCUS
     Rensselaer Polytechnic Institute, Troy, NY, April 28-29, 1989

THEME: Parallel Numerical Algorithms, Programming Tools and Applications.

OBJECTIVE: The meeting is an informal gathering of researchers interested 
in parallel processing.  The intention is to discuss recent results in the
area and exchange ideas for future work.  The atmosphere is casual. The
speakers are chosen at the beginning of the circus.  To encourage discussion,
there are no formal proceedings. We expect that about 60 people will be
in attendance and therefore no parallel sessions are planned.

HISTORY: The circus has been held twice a year for two days duration, on 
Fridays and Saturdays. The first Parallel Circus was held in May 1987 at 
Yale University (chaired by Prof. M. Shultz), the second at Cornell University 
in November 1987, (chaired by Prof. Van Loan), the third was organized
by V. Sonnad at IBM Kingston (chaired by Prof. G. Golub and M. Schultz), 
and the fourth was held at Rutgers University in December 1988 (chaired by 
Prof. G. Golub and Prof. A. Gerasoulis).

PLACE: The Fifth Parallel Circus is being organized by Rensselaer Polytechnic
Institute and will be held on the Rensselaer campus, Troy, New York 
(chaired by G. Golub and M.Schulz and organized by Joseph Flaherty and Bolek
Szymanski).  Troy is part of tri-city area of Albany-Schenectady-Troy located
at the center of New York State.  It is easily accessible via plane (Albany
airport), train and automobile.

CONTACTS: If you wish to attend, please contact Joseph E. Flaherty or Bolek 
Szymanski as soon as possible. 
PHONES: 518-276-2714, or 518-276-8291, 
E-MAIL: flaherje@turing.cs.rpi.edu, or szymansk@turing.cs.rpi.edu,
ADDRESS: Department of Computer Science
         Rensselaer Polytechnic Institute
         Troy, NY 12180-3590

If you wish to present your work at the meeting, please include the 
title of your talk in your message.

We have reserved a block of rooms for attendees at the Super 8 Motel 
for $36.88 a night (telephone: 518-274-8800). The Motel is located in 
Troy within walking distance of the campus.

We hope that you will be able to attend and we look forward to seeing you at
the meeting.

Joesph Flaherty and Bolek Szymanski


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


From: Per Christian Hansen <hansen@math.ucla.edu>
Date: Fri, 24 Mar 89 08:58:37 PST
Subject: Danish Summer School in Supercomputing

    The Danish Computing Centre for Research and Education (UNI-C),
             The Technical University of Denmark (DTH) and
                      The Danish Research Academy

                              invites to

              T H E   1 9 8 9   S U M M E R   S C H O O L
                                  in
                            Supercomputing

       Numerical methods. Applications in chemistry and seismic.

              Monday 14th - Wednesday 23rd of August 1989

                          UNI-C
                          DTH, Building 305
                          DK-2800 LYNGBY
                          DENMARK

UNI-C, DTH and The Danish Research Academy  are pleased to announce the
1989 Summer School in applied numerical methods  on parallel and vector
type computers.   The summer school  is financially  supported  by  The
Danish Research Academy  and the  DP Capacity Board of  The Danish Min-
istry for Education.

The school comprises six series of classes  within chemical simulation,
quantum  chemical calculations of electron orbits,  seismic methods and
general numerical algorithms  for vector and  parallel computers.   The
lectures  will be given  by international  recognized researchers,  and
provide an inspiring insight  into the prospects and challenges of com-
puter applications of modern numerical methods.

Application workshops on  afternoons and evenings  include tutorials in
using  UNI-C's computers, an Amdahl VP1100 vectorprocessor w/ 128 Mbyte
central  memory  and an Alliant FX/8.   In addition  there is an  Intel
Hypercube,  kindly lent  by the Department of  Computer Science  at The
University of  Copenhagen,  and  an  Ardent Titan  graphical supermini,
which is placed at our disposal from High Tech Systems, Ballerup.

Participants  are requested to bring their own FORTRAN programs for the
exercises,  and use this opportunity  to install and optimize their ap-
plication program  on one or  more parallel type computers,  guided and
instructed by the guest lecturers and UNI-C staff.

UNI-C  is situated  on the  Technical University  of Denmark campus  in
Lyngby, a northern suburb of Copenhagen, 12 km from Central Copenhagen.
UNI-C was established  by a merger of three major  University Computing
Centres, Copenhagen, Aarhus and Lyngby to form one supercomputer centre
for Denmark.  Besides the Amdahl VP1100 with 30 Gbytes of disk storage,
UNI-C has an IBM 3081,  a UNISYS 1100/92, a CDC Cyber,  an Alliant FX/8
and several VAX'es.


Guest professors:

  Dr. Jeremy du Croz (JC)
  N.A.G. Ltd.
  Dr. du Croz will talk on how to  provide efficient portable numerical
  software for supercomputers.  Particular topics include level 2 and 3
  BLAS,  applications in  linear algebra  and nonlinear  problems,  the
  LAPACK project, FFT's, quadrature and random number generators.

  Dr. Iain Duff (ID)
  AERE, Harwell and CERFACS, France.
  Dr. Duff will talk on the solution of  large sparse systems of linear
  equations, structure and factorisation.

  Dr. David Fincham (DF)
  University of Keele.
  Dr. Fincham  will talk on numerical methods in  chemical modeling and
  simulation.

  Dr. Bengt Fornberg (BF)
  Exxon Research and Engineering Company.
  Dr. Fornberg will talk on  seismic modeling with  special emphasis on
  pseudospectral methods.

  Dr. Michael T. Heath (MTH)
  Oak Ridge National Laboratory, Tennessee, USA
  Dr. Heath will talk on algorithms for (massively) parallel computers.

  Dr. V.R. Saunders (VS)
  SERC, Daresbury, England.
  Dr. Saunders will give lectures on numerical methods in quantum chem-
  ical calculations.

Workshops  and tutorials  in using the various  summer-school computers
will be headed by UNI-C staff.


Enrollment:

The  summer school is  open to Danish,  Nordic  and  International post
graduate  students.  Applications  from other students,  post  doctoral
students and researchers  are welcome, and  applicants will be selected
from those who  are actively working  on projects that  are appropriate
for parallel  and vector type  computing.  Enrollment is  limited to 40
participants.  We expect 20 Danish, 10 Nordic and 10 delegates from the
international research community.

The registration fee is DKR 3000, and covers lunch and lodging at near-
by  student recidence.  Participants wishing to  stay at more luxury or
tourist hotels must pay  their own accomodation expenses.  The partici-
pants may apply for funding of traveling and lodging expenses. The sum-
mer school is free of charge for Danish and Nordic participants.

Persons attending the summer school will be expected to have some expe-
rience  in scientific and numerical modeling on computers.  Preferably,
they should bring  FORTRAN code which represents work in progress.  The
UNI-C staff will provide assistance  in migrating code and data  to the
summer school computers.  The participants are expected to improve this
code during  the workshop sessions assisted by guest  professors, UNI-C
staff and co-participants.

For further information on the 1989 Summer School please contact:

                        Mrs. Mette Soeborg
                        Manager, Education and Training
                        UNI-C, Vermundsgade 5
                        DK-2100 Copenhagen O
                        Telephone:   +45  1 82 83 55
                        Telefax:     +45  2 93 02 20

                  or    Jorgen Moth
                        E-mail: NEUJM @ VM.UNI-C.DK
                        or    : NEUJM @ NEUVM1.BITNET

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

From: Gene H. Golub 415/723-3124 <golub@na-net.stanford.edu>
Date: Tue, 21 Mar 1989 15:07:46 PST
Subject: Additions/Changes to NA-net 

Here is a list of the changes and additions in NA-net since late November.
 == Gene Golub

new(abdali,k,nsf,'kabdali@note.nsf.gov').
new(anderssen,bob,australia,'rsa851@csc1.anu.oz.au').
new(auchmuty,giles,texas,'giles@uhrcc3.crcc.uh.edu').
new(axelsson,owe,nogroup,'u641001%hnykun11.bitnet@forsythe.stanford.edu').
new(bard,jonathan,texas,'jbard@emx.utexas.edu').
new(barrett,wayne,usabitnet,'barrett%byuvax.bitnet@forsythe.stanford.edu').
new(bellovin,mark,stanford,'b.bellovin@macbeth.stanford.edu').
new(berman,avi,israel,'mar64aa%technion.bitnet@forsythe.stanford.edu').
new(bruchhaus,jorgen,germany,'mi004%dk0umi1.bitnet@forsythe.stanford.edu').
new(byrne,george,nogroup,'gdbyrne%erenj.bitnet@forsythe.stanford.edu').
new(carey,dr,texas,'carey@emx.cc.utexas.edu').
new(carletta,joan,cornell,'carletta@tesla.ee.cornell.edu').
new(caussignac,ph,switzerland,'caussignac@elma.epfl.ch').
new(chandler,graeme,australia,'gac@axiom.maths.uq.oz.au').
new(coxson,pam,lbl,'pgcoxson@lbl.gov').
new(dean,ed,texas,'dean@uhrcc3.crcc.uh.edu').
new(descloux,j,switzerland,'caussignac@elma.epfl.ch').
new(dickinson,bradley,princeton,'bradley@ivy.princeton.edu').
new(du,qiang,illinois,'du%zaphod@gargoyle.uchicago.edu').
new(edwards,bruce,nogroup,'be@mathlab.math.ufl.edu').
new(elise,kapenga,nogroup,'elise@cs.wmich.edu').
new(erim,na,nogroup,'na-mail@csd360b.erim.org').
new(eyssallenne,rafael,nyu,'eyssalle@acf4.nyu.edu').
new(forney,glenn,nist,'gpfrn%nbs.bitnet@forsythe.stanford.edu').
new(frommer,andreas,germany,'ae13%dkauni46.bitnet@forsythe.stanford.edu').
new(gao,feng,canada,'gao@cs.ubc.ca').
new(garbarino,joe,nogroup,'jgarb@erim.org').
new(gilchrist,martin,uk,'gilchrist@vax.oxford.ac.uk').
new(griffel,xx,uk,'griffel@qgb.bristol.ac.uk').
new(grossman,robert,illinois,'u32964%uicvm.bitnet@forsythe.stanford.edu').
new(gyer,maurice,arizona,'gyerm%tuva.sainet.mfenet@nmfecc.arpa').
new(hadjidimos,apostolos,purdue,'hadjidim@purdue.edu').
new(heilmann,m,germany,'heilmann%dhdibm1.bitnet@forsythe.stanford.edu').
new(herbin,raphaele,switzerland,'astrah@elccb.epfl.ch').
new(heroux,michael,cray,'mamh@galileo.cray.com').
new(higdon,robert,nogroup,'higdon@math.orst.edu').
new(hill,richard,usabitnet,'16705roh%msu.bitnet@forsythe.stanford.edu').
new(hirsh,richard,nsf,'rhirsh@note.nsf.gov').
new(hu,weiping,uk,'me1wh@ibm.sheffield.ac.uk').
new(huckle,thomas,germany,'angm006%dwuuni21.bitnet@forsythe.stanford.edu').
new(hutin,remi,france,'hutin%eps.sdr.slb.com').
new(jiang,hong,usabitnet,'userjang%ualtamts.bitnet@forsythe.stanford.edu').
new(kaps,peter,austria,'c80411%ainuni01.bitnet@forsythe.stanford.edu').
new(keller,herb,caltech,'hbk@ama-1.caltech.edu').
new(koen,bryan,usabitnet,'c484739%umcvmb.bitnet@forsythe.stanford.edu').
new(krishna,amala,stanford,'krishna@na-net.stanford.edu').
new(kumar,swarn,boeing,'skumar@atc.boeing.com').
new(kus,fred,canada,'fred@sscvax.mcmaster.ca').
new(lausanne,na,switzerland,'caussignac@elma.epfl.ch').
new(lee,daeshik,illinois,'dlee@uicsrd.csrd.uiuc.edu').
new(lee,greg,weitek,'greg@weitek.com').
new(leon,steve,usabitnet,'f1leon%semassu.bitnet@forsythe.stanford.edu').
new(leowenthal,dan,usabitnet,'e75%taunos.bitnet@forsythe.stanford.edu').
new(li,jing,imsl,'imsl!jingli@uunet.uu.net').
new(liu,alex,berkeley,'zliu@stat.berkeley.edu').
new(loach,xx,uk,'loach@np1a.bristol.ac.uk').
new(lu,hueiiin,usabitnet,'luhi%fsu.bitnet@forsythe.stanford.edu').
new(manohar,ram,usabitnet,'manohar%sask.bitnet@forsythe.stanford.edu').
new(mathias,roy,usabitnet,'ins_arcm%jhuvms.bitnet@forsythe.stanford.edu').
new(mayer,guenter,germany,'ae09%dkauni46.bitnet@forsythe.stanford.edu').
new(mckenney,alan,nyu,'mckenney@acf8.nyu.edu').
new(merris,russ,lll,'csuh!merris@lll-crg.llnl.gov').
new(messer,james,usabitnet,'james%fsu.bitnet@forsythe.stanford.edu').
new(miller,valerie,usabitnet,'matvam%gsuvm1.bitnet@forsythe.stanford.edu').
new(modi,jagdish,uk,'jm18@phoenix.cambridge.ac.uk').
new(morton,kw,uk,'morton@na.oxford.ac.uk').
new(natarajan,ramesh,ibm,'ramesh@ibm.com').
new(neaga,michael,germany,'ae18%dkauni11.bitnet@forsythe.stanford.edu').
new(nelken,israel,rutgers,'israel@aramis.rutgers.edu').
new(nelson,david,afosr,'nelsond%afsc02.decnet@hqafsc-vax.arpa').
new(oliver,mark,wyoming,'oliver%lode@corral.uwyo.edu').
new(painter,jeff,lll,'painter@lll-crg.llnl.gov').
new(peters,jorg,wisconsin,'jorg@cs.wisc.edu').
new(peters,klaus,nogroup,'kpeters%cdp.uucp@arisia.xerox.com').
new(plassmann,paul,cornell,'plass@amvax.tn.cornell.edu').
new(polito,jonathan,duke,'jep@cs.duke.edu').
new(pryce,john,uk,'pryce@rmcs.cranfield.ac.uk').
new(quak,ewald,usabitnet,'quakeg%vuktrvax.bitnet@forsythe.stanford.edu').
new(radicati,giuseppe,italy,'radicati%iecsec.bitnet@forsythe.stanford.edu').
new(ramage,xx,uk,'ramage@np1a.bristol.ac.uk').
new(rappaz,j,switzerland,'caussignac@elma.epfl.ch').
new(ravachol,michel,texas,'michel@uhrcc3.crcc.uh.edu').
new(ray,scott,llnl,'ray@icdc.llnl.gov').
new(rendl,franz,austria,'rendl@kop.tu-graz.ptt.at').
new(robert,yves,france,'yrobert@ensl.ens-lyon.fr').
new(ruggiero,valeria,italy,'mq2feg23%icineca.bitnet@forsythe.stanford.edu').
new(sanders,richard,texas,'sanders@uhrcc3.crcc.uh.edu').
new(sarker,tk,usabitnet,'ksarkar%sunrise.bitnet@forsythe.stanford.edu').
new(scolnik,hugo,argentina,'hugo@atina.edu.ar').
new(scott,geoff,att,'gcs%pruxd@research.att.com').
new(sehmi,navtej,uk,'sehmi@compsci.bristol.ac.uk').
new(shann,wei-chang,penn-state,'w25@euler.psu.edu').
new(sidilkover,david,israel,'masidilk%weizmann.bitnet@forsythe.stanford.edu').
new(silvester,david,uk,'mcbmsds%cms.umrcc.ac.uk').
new(sinha,pramath,nogroup,'sinha@grasp.cis.upenn.edu').
new(so,joseph,canada,'userjoso%ualtamts.bitnet@forsythe.stanford.edu').
new(sontag,eduardo,rutgers,'sontag@fermat.rutgers.edu').
new(stuart,andrew,uk,'ams@maths.bath.ac.uk').
new(tavener,simon,penn-state,'tavener@cauchy.psu.edu').
new(tranah,xx,uk,'dt105@phoenix.cambridge.ac.uk').
new(turkel,eli,israel,'turkel%taurus.bitnet@forsythe.stanford.edu').
new(vandewalle,stefan,belgium,'stefan%blekul60.bitnet@forsythe.stanford.edu').
new(vaughan,courtenay,sandia,'ctvaugh@sandia.gov').
new(vavasis,steve,cornell,'vavasis@gvax.cs.cornell.edu').
new(venkata,ramana,stanford,'ramana@na-net.stanford.edu').
new(verbeke,johan,belgium,'johan%kulcs.uucp%blekul60.bitnet@forsythe.stanford.edu').
new(wang,zhu,nyu,'wangzh@cmcl2.nyu.edu').
new(washington,na,washington,'na-net-user@cs2.wsu.edu').
new(yasar,osman,wisconsin,'yasar@nucst4.neep.wisc.edu').
new(yeun,xx,canada,'#yeun14@ccm.umanitoba.ca').
new(zehua,chen,yale,'chen-zehua@yale.arpa').
new(zha,hongyuan,germany,'zg6227%db0zib21.bitnet@forsythe.stanford.edu').
new(zhang,naiying,sweden,'naiying@math.chalmers.se').


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

End of NA Digest
**************************
-------

Reposted by

-- 
Kenneth R. Jackson,            krj@na.toronto.edu   (on Internet, CSNet, 
Computer Science Dept.,                              ARPAnet, BITNET)
University of Toronto,         krj@na.utoronto.ca   (CDNnet and other 
Toronto, Canada  M5S 1A4                             X.400 nets (Europe))
(Phone: 416-978-7075)          ...!{uunet,pyramid,watmath,ubc-cs}!utai!krj