CENTER FOR COMPUTATIONAL MATHEMATICS COLLOQUIUM
                  UNIVERSITY OF COLORADO AT DENVER


TITLE:   Minimization of Computational Work for Elliptic Equations

SPEAKER: E. G. D'Yakonov, Moscow State University

DATE:    Wednesday, March 1, 1995

PLACE:   Math Conference Room - Suite 540
         UCD Building, 1250 14th St., Denver

TIME:    2:30 pm (Refreshments served at 2:15 pm)

ABSTRACT: Minimization of computational work for elliptic and related problems 
is one of the most important and difficult problems of computational 
mathematics.  It has many common features with classical optimization problems 
of approximation theory and numerical integration.  We present results on
constructing computational algorithms with specified asymptotics and using
minimal number of arithmetic operations.

To get such results special modifications of finite element and difference
methods are used for which effective iterative methods with preconditioning,
symmetrization and multigrid acceleration can be applied.