🚀 go-pugleaf

DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

SCIENTIFIC COMPUTATION SEMINAR

                    -Thursday, October 15, 1992

Youcef  Saad, University of Minnesota, Dept of Computer
Science   -  4-192  EE/CS  Bldg.,  200  Union  St.  SE,
Minneapolis, MN, saad@cs.umn.edu will speak on "ILUM: a
masively   parallel   multi-elimination  incomplete  LU
factorization".

TIME:                 3:30-4:30 p.m.

ROOM:                 DC 1304

ABSTRACT

Proconditioned  Krylov subspace  techniques are rapidly
gaining  ground against  direct solvers in the solution
of   large   sparse   linear   systems   arising   from
3-dimensional  models.  When implementing these methods
on  parallel   machines    one  faces  the   difficulty
that    the   standard  preconditioners    are    often
sequential   and   can   cause  serious bottlenecks. In
this  talk  we will consider several different  ways of
circumventing    the   difficulty.   A   new   approach
called    ILUM   which   allows   a   high   degree  of
parallelism   is  presented.   This  approach is formed
and the process  is recursively repeated a  few  times.
In  order  to avoid  a large  amount of  fill-in during
this  elimination process, a dropping strategy is added
thus   providing   an  incomplete factorization similar
to  ILUT  and   other   strategies  introduced  in  the
literature.  A  few  preliminary  numerical experiments
will be presented.