pith. sign in

arxiv: astro-ph/0309577 · v1 · submitted 2003-09-22 · 🌌 astro-ph

A method for relaxing the CFL-condition in time explicit schemes

classification 🌌 astro-ph
keywords explicitmethodsmethodtimeadoptingarbitrarycfl-conditionefficiently
0
0 comments X
read the original abstract

A method for relaxing the CFL-condition, which limits the time step size in explicit methods in computational fluid dynamics, is presented. The method is based on re-formulating explicit methods in matrix form, and considering them as a special-Jacobi iteration scheme that converge efficiently if the CFL- number is less than unity. By adopting this formulation, one can design various solution methods in arbitrary dimensions that range from explicit to unconditionally stable implicit methods in which CFL-number could reach arbitrary large values. In addition, we find that adopting a specially varying time stepping scheme accelerates convergence toward steady state solutions and improves the efficiently of the solution procedure.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.