In this paper, we aim to solve one and two dimensional hyperbolic conservation laws on arbitrarily distributed point clouds. The initial condition is given on such a point cloud, and the algorithm solves for point values of the solution at later time also on this point cloud. By using the Voronoi technique and by introducing a grouping algorithm, we divide the computational domain into non-overlapping cells. Each cell is a polygon and contains a minimum number of the given points to ensure accuracy. We carefully select points in each cell during the grouping procedure, and hence are able to interpolate or fit the discrete initial values with piecewise polynomials. By adapting the traditional discontinuous Galerkin method on the constructed polygonal mesh, we obtain a stable, conservative and high order method. Numerical results for both one and two dimensional scalar equations and Euler systems of compressible gas dynamics are provided to illustrate the good behavior of our mesh generation algorithm as well as the numerical scheme.

A novel discontinuous Galerkin (DG) method is developed to solve timedependent bi-harmonic type equations involving fourth derivatives in one and multiple space dimensions. We present the spatial DG discretization based on a mixed formulation and central interface numerical fluxes so that the resulting semi-discrete schemes are L^2 stable even without interior penalty. For time discretization, we use Crank–Nicolson so that the resulting scheme is unconditionally stable and second order in time. We present the optimal L^2 error estimate of O(h^{k+1}) for polynomials of degree k for semi-discrete DG schemes, and the L2 error of O(h^{k+1} + (\Delta t)^2) for fully discrete DG schemes. Extensions to more general fourth order partial differential equations and cases with non-homogeneous boundary conditions are provided. Numerical results are presented to verify the stability and accuracy of the schemes. Finally, an application to the one-dimensional Swift–Hohenberg equation endowed with a decay free energy is presented.

No abstract uploaded!

We analyze the random fluctuations of several multiscale algorithms, such as the multiscale finite element method (MsFEM) and the finite element heterogeneous multiscale method (HMM), that have been developed to solve partial differential equations with highly heterogeneous coefficients. Such multiscale algorithms are often shown to correctly capture the homogenization limit when the highly oscillatory random medium is stationary and ergodic. This paper is concerned with the random fluctuations of the solution about the deterministic homogenization limit. We consider the simplified setting of the one-dimensional elliptic equation, where the theory of random fluctuations is well understood. We develop a fluctuation theory for the multiscale algorithms in the presence of random environments with short-range and long-range correlations. For a given mesh size h, we show that the fluctuations converge in distribution in the space of continuous paths to Gaussian processes as the correlation length ε→0. We next derive the limit of such Gaussian processes as h→0 and compare this limit with the distribution of the random fluctuations of the continuous model. When such limits agree, we conclude that the multiscale algorithm captures the random fluctuations accurately and passes the corrector test. This property serves as an interesting benchmark to assess the behavior of the multiscale algorithm in practical situations where the assumptions necessary for the theory of homogenization are not met. What we find is that the computationally more expensive methods MsFEM, and HMM with a choice of parameter δ=h, correctly capture the random fluctuations both for short-range and long-range oscillations in the medium. The less expensive method HMM with δ<h correctly captures the fluctuations for long-range oscillations and strongly amplifies their size in media with short-range oscillations. We present a modified scheme with an intermediate computational cost that captures the random fluctuations in all cases.

Abstract BDDC and FETI-DP algorithms are developed for three-dimensional elliptic problems with adaptively enriched coarse components. It is known that these enriched components are necessary in the development of robust preconditioners. To form the adaptive coarse components, carefully designed generalized eigenvalue problems are introduced for each faces and edges, and the coarse components are formed by using eigenvectors with their corresponding eigenvalues larger than a given tolerance T O L. Upper bounds for condition numbers of the preconditioned systems are shown to be C T O L, with the constant C depending only on the maximum number of edges and faces per subdomain, and the maximum number of subdomains sharing an edge. Numerical results are presented to test the robustness of the proposed approach.