Shannon Entropy Computations in Navier–Stokes Flow Problems Using the Stochastic Finite Volume Method
The main aim of this study is to achieve the numerical solution for the Navier–Stokes equations for incompressible, non-turbulent, and subsonic fluid flows with some Gaussian physical uncertainties. The higher-order stochastic finite volume method (SFVM), implemented according to the iterative gener...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-01-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/27/1/67 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The main aim of this study is to achieve the numerical solution for the Navier–Stokes equations for incompressible, non-turbulent, and subsonic fluid flows with some Gaussian physical uncertainties. The higher-order stochastic finite volume method (SFVM), implemented according to the iterative generalized stochastic perturbation technique and the Monte Carlo scheme, are engaged for this purpose. It is implemented with the aid of the polynomial bases for the pressure–velocity–temperature (PVT) solutions, for which the weighted least squares method (WLSM) algorithm is applicable. The deterministic problem is solved using the freeware OpenFVM, the computer algebra software MAPLE 2019 is employed for the LSM local fittings, and the resulting probabilistic quantities are computed. The first two probabilistic moments, as well as the Shannon entropy spatial distributions, are determined with this apparatus and visualized in the FEPlot software. This approach is validated using the 2D heat conduction benchmark test and then applied for the probabilistic version of the 3D coupled lid-driven cavity flow analysis. Such an implementation of the SFVM is applied to model the 2D lid-driven cavity flow problem for statistically homogeneous fluid with limited uncertainty in its viscosity and heat conductivity. Further numerical extension of this technique is seen in an application of the artificial neural networks, where polynomial approximation may be replaced automatically by some optimal, and not necessarily polynomial, bases. |
|---|---|
| ISSN: | 1099-4300 |