##### Department of Mathematics,

University of California San Diego

****************************

### Center for Computational Mathematics Seminar

## Chris Deotte

#### UCSD

## Modifying Finite Elements to use the Computational Efficiency of Diagonally Implicit Runge-Kutta Methods

##### Abstract:

First I will show how full space time finite elements is similar to solving via fully implicit Runge Kutta methods. Next I will propose a modified finite element method that uses diagonally implicit Runge Kutta methods. I would like to prove that this new method retains the advantages of space time finite elements while reducing the computational complexity. Simulation results with error estimates will be shown that support this claim.

### March 2, 2010

### 10:00 AM

### AP&M 2402

****************************