High-Order Multirate Explicit Time-Stepping Schemes for the Baroclinic-Barotropic Split Dynamics in Primitive Equations
- Applied and Computational Mathematics Seminar
- Monday, October 4, 2021 - 14:00 for 1 hour (actually 50 minutes)
- Lili Ju – University of South Carolina
To treat the multiple time scales of ocean dynamics in an efficient manner, the baroclinic-barotropic splitting technique has been widely used for solving the primitive equations for ocean modeling. In this paper, we propose second and third-order multirate explicit time-stepping schemes for such split systems based on the strong stability-preserving Runge-Kutta (SSPRK) framework. Our method allows for a large time step to be used for advancing the three-dimensional (slow) baroclinic mode and a small time step for the two-dimensional (fast) barotropic mode, so that each of the two mode solves only need satisfy their respective CFL condition to maintain numerical stability. It is well known that the SSPRK method achieves high-order temporal accuracy by utilizing a convex combination of forward-Euler steps. At each time step of our method, the baroclinic velocity is first computed by using the SSPRK scheme to advance the baroclinic-barotropic system with the large time step, then the barotropic velocity is specially corrected by using the same SSPRK scheme with the small time step to advance the barotropic subsystem with a barotropic forcing interpolated based on values from the preceding baroclinic solves. Finally, the fluid thickness and the sea surface height perturbation is updated by coupling the predicted baroclinic and barotropic velocities. Two benchmark tests drawn from the ``MPAS-Ocean" platform are used to numerically demonstrate the accuracy and parallel performance of the proposed schemes.
The bluejeans link for the seminar is https://bluejeans.com/457724603/4379
- Graph Theory Seminar
- Tuesday, September 28, 2021 - 15:45 for
- Skiles 005
- Misha Lavrov – Kennesaw State University – firstname.lastname@example.org
This talk is motivated by the Erdős–Szekeres theorem on monotone subsequences: given a sequence of $rs+1$ distinct numbers, there is either a subsequence of $r+1$ of them in increasing order, or a subsequence of $s+1$ of them in decreasing order.
We'll consider many related questions with an algorithmic flavor, such as: if we want to find one of the subsequences promised, how many comparisons do we need to make? What if we have to pre-register our comparisons ahead of time? Does it help if we search a longer sequence instead?
Some of these questions are still open; some of them have answers. The results I will discuss are joint work with Jozsef Balogh, Felix Clemen, and Emily Heath at UIUC.