Efficient solution of non-Markovian covariance evolution equations in fluid turbulence (Q1105444)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient solution of non-Markovian covariance evolution equations in fluid turbulence |
scientific article |
Statements
Efficient solution of non-Markovian covariance evolution equations in fluid turbulence (English)
0 references
1986
0 references
A method is described for efficient treatment of the time-history effects that arise in closure models constructed by truncation of renormalized perturbation expansions. The scheme is based on rational polynomial (Padé) approximations for the time-lagged functions, combined with Gaussian quadrature applied to a coarse-time evolution equation for equal-time covariances. Power series coefficients required for the Padé approximants are generated by recursion relations resulting from successive differentiation of the slow varying form of the dynamic equations for time-lagged functions. This strategy is illustrated by applications to equations of the direct interaction approximation for fluid turbulence. Several benefits accrue from such an approach. Computational efficiency comparable to that of Markovian closures is obtained without introduction of arbitrary constants or ad hoc Markovianization assumptions: (1) Scaling of the leading operations count is reduced from \(O(n^ 3_ T)\) to \(O(n_ gn_ T)\), where \(n_ T\) is the number of steps in coarse time, and \(n_ g\approx 4-8\). For typical problems in fluid turbulence, this results in savings of a factor \(\sim 40\) in computing time. (2) Scaling of working array size is reduced from \(O(n^ 2_ T)\) to O(p), where p is the order of Padé approximant; this reduces in-core storage requirements for dynamical quantities by a factor \(\sim 20\). These and other advantages depend on the order of Padé approximant required to give acceptable accuracy. Test cases from several problems in fluid turbulence indicate very substantial savings, such that certain CPU-intensive problems with spatial inhomogeneities become computationally feasible.
0 references
time-history effects
0 references
renormalized perturbation expansions
0 references
time-lagged functions
0 references
Gaussian quadrature
0 references
coarse-time evolution equation
0 references
Padé approximants
0 references
Markovian closures
0 references
0 references
0 references
0 references
0 references
0 references