Computational Math Seminar: Ben O'Neill

Parallel in time Algorithms for PDEs

Ben O'Neill

Applied Mathematics, University of Colorado Boulder

Date and time: 

Tuesday, October 21, 2014 - 10:30am

Location: 

Grandview Conference Room

Abstract: 

Standard sequential time marching schemes limit parallelism to the spacial domain. With computer architectures growing in size and clock speeds remaining constant speed up must come from greater parallelism. We propose a multi-grid reduction method that incorporates temporal parallelism into general time stepping routines allowing for dramatic speed ups on large architectures. Results showing the robustness of the method for both linear and nonlinear parabolic problems will also be presented