2015
DOI: 10.1016/j.compfluid.2014.11.025
|View full text |Cite
|
Sign up to set email alerts
|

Analysis and application of high order implicit Runge–Kutta schemes to collocated finite volume discretization of the incompressible Navier–Stokes equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(18 citation statements)
references
References 29 publications
0
18
0
Order By: Relevance
“…Recently, Komen et al 76 analyzed five numerical algorithms in finite volume collocated grid solvers for the incompressible Navier-Stokes equations for a selection of explicit (and implicit) Runge-Kutta schemes. They demonstrated that the temporal order reduces to approximately one also for the higher order schemes (except for the high-order method of Kazemi, 78 which however turns out to be very dissipative). Therefore, and for simplicity reasons as mentioned in the Introduction, we describe both projection methods (IFM and CFM) with the explicit Euler method 79 (also called Forward Euler) that is, the original Chorin-Temam algorithm.…”
Section: Explicit Projection Methods (Temporal Discretization)mentioning
confidence: 99%
“…Recently, Komen et al 76 analyzed five numerical algorithms in finite volume collocated grid solvers for the incompressible Navier-Stokes equations for a selection of explicit (and implicit) Runge-Kutta schemes. They demonstrated that the temporal order reduces to approximately one also for the higher order schemes (except for the high-order method of Kazemi, 78 which however turns out to be very dissipative). Therefore, and for simplicity reasons as mentioned in the Introduction, we describe both projection methods (IFM and CFM) with the explicit Euler method 79 (also called Forward Euler) that is, the original Chorin-Temam algorithm.…”
Section: Explicit Projection Methods (Temporal Discretization)mentioning
confidence: 99%
“…We have to note that face residual vector, R f i ( ) is obtained by the discretized form of a SDIRK stage, as in [4]. KazemiKamyab et al [4] showed that this technique allows to avoid temporal order reduction suffered by several implementation techniques analyzed in the present literature. Lastly in this paper we have used stiffly accurate SDIRK schemes having the following feature: a b sj j = .…”
Section: Singly Diagonally Implicit Runge-kutta Methodsmentioning
confidence: 99%
“…Namely, an incompressible explicit projection method together with the classical fourth order Runge-Kutta (RK) and accelerated third order ARK3 time integration schemes have been implemented in OpenFOAM by Vuorinen et al [43] . Higher order implicit RK schemes have been implemented in OpenFOAM by Kazemi-Kamyab et al [18] , together with an incompressible iterated PISO-based procedure. In addition, they used an alternative face velocity interpolation method in order to preserve the formal order of the applied temporal schemes.…”
Section: Introductionmentioning
confidence: 99%
“…In addition, they used an alternative face velocity interpolation method in order to preserve the formal order of the applied temporal schemes. D'Alessandro et al [10] implemented a slight variant of the approach of Kazemi-Kamyab et al [18] in OpenFOAM. Furthermore, they implemented the incompressible explicit RK-based projection algorithm of Sanderse and Koren [31] .…”
Section: Introductionmentioning
confidence: 99%