2014
DOI: 10.1615/int.j.uncertaintyquantification.2014007691
|View full text |Cite
|
Sign up to set email alerts
|

An Algorithm for Fast Calculation of Flow Ensembles

Abstract: This report presents an algorithm for computing an ensemble of p solutions of the Navier-Stokes equations. The solutions are found, at each timestep, by solving a linear system with one shared coefficient matrix and p right hand sides, reducing both storage required and computational cost of the solution process. The price that must be paid is a timestep condition involving the timestep and the size of the fluctuations about the ensemble mean. Since the method is a one step method and the timestep condition in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

2
89
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
8

Relationship

6
2

Authors

Journals

citations
Cited by 80 publications
(91 citation statements)
references
References 24 publications
2
89
0
Order By: Relevance
“…In such applications, spatial resolution is often sacrificed to reduce the total computational time. For these reasons the development of efficient methods that allow for fast calculation of flow ensembles at a sufficiently fine spatial resolution is of great practical interest and significance.Only recently, a first step was taken in [22,23] where a new algorithm was proposed for computing an ensemble of solutions of the time-dependent Navier-Stokes equations (NSE) with different initial condition and/or body forces. At each time step, the new method employs the same coefficient matrix for all ensemble members.…”
mentioning
confidence: 99%
“…In such applications, spatial resolution is often sacrificed to reduce the total computational time. For these reasons the development of efficient methods that allow for fast calculation of flow ensembles at a sufficiently fine spatial resolution is of great practical interest and significance.Only recently, a first step was taken in [22,23] where a new algorithm was proposed for computing an ensemble of solutions of the time-dependent Navier-Stokes equations (NSE) with different initial condition and/or body forces. At each time step, the new method employs the same coefficient matrix for all ensemble members.…”
mentioning
confidence: 99%
“…Stability tests. Next, we check the stability of our algorithm by considering the problem of a flow between two offset circles [11,12,14,15]. The domain is a disk with a smaller off-center obstacle inside.…”
Section: Convergence Testmentioning
confidence: 99%
“…The ensemble algorithm we use was first developed in [11] to find a set of J solutions of the Navier-Stokes equations (NSE) subject to different initial condition and forcing functions. The main idea is that, based on the introduction of an ensemble average and a special semi-implicit time discretization, the discrete systems for the multiple flow simulations share a common coefficient matrix.…”
mentioning
confidence: 99%
“…A first order accurate, ensemble algorithm was proposed in [20]. The algorithm results in J linear systems with the same coefficient matrix instead of J linear systems with J different coefficient matrices at each time step, which allows the use of block iterative methods, e.g., [10][11][12]31], to reduce the computing time and required memory substantially.…”
Section: Introductionmentioning
confidence: 99%
“…The algorithm results in J linear systems with the same coefficient matrix instead of J linear systems with J different coefficient matrices at each time step, which allows the use of block iterative methods, e.g., [10][11][12]31], to reduce the computing time and required memory substantially. While efficient, the method of [20] is only first order accurate. In applications such as the climate and ocean forecasts, which involve both turbulent flows and long time integration, higher order methods incorporating turbulence models are indispensable.…”
Section: Introductionmentioning
confidence: 99%