Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userError estimates for a POD method for solving viscous G-equations in incompressible cellular flows
118
0
0.0
(
0
)
Added by
Haotian Gu
Publication date
2018
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The G-equation is a well-known model for studying front propagation in turbulent combustion. In this paper, we develop an efficient model reduction method for computing textcolor{black}{regular solutions} of viscous G-equations in incompressible steady and time-periodic cellular flows. Our method is based on the Galerkin proper orthogonal decomposition (POD) method. To facilitate the algorithm design and convergence analysis, we decompose the solution of the viscous G-equation into a mean-free part and a mean part, where their evolution equations can be derived accordingly. We construct the POD basis from the solution snapshots of the mean-free part. With the POD basis, we can efficiently solve the evolution equation for the mean-free part of the solution to the viscous G-equation. After we get the mean-free part of the solution, the mean of the solution can be recovered. We also provide rigorous convergence analysis for our method. Numerical results for textcolor{black}{viscous G-equations and curvature G-equations} are presented to demonstrate the accuracy and efficiency of the proposed method. In addition, we study the turbulent flame speeds of the viscous G-equations in incompressible cellular flows.
rate research
Read More
Error estimates are rigorously derived for a semi-discrete version of a conservative spectral method for approximating the space-homogeneous Fokker-Planck-Landau (FPL) equation associated to hard potentials. The analysis included shows that the semi-discrete problem has a unique solution with bounded moments. In addition, the derivatives of such a solution up to any order also remain bounded in $L^2$ spaces globally time, under certain conditions. These estimates, combined with control of the spectral projection, are enough to obtain error estimates to the analytical solution and convergence to equilibrium states. It should be noted that this is the first time that an error estimate has been produced for any numerical method which approximates FPL equations associated to any range of potentials.
We propose an efficient semi-Lagrangian Characteristic Mapping (CM) method for solving the three-dimensional (3D) incompressible Euler equations. This method evolves advected quantities by discretizing the flow map associated with the velocity field. Using the properties of the Lie group of volume preserving diffeomorphisms SDiff, long-time deformations are computed from a composition of short-time submaps which can be accurately evolved on coarse grids. This method is a fundamental extension to the CM method for two-dimensional incompressible Euler equations [51]. We take a geometric approach in the 3D case where the vorticity is not a scalar advected quantity, but can be computed as a differential 2-form through the pullback of the initial condition by the characteristic map. This formulation is based on the Kelvin circulation theorem and gives point-wise a Lagrangian description of the vorticity field. We demonstrate through numerical experiments the validity of the method and show that energy is not dissipated through artificial viscosity and small scales of the solution are preserved. We provide error estimates and numerical convergence tests showing that the method is globally third-order accurate.
In this paper stability and error estimates for time discretizations of linear and semilinear parabolic equations by the two-step backward differentiation formula (BDF2) method with variable step-sizes are derived. An affirmative answer is provided to the question: whether the upper bound of step-size ratios for the $l^infty(0,T;H)$-stability of the BDF2 method for linear and semilinear parabolic equations is identical with the upper bound for the zero-stability. The $l^infty(0,T;V)$-stability of the variable step-size BDF2 method is also established under more relaxed condition on the ratios of consecutive step-sizes. Based on these stability results, error estimates in several different norms are derived. To utilize the BDF method the trapezoidal method and the backward Euler scheme are employed to compute the starting value. For the latter choice, order reduction phenomenon of the constant step-size BDF2 method is observed theoretically and numerically in several norms. Numerical results also illustrate the effectiveness of the proposed method for linear and semilinear parabolic equations.
In two dimensions, we propose and analyze an a posteriori error estimator for finite element approximations of the stationary Navier Stokes equations with singular sources on Lipschitz, but not necessarily convex, polygonal domains. Under a smallness assumption on the continuous and discrete solutions, we prove that the devised error estimator is reliable and locally efficient. We illustrate the theory with numerical examples.
At present, deep learning based methods are being employed to resolve the computational challenges of high-dimensional partial differential equations (PDEs). But the computation of the high order derivatives of neural networks is costly, and high order derivatives lack robustness for training purposes. We propose a novel approach to solving PDEs with high order derivatives by simultaneously approximating the function value and derivatives. We introduce intermediate variables to rewrite the PDEs into a system of low order differential equations as what is done in the local discontinuous Galerkin method. The intermediate variables and the solutions to the PDEs are simultaneously approximated by a multi-output deep neural network. By taking the residual of the system as a loss function, we can optimize the network parameters to approximate the solution. The whole process relies on low order derivatives. Numerous numerical examples are carried out to demonstrate that our local deep learning is efficient, robust, flexible, and is particularly well-suited for high-dimensional PDEs with high order derivatives.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
