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 $\mathcal{P}^k$ polynomials with arbitrary $k\geq1$. We perform numerical experiments to demonstrate that the superconvergence rates proved in this paper are sharp.

We study front speeds of curvature and strain G-equations arising in turbulent combustion. These G-equations are HamiltonJacobi type level set partial differential equations (PDEs) with non-coercive Hamiltonians and degenerate nonlinear second order diffusion. The Hamiltonian of a strain G-equation is also non-convex. Numerical computation is performed based on monotone discretization and weighted essentially nonoscillatory (WENO) approximation of transformed G-equations on a fixed periodic domain. The advection field in the computation is a two dimensional Hamiltonian flow consisting of a periodic array of counter-rotating vortices, or cellular flows. Depending on whether the evolution is predominantly in the hyperbolic or parabolic regimes, suitable explicit and semi-implicit time stepping methods are chosen. The turbulent flame speeds are computed as the linear growth rates of large time solutions. A

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.

A multilevel quality-guided phase unwrapping algorithm for real-time 3D shape measurement is presented. The quality map is generated from the gradient of the phase map. Multilevel thresholds are used to unwrap the phase level by level. Within the data points in each level, a fast scan-line algorithm is employed. The processing time of this algorithm is approximately 18.3 ms for an image size of 640480 pixels in an ordinary computer. We demonstrate that this algorithm can be implemented into our real-time 3D shape measurement system for real-time 3D reconstruction. Experiments show that this algorithm improves the previous scan-line phase unwrapping algorithm significantly although it reduces its processing speed slightly.

Homotopy continuation is an efficient tool for solving polynomial systems. Its efficiency relies on utilizing adaptive stepsize and adaptive precision path tracking, and endgames. In this article, we apply homotopy continuation to solve steady state problems of hyperbolic conservation laws. A third-order accurate finite difference weighted essentially non-oscillatory (WENO) scheme with Lax-Friedrichs flux splitting is utilized to derive the difference equation. This new approach is free of the CFL condition constraint. Extensive numerical examples in both scalar and system test problems in one and two dimensions demonstrate the efficiency and robustness of the new method.