Fast Solvers for Higher Order Problems
Tuesday, November 30, 2010 - 9:00am - 9:45am
Keller 3-180
Susanne Brenner (Louisiana State University)
There are two main difficulties in solving higher order elliptic
boundary value problems: the discretization schemes are more
complicated and the discrete problems are very ill-conditioned.
In this talk we will discuss an approach that can solve higher
order problems with an efficiency similar to that for second order
problems. It is based on discontinuous Galerkin methods, embedded
multigrid algorithms and domain decomposition techniques.
boundary value problems: the discretization schemes are more
complicated and the discrete problems are very ill-conditioned.
In this talk we will discuss an approach that can solve higher
order problems with an efficiency similar to that for second order
problems. It is based on discontinuous Galerkin methods, embedded
multigrid algorithms and domain decomposition techniques.
MSC Code:
35J48
Keywords: