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

A family of low dispersive and low dissipative explicit schemes for flow and noise computations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
616
0
1

Year Published

2007
2007
2018
2018

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 806 publications
(629 citation statements)
references
References 33 publications
2
616
0
1
Order By: Relevance
“…Schemes with such undesired property are very sensitive to mesh smoothness. Theses schemes require spatial meshes that are less than 8-10% nonuniform (see [4]; percentage denotes value of relation between lengths of neighboring cells). As the allowed rate of mesh refining/coarsening is exceeded, strong reflected parasite waves are generated by such schemes.…”
Section: Comparison Of Bicompact Schemes With Some Known Numerical Scmentioning
confidence: 99%
See 1 more Smart Citation
“…Schemes with such undesired property are very sensitive to mesh smoothness. Theses schemes require spatial meshes that are less than 8-10% nonuniform (see [4]; percentage denotes value of relation between lengths of neighboring cells). As the allowed rate of mesh refining/coarsening is exceeded, strong reflected parasite waves are generated by such schemes.…”
Section: Comparison Of Bicompact Schemes With Some Known Numerical Scmentioning
confidence: 99%
“…Moreover, these schemes have superior spectral resolution compared to classic symmetric finite difference schemes of the same order of accuracy [1][2][3]. However, the spatial stencil of well-known symmetric compact schemes contains no less than three integer nodes in each space dimension, therefore, these schemes can be used for computations only on uniform or weakly non-uniform meshes [1,4,5].…”
Section: Introductionmentioning
confidence: 99%
“…As in Refs. [3,4,6,7] we consider uniform grids, such that ∆x i = ∆x, and β i j = j − i. Moreover, for internal points, filters are symmetric, and M = N. In that case g i, j becomes independent of the position i of the internal point.…”
Section: Construction Of High-order Conservative Boundary Filtersmentioning
confidence: 99%
“…For the construction of internal filters, the filter coefficients are determined by imposing a number of constraints on the filter transfer function [3,4,6]. Firstly, normalization (12) leads to G(0) = 1.…”
Section: Construction Of High-order Conservative Boundary Filtersmentioning
confidence: 99%
“…20 Fourth-order eleven-point centered finite differences are used for spatial discretization, and a second-order six-stage low-storage Runge-Kutta algorithm is implemented for time integration. 21 To circumvent the severe time-step restriction induced by the cylindrical coordinates, the derivatives in the azimuthal direction around the axis are calculated using every n-th grid point, from n = 2 up to n = 32 at the closest points to the axis. To remove grid-to-grid oscillations, a sixth-order eleven-point centered filtering designed to only damp the shortest waves discretized 22 is applied every time step to the flow variables.…”
Section: B Les Procedures and Parametersmentioning
confidence: 99%