In this work we present a novel bulk-surface virtual element method (BSVEM) for the numerical approximation of elliptic bulk-surface partial differential equations (BSPDEs) in three space dimensions. The BSVEM is based on the discretisation of the bulk domain into polyhedral elements with arbitrarily many faces. The polyhedral approximation of the bulk induces a polygonal approximation of the surface. Firstly, we present a geometric error analysis of bulk-surface polyhedral meshes independent of the numerical method. Hence, we show that BSVEM has optimal second-order convergence in space, provided the exact solution is $H^{2+3/4}$ in the bulk and $H^2$ on the surface, where the additional $\frac{3}{4}$ is due to the combined effect of surface curvature and polyhedral elements close to the boundary. We show that general polyhedra can be exploited to reduce the computational time of the matrix assembly. To support our convergence results, a numerical example is presented which demonstrates optimal convergence of an elliptic BSPDE in three space dimensions.
In this work, we are interested in building the fully discrete scheme for stochastic fractional diffusion equation driven by fractional Brownian sheet which is temporally and spatially fractional with Hurst parameters $H_{1}, H_{2} \in(0,\frac{1}{2}]$. We first provide the regularity of the solution. Then we employ the Wong-Zakai approximation to regularize the rough noise and discuss the convergence of the approximation. Next, the finite element and backward Euler convolution quadrature methods are used to discretize spatial and temporal operators for the obtained regularized equation, and the detailed error analyses are developed. Finally, some numerical examples are presented to confirm the theory.
The $P_1$--nonconforming quadrilateral finite element space with periodic boundary condition is investigated. The dimension and basis for the space are characterized with the concept of minimally essential discrete boundary conditions. We show that the situation is totally different based on the parity of the number of discretization on coordinates. Based on the analysis on the space, we propose several numerical schemes for elliptic problems with periodic boundary condition. Some of these numerical schemes are related with solving a linear equation consisting of a non-invertible matrix. By courtesy of the Drazin inverse, the existence of corresponding numerical solutions is guaranteed. The theoretical relation between the numerical solutions is derived, and it is confirmed by numerical results. Finally, the extension to the three dimensional is provided.
We introduce simple quadrature rules for the family of nonparametric nonconforming quadrilateral element with four degrees of freedom. Our quadrature rules are motivated by the work of Meng {\it et al.} \cite{meng2018new}. First, we introduce a family of MVP (Mean Value Property)-preserving four DOFs nonconforming elements on the intermediate reference domain introduced by Meng {\it et al.}. Then we design two--points and three--points quadrature rules on the intermediate reference domain. Under the assumption on equal quadrature weights, the deviation from the quadrilateral center of the Gauss points for the two points and three points rules assumes the same quadratic polynomials with constant terms modified. Thus, the two--points rule and three--points rule are constructed at one stroke. The quadrature rules are asymptotically optimal as the mesh size is sufficiently small. Several numerical experiments are carried out, which show efficiency and convergence properties of the new quadrature rules.
In this paper we propose an idea of constructing a macro--scale matrix system given a micro--scale matrix linear system. Then the macro--scale system is solved at cheaper computing costs. The method uses the idea of the generalized multiscale finite element method based. Some numerical results are presented.
We introduce an algebraic multiscale method for two--dimensional problems. The method uses the generalized multiscale finite element method based on the quadrilateral nonconforming finite element spaces. Differently from the one--dimensional algebraic multiscale method, we apply the dimension reduction techniques to construct multiscale basis functions. Also moment functions are considered to impose continuity between local basis functions. Some representative numerical results are presented.
In this work, we present a positivity-preserving entropy-based adaptive filtering method for shock capturing in discontinuous spectral element methods. By adapting the filter strength to enforce positivity and a local discrete minimum entropy principle, the resulting approach can robustly resolve strong discontinuities with sub-element resolution, does not require problem-dependent parameter tuning, and can be easily implemented on general unstructured meshes with relatively low computational cost. The efficacy of the approach is shown in numerical experiments on hyperbolic and mixed hyperbolic-parabolic conservation laws such as the Euler and Navier-Stokes equations for problems including extreme shocks, shock-vortex interactions, and complex compressible turbulent flows.
In this paper, we propose a variationally consistent technique for decreasing the maximum eigenfrequencies of structural dynamics related finite element formulations. Our approach is based on adding a symmetric positive-definite term to the mass matrix that follows from the integral of the traction jump across element boundaries. The added term is weighted by a small factor, for which we derive a suitable, and simple, element-local parameter choice. For linear problems, we show that our mass-scaling method produces no adverse effects in terms of spatial accuracy and orders of convergence. We illustrate these properties in one, two and three spatial dimension, for quadrilateral elements and triangular elements, and for up to fourth order polynomials basis functions. To extend the method to non-linear problems, we introduce a linear approximation and show that a sizeable increase in critical time-step size can be achieved while only causing minor (even beneficial) influences on the dynamic response.
We study the implicit upwind finite volume scheme for numerically approximating the advection-diffusion equation with a vector field in the low regularity DiPerna-Lions setting. That is, we are concerned with advecting velocity fields that are spatially Sobolev regular and data that are merely integrable. We study the implicit upwind finite volume scheme for numerically approximating the advection-diffusion equation with a vector field in the low regularity DiPerna-Lions setting. We prove that on unstructured regular meshes the rate of convergence of approximate solutions generated by the upwind scheme towards the unique solution of the continuous model is at least one. The numerical error is estimated in terms of logarithmic Kantorovich-Rubinstein distances and provides thus a bound on the rate of weak convergence.
In this work, we propose a simple yet generic preconditioned Krylov subspace method for a large class of nonsymmetric block Toeplitz all-at-once systems arising from discretizing evolutionary partial differential equations. Namely, our main result is a novel symmetric positive definite preconditioner, which can be efficiently diagonalized by the discrete sine transform matrix. More specifically, our approach is to first permute the original linear system to obtain a symmetric one, and subsequently develop a desired preconditioner based on the spectral symbol of the modified matrix. Then, we show that the eigenvalues of the preconditioned matrix sequences are clustered around $\pm 1$, which entails rapid convergence, when the minimal residual method is devised. Alternatively, when the conjugate gradient method on normal equations is used, we show that our preconditioner is effective in the sense that the eigenvalues of the preconditioned matrix sequence are clustered around the unity. An extension of our proposed preconditioned method is given for high-order backward difference time discretization schemes, which applies on a wide range of time-dependent equations. Numerical examples are given to demonstrate the effectiveness of our proposed preconditioner, which consistently outperforms an existing block circulant preconditioner discussed in the relevant literature.
This paper addresses the problem of stylized text generation in a multilingual setup. A version of a language model based on a long short-term memory (LSTM) artificial neural network with extended phonetic and semantic embeddings is used for stylized poetry generation. The quality of the resulting poems generated by the network is estimated through bilingual evaluation understudy (BLEU), a survey and a new cross-entropy based metric that is suggested for the problems of such type. The experiments show that the proposed model consistently outperforms random sample and vanilla-LSTM baselines, humans also tend to associate machine generated texts with the target author.