Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNumerical Simulations of Surface-Quasi Geostrophic Flows on Periodic Domains
265
0
0.0
(
0
)
Added by
Murtazo Nazarov
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We propose a novel algorithm for the approximation of surface-quasi geostrophic (SQG) flows modeled by a nonlinear partial differential equation coupling transport and fractional diffusion phenomena. The time discretization consists of an explicit strong-stability-preserving three-stage Runge-Kutta method while a flux-corrected-transport (FCT) method coupled with Dunford-Taylor representations of fractional operators is advocated for the space discretization. Standard continuous piecewise linear finite elements are employed and the algorithm does not have restrictions on the mesh structure nor on the computational domain. In the inviscid case, we show that the resulting scheme satisfies a discrete maximum principle property under a standard CFL condition and observe, in practice, its second-order accuracy in space. The algorithm successfully approximates several benchmarks with sharp transitions and fine structures typical of SQG flows. In addition, theoretical Kolmogorov energy decay rates are observed on a freely decaying atmospheric turbulence simulation.
rate research
Read More
This article is an account of the NABUCO project achieved during the summer camp CEMRACS 2019 devoted to geophysical fluids and gravity flows. The goal is to construct finite difference approximations of the transport equation with nonzero incoming boundary data that achieve the best possible convergence rate in the maximum norm. We construct, implement and analyze the so-called inverse Lax-Wendroff procedure at the incoming boundary. Optimal convergence rates are obtained by combining sharp stability estimates for extrapolation boundary conditions with numerical boundary layer expansions. We illustrate the results with the Lax-Wendroff and O3 schemes.
In this paper, we study a multi-scale deep neural network (MscaleDNN) as a meshless numerical method for computing oscillatory Stokes flows in complex domains. The MscaleDNN employs a multi-scale structure in the design of its DNN using radial scalings to convert the approximation of high frequency components of the highly oscillatory Stokes solution to one of lower frequencies. The MscaleDNN solution to the Stokes problem is obtained by minimizing a loss function in terms of L2 normof the residual of the Stokes equation. Three forms of loss functions are investigated based on vorticity-velocity-pressure, velocity-stress-pressure, and velocity-gradient of velocity-pressure formulations of the Stokes equation. We first conduct a systematic study of the MscaleDNN methods with various loss functions on the Kovasznay flow in comparison with normal fully connected DNNs. Then, Stokes flows with highly oscillatory solutions in a 2-D domain with six randomly placed holes are simulated by the MscaleDNN. The results show that MscaleDNN has faster convergence and consistent error decays in the simulation of Kovasznay flow for all four tested loss functions. More importantly, the MscaleDNN is capable of learning highly oscillatory solutions when the normal DNNs fail to converge.
We deal with the virtual element method (VEM) for solving the Poisson equation on a domain $Omega$ with curved boundaries. Given a polygonal approximation $Omega_h$ of the domain $Omega$, the standard order $m$ VEM [6], for $m$ increasing, leads to a suboptimal convergence rate. We adapt the approach of [16] to VEM and we prove that an optimal convergence rate can be achieved by using a suitable correction depending on high order normal derivatives of the discrete solution at the boundary edges of $Omega_h$, which, to retain computability, is evaluated after applying the projector $Pi^ abla$ onto the space of polynomials. Numerical experiments confirm the theory.
Consider the surface quasi-geostrophic equation with random diffusion, white in time. We show global existence and uniqueness in high probability for the associated Cauchy problem satisfying a Gevrey type bound. This article is inspired by recent work of Glatt-Holtz and Vicol.
We consider the problem of reconstructing an unknown function $uin L^2(D,mu)$ from its evaluations at given sampling points $x^1,dots,x^min D$, where $Dsubset mathbb R^d$ is a general domain and $mu$ a probability measure. The approximation is picked from a linear space $V_n$ of interest where $n=dim(V_n)$. Recent results have revealed that certain weighted least-squares methods achieve near best approximation with a sampling budget $m$ that is proportional to $n$, up to a logarithmic factor $ln(2n/varepsilon)$, where $varepsilon>0$ is a probability of failure. The sampling points should be picked at random according to a well-chosen probability measure $sigma$ whose density is given by the inverse Christoffel function that depends both on $V_n$ and $mu$. While this approach is greatly facilitated when $D$ and $mu$ have tensor product structure, it becomes problematic for domains $D$ with arbitrary geometry since the optimal measure depends on an orthonormal basis of $V_n$ in $L^2(D,mu)$ which is not explicitly given, even for simple polynomial spaces. Therefore sampling according to this measure is not practically feasible. In this paper, we discuss practical sampling strategies, which amount to using a perturbed measure $widetilde sigma$ that can be computed in an offline stage, not involving the measurement of $u$. We show that near best approximation is attained by the resulting weighted least-squares method at near-optimal sampling budget and we discuss multilevel approaches that preserve optimality of the cumulated sampling budget when the spaces $V_n$ are iteratively enriched. These strategies rely on the knowledge of a-priori upper bounds on the inverse Christoffel function. We establish such bounds for spaces $V_n$ of multivariate algebraic polynomials, and for general domains $D$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
