Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Analysis of a Stabilized CNLF Method with Fast Slow Wave Splittings for Flow Problems

Journal Article · · Computational Methods in Applied Mathematics
 [1];  [2]
  1. Missouri Univ. of Science and Technology, Rolla, MO (United States)
  2. Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

In this work, we study Crank-Nicolson leap-frog (CNLF) methods with fast-slow wave splittings for Navier-Stokes equations (NSE) with a rotation/Coriolis force term, which is a simplification of geophysical flows. We propose a new stabilized CNLF method where the added stabilization completely removes the method's CFL time step condition. A comprehensive stability and error analysis is given. We also prove that for Oseen equations with the rotation term, the unstable mode (for which u(n+1) + u(n-1) equivalent to 0) of CNLF is asymptotically stable. Numerical results are provided to verify the stability and the convergence of the methods.

Research Organization:
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
Sponsoring Organization:
USDOE
Grant/Contract Number:
AC05-00OR22725
OSTI ID:
1335320
Journal Information:
Computational Methods in Applied Mathematics, Journal Name: Computational Methods in Applied Mathematics Journal Issue: 3 Vol. 15; ISSN 1609-4840
Publisher:
de GruyterCopyright Statement
Country of Publication:
United States
Language:
English

Similar Records

A Crank–Nicolson Leapfrog stabilization: Unconditional stability and two applications
Journal Article · Mon Dec 08 23:00:00 EST 2014 · Journal of Computational and Applied Mathematics · OSTI ID:1335314

A semi-implicit, energy- and charge-conserving particle-in-cell algorithm for the relativistic Vlasov-Maxwell equations
Journal Article · Wed Jan 15 23:00:00 EST 2020 · Journal of Computational Physics · OSTI ID:1770109

Note on two formulations of Crank-Nicolson method for Navier-Stokes equations
Journal Article · Wed Dec 11 23:00:00 EST 2024 · Numerical Algorithms · OSTI ID:2502172