2013
DOI: 10.1016/j.jcp.2013.06.004
|View full text |Cite
|
Sign up to set email alerts
|

Navier–Stokes solver using Green’s functions I: Channel flow and plane Couette flow

Abstract: Numerical solvers of the incompressible Navier-Stokes equations have reproduced turbulence phenomena such as the law of the wall, the dependence of turbulence intensities on the Reynolds number, and experimentally observed properties of turbulence energy production. In this article, we begin a sequence of investigations whose eventual aim is to derive and implement numerical solvers that can reach higher Reynolds numbers than is currently possible. Every time step of a Navier-Stokes solver in effect solves a l… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
16
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(17 citation statements)
references
References 37 publications
(89 reference statements)
1
16
0
Order By: Relevance
“…Each of the gradient ascent procedures described in §3 are of the forṁ 20) where x is the state vector, L is an "easily" invertible linear operator, N is a nonlinear operator, and f is a forcing function. We follow Viswanath & Tobasco (2013) and consider linear multi-step schemes as follows:…”
Section: Temporal Discretisationmentioning
confidence: 99%
See 1 more Smart Citation
“…Each of the gradient ascent procedures described in §3 are of the forṁ 20) where x is the state vector, L is an "easily" invertible linear operator, N is a nonlinear operator, and f is a forcing function. We follow Viswanath & Tobasco (2013) and consider linear multi-step schemes as follows:…”
Section: Temporal Discretisationmentioning
confidence: 99%
“…The Kleiser-Schumann algorithm is a method for solving the modified Stokes problem (3.31), see Kleiser & Schumann (1980) ;Viswanath & Tobasco (2013). Since the modified Stokes problem is linear we solve wave-number by wave-number equations of the form (D 2 − β 2 n )u n = f n −∇p n (A 73) ∇ · u n = 0 (A 74)…”
Section: A3 Kleiser-schumann Algorithmmentioning
confidence: 99%
“…Use an appropriate (inverse) fast transform to evaluate the nonlinear terms on the clustered grid. 4. Solve the resulting linear problem.…”
Section: Introductionmentioning
confidence: 99%
“…In the current paper, we follow a different, more radical approach, which was also investigated by Viswanath [4]. The crucial step is to solve the BVP analytically using Green's function, thereby eliminating the need for numerical differentiation and linear solving altogether.…”
Section: Introductionmentioning
confidence: 99%
“…The main application is to the integration of the Navier-Stokes equation in rectangular geometry and in the turbulent regime. In a companion paper [20], we present a computation of turbulent channel flow that reaches Re τ = 2380 using 10 9 grid points and M = 1024. Only 10 nodes of a small cluster are used in this computation.…”
Section: Introductionmentioning
confidence: 99%