Search arXivSearch

arXiv · 2508.10578

Efficient and Optimally Accurate Numerical Algorithms for Stochastic Turbulent Flow Problems

Abstract

In this paper, we first propose a filter-based continuous Ensemble Eddy Viscosity (EEV) model for stochastic turbulent flow problems. We then propose a generic algorithm for a family of fully discrete, grad-div regularized, efficient ensemble parameterized schemes for this model. The linearized Implicit-Explicit (IMEX) EEV generic algorithm shares a common coefficient matrix for each realization per time-step, but with different right-hand-side vectors, which reduces the computational cost and memory requirements to the order of solving deterministic flow problems. Two family members of the proposed time-stepping algorithm are analyzed and proven to be stable. It is found that one is first-order and the other is second-order accurate in time for any stable finite element pairs. Avoiding the discrete inverse inequality, the optimal convergence of both schemes is proven rigorously for both 2D and 3D problems. For appropriately large grad-div parameters, both schemes are unconditionally stable and allow weakly divergence-free elements. Several numerical tests are given for high expected Reynolds number ($\textbf{E}[Re]$) problems. The convergence rates are verified using manufactured solutions with $\textbf{E}[Re]=10^{3},10^{4},\;\text{and}\; 10^{5}$. For various high $\textbf{E}[Re]$, the schemes are implemented on benchmark problems which includes: A 2D channel flow over a unit step problem, a non-intrusive Stochastic Collocation Method (SCM) is used to examine the performance of the schemes on a 2D Regularized Lid Driven Cavity (RLDC) problem, and a 3D RLDC problem, and found them perform well.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Brandiece N. Berry, Md Mahmudul Islam, Muhammad Mohebujjaman, Neethu Suma Raveendran. 2025-08-14. Efficient and Optimally Accurate Numerical Algorithms for Stochastic Turbulent Flow Problems. https://arxiv.org/abs/2508.10578

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

$L^{p}$-convergence of Kantorovich-type Max-Min Neural Network Operators

In this work, we study the Kantorovich variant of max-min neural network operators, in which the operator kernel is defined in terms of sigmoidal functions. Our main aim is to demonstrate the $L^{p}$-convergence of these nonlinear operators for $1\leq p<\infty$, which makes it possible to obtain approximation results for functions that are not necessarily continuous. In addition, we will derive quantitative estimates for the rate of approximation in the $L^{p}$-norm. We will provide some explicit examples, studying the approximation of discontinuous functions with the max-min operator, and varying additionally the underlying sigmoidal function of the kernel. Further, we numerically compare the $L^{p}$-approximation error with the respective error of the Kantorovich variants of other popular neural network operators. As a final application, we show that the Kantorovich variant has advantages compared to the sampling variant of the max-min operator and Kantorovich variant of the max-product operator when it comes to approximate noisy functions as for instance biomedical ECG signals.

math.NA

Quotient geometry of tensor ring decomposition

Differential geometries derived from tensor decompositions have been extensively studied and provided the foundations for a variety of efficient numerical methods. Despite the practical success of the tensor ring (TR) decomposition, its intrinsic geometry remains less understood, primarily due to the underlying ring structure and the resulting nontrivial gauge invariance. We establish the quotient geometry and immersed-submanifold structure of TR decomposition by imposing full-rank conditions on all unfolding matrices of the core tensors and capturing the gauge invariance. The intrinsic ring structure of TR leads to an analysis that is substantially different from other tensor formats. Additionally, for the uniform TR decomposition, where all core tensors are identical and the manifold structure is known, we derive explicit parameterizations for the vertical and horizontal spaces, which enable Riemannian optimization. Numerical experiments validate the developed geometries via tensor ring completion tasks.

math.NA

Boundary elements for clamped Kirchhoff--Love plates

We present a Galerkin boundary element method for clamped Kirchhoff--Love plates with piecewise smooth boundary. It is a direct method based on the representation formula and requires the inversion of the single-layer operator, an application of the double-layer operator to the Dirichlet data, and, in the presence of a vertical load, an application of the Dirichlet trace of the Newton potential to that load. We present trace approximation spaces of arbitrary order, required for both the Dirichlet data and the unknown Neumann trace. Our boundary element method is quasi-optimal with respect to the natural trace norm and achieves optimal convergence order under minimal regularity assumptions. We provide explicit representations of all three integral operators and discuss the implementation of the appearing integrals. Numerical experiments for smooth and non-smooth domains confirm predicted convergence rates.

math.NA