In this paper we present an a posteriori error estimator for the stabilized P1 nonconforming finite element method of the linear elasticity problem based on a nonsymmetric H(div)-conforming approximation of the stress tensor in the first-order Raviart-Thomas space. By combining the equilibrated residual method and the hypercircle method, it is shown that the error estimator gives a fully computable upper bound on the actual error. Numerical results are provided to confirm the theory and illustrate the effectiveness of our error estimator.

In this paper we introduce 6-fold symmetry crystal growth using new phase-field models based on the modified Allen-Cahn equation. The proposed method is a hybrid method which uses both analytic and numerical solutions. We then show this method can be extended to $k$-fold case. The Wulff construction procedure is provided to understand and predict the shape of crystals. We also present a detailed mathematical proof of the validity of the Wulff construction. For computational results, we verify the accuracy and efficiency of the method for snow crystal growth.

In this paper, we propose a very efficient method which reconstructs the high resolution surface from a set of unorganized points. Our method is based on the level set method using adaptive octree. We start with the surface reconstruction model proposed in [20]. In [20], they introduced a very fast and efficient method which is different from the previous methods using the level set method. Most existing methods[21, 22] employed the time evolving process from an initial surface to point cloud. But in [20], they considered the surface reconstruction process as an elliptic problem in the narrow band including point cloud. So they could obtain very speedy method because they didn't have to limit the time evolution step by the finite speed of propagation. However, they implemented that model just on the uniform grid. So they still have the weakness that it needs so much memories because of being fulfilled only on the uniform grid. Their algorithm basically solves a large linear system of which size is the same as the number of the grid in a narrow band. Besides, it is not easy to make the width of band narrow enough since the decision of band width depends on the distribution of point data. After all, as far as it is implemented on the uniform grid, it is almost impossible to generate the surface on the high resolution because the memory requirement increases geometrically. We resolve it by adapting octree data structure[12, 11] to our problem and by introducing a new redistancing algorithm which is different from the existing one[19].

This paper provides an efficient dimension reduction algorithm of the positive realization of discrete phase type(DPH) distributions. The relationship between the representation of DPH distributions and the positive realization of the positive system is explained. The dimension of the positive realization of a discrete phase-type realization may be larger than its McMillan degree of probability generating functions. The positive realization with sufficient large dimension bound can be obtained easily but generally, the minimal positive realization problem is not solved yet. We propose an efficient dimension reduction algorithm to make the positive realization with tighter upper bound from a given probability generating functions in terms of convex cone problem and linear programming.

We present an application of the variational multiscale methodology to the computation of concentric annular pipe flow. Isogeometric analysis is utilized for higher order approximation of the solution using Non-Uniform Rational B-Splines (NURBS) functions. The ability of NURBS to exactly represent curved geometries makes NURBS-based isogeometric analysis attractive for the application to the flow through the curved channel.