We study numerical methods for time-dependent Hamilton-Jacobi equations with weak Dirichlet boundary conditions. We first propose a new class of abstract monotone approximation schemes and get a convergence rate of 1/2 . Then, according to the abstract convergence results, by newly constructing monotone finite volume approximations on interior and boundary points, we obtain convergent finite volume schemes for time-dependent Hamilton-Jacobi equations with weak Dirichlet boundary conditions. Finally give some numerical results.

The T-meshes are local modification of rectangular meshes which allow T-junctions. The splines over T-meshes are involved in many fields, such as finite element methods, CAGD etc. The dimension of a spline space is a basic problem for the theories and applications of splines. However, the problem of determining the dimension of a spline space is difficult since it heavily depends on the geometric properties of the partition. In many cases, the dimension is unstable. In this paper, we study the instability in the dimensions of spline spaces over T-meshes by using the smoothing cofactor-conformality method. The modified dimension formulas of spline spaces over T-meshes with T-cycles are also presented. Moreover, some examples are given to illustrate the instability in the dimensions of the spline spaces over some special meshes.

For deblurring images corrupted by random valued noise, two-phase methods first select likely-to-be reliables (data that are not corrupted by random valued noise) and then deblur images only with selected data. Two-phase methods, however, often cause defective data artifacts, which are mixed results of missing data artifacts caused by the lack of data and noisy data artifacts caused mainly by falsely selected outliers (data that are corrupted by random valued noise). In this paper, to suppress these defective data artifacts, we propose a blurring model based reliable-selection technique to select reliables as many as possible to make all of to-be-recovered pixel values to contribute to selected data, while excluding outliers as accurately as possible. We also propose a normalization technique to compensate for non-uniform rates in recovering pixel values. We conducted simulation studies on Gaussian and diagonal deblurring to evaluate the performance of proposed techniques. Simulation results showed that proposed techniques improved the performance of two-phase methods, by suppressing defective data artifacts effectively.

The design of mixed finite element methods in linear elasticity with symmetric stress approximations has been a longstanding open problem until Arnold and Winther designed the first family of mixed finite elements where the discrete stress space is the space of $H(div, Ω\;\mathbb{S}) — P_{k+1}$ tensors whose divergence is a $P_{k-1}$ polynomial on each triangle for $k$ ≥ 2. Such a two dimensional family was extended, by Arnold, Awanou and Winther, to a three dimensional family of mixed elements where the discrete stress space is the space of $H(div, Ω\;\mathbb{S}) — P_{k+2}$ tensors, whose divergence is a $P_{k-1}$ polynomial on each tetrahedron for $k$ ≥ 2. In this paper, we are able to construct, in a unified fashion, mixed finite element methods with symmetric stress approximations on an arbitrary simplex in $\mathbb{R}^n$ for any space dimension. On the contrary, the discrete stress space here is the space of $H(div, Ω\;\mathbb{S}) — P_k$ tensors, and the discrete displacement space here is the space of $L²(Ω ; \mathbb{R}^n) — P_{k-1}$ vectors for $k ≥ n$+1. These finite element spaces are defined with respect to an arbitrary simplicial triangulation of the domain, and can be regarded as extensions to any dimension of those in two and three dimensions by Hu and Zhang.

This paper develops a new method to analyze convergence of the iterated defect correction scheme of finite element methods on rectangular grids in both two and three dimensions. The main idea is to formulate energy inner products and energy (semi)norms into matrix forms. Then, two constants of two key inequalities involved are min and max eigenvalues of two associated generalized eigenvalue problems, respectively. Local versions on the element level of these two generalized eigenvalue problems are exactly solved to obtain sharp (lower) upper bounds of these two constants. This and some essential observations for iterated solutions establish convergence in 2D and the monotone decreasing property in 3D. For two dimensions the results herein improve those in literature; for three dimensions the results herein are new. Numerical results are presented to examine theoretical results.

For Sobolev equation, we present a new numerical scheme based on a modified weak Galerkin finite element method, in which differential operators are approximated by weak forms through the usual integration by parts. In particular, the numerical method allows the use of discontinuous finite element functions and arbitrary shape of element. Optimal order error estimates in discrete $H^1$ and $L^2$ norms are established for the corresponding modified weak Galerkin finite element solutions. Finally, some numerical results are given to verify theoretical results.

In this paper, we study the superconvergence of the error for the local discontinuous Galerkin (LDG) finite element method for one-dimensional linear parabolic equations when the alternating flux is used. We prove that if we apply piecewise $k$-th degree polynomials, the error between the LDG solution and the exact solution is ($k$+2)-th order superconvergent at the Radau points with suitable initial discretization. Moreover, we also prove the LDG solution is ($k$+2)-th order superconvergent for the error to a particular projection of the exact solution. Even though we only consider periodic boundary condition, this boundary condition is not essential, since we do not use Fourier analysis. Our analysis is valid for arbitrary regular meshes and for $P^k$ polynomials with arbitrary $k$ ≥ 1. We perform numerical experiments to demonstrate that the superconvergence rates proved in this paper are sharp.