pith. sign in

arxiv: 1712.06271 · v1 · pith:7FTZOZDPnew · submitted 2017-12-18 · 🧮 math.NA

An Artificial Compressibility Ensemble Timestepping Algorithm for Flow Problems

classification 🧮 math.NA
keywords ensemblealgorithmartificialcalculationscompressibilitycomputationalfirst-orderincrease
0
0 comments X
read the original abstract

Ensemble calculations are essential for systems with uncertain data but require substantial increase in computational resources. This increase severely limits ensemble size. To reach beyond current limits, we present a first-order artificial compressibility ensemble algorithm. This algorithm effectively decouples the velocity and pressure solve via artificial compression, thereby reducing computational complexity and execution time. Further reductions in storage and computation time are achieved via a splitting of the convective term. Nonlinear energy stability and first-order convergence of the method are proven under a CFL-type condition involving fluctuations of the velocity. Numerical tests are provided which confirm the theoretical analyses and illustrate the value of ensemble calculations.

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.