Wednesday, July 16

10:30 AM-12:30 PM
Meyer Library, Forum Room

New Time Integration Algorithms for Solving PDEs

This minisymposium will focus on new time integration algorithms for solving PDEs with various applications. It is well known that explicit algorithms are easy to use, particularly for higher dimensional and nonlinear problems, and straightforward to parallelize. But they are only conditionally stable. Implicit algorithms are unconditionally stable, but more difficult to implement and parallelize. Both algorithms have been widely used for solving various application problems. In this minisymposium, the speakers will discuss the latest development in time integration algorithms, including adaptive method, local time stepping, additive splitting, and new explicit algorithms that are unconditionally stable. These algorithms should be of interest to researchers working in a wide spectrum of applications involving numerical solution of time dependent PDEs.

Organizer: Jianping Zhu
Mississippi State University

10:30 An Adaptive Projection Method for Incompressible Flow
Ann Almgren, Lawrence Berkeley National Laboratory
11:00 The Product Formula Algorithm: An Unconditionally Stable Method for Diffusion and Advection
Frank Graziani, Lawrence Livermore National laboratory
11:30 Semi-Implicit Runge-Kutta Schemes for Transient High-Speed Reacting Flow Simulations
Jack Jai-ick Yoh and Xiaolin Zhong, University of California, Los Angeles
12:00 Local Time Stepping Algorithm for Solving PDEs
Lilun Cao, Mississippi State University and Jianping Zhu, Organizer

AN97 Homepage | Program Updates|
Registration | Hotel and Dormitory Information | Transportation | Program-at-a-Glance | Program Overview

MMD, 6/24/97