"Complete pivoting ILU:   a  multilevel framework"
    
       Yousef Saad                               
    Dept of computer Science & Eng.           
    University of Minnesota                   

Abstract:
-------

This  talk will discuss  a preconditioning  method based  on combining
two-sided permutations  with a multilevel  approach.  The nonsymmetric
permutation exploits  a greedy  strategy to put  large entries  of the
matrix in the diagonal of the upper leading submatrix.  The method can
be  regarded as  a  complete  pivoting version  of  the incomplete  LU
factorization.   This leads to  an effective  incomplete factorization
preconditioner  for   general  nonsymmetric,  irregularly  structured,
sparse linear  systems.  The algorithm is implemented  in a multilevel
fashion  and borrows  from the  Algebraic Recursive  Multilevel Solver
(ARMS) framework.  Numerical experiments  will be reported on problems
that are known as difficult to solve by iterative methods.