No abstract uploaded!

Calculation of band structure of three dimensional photonic crystals amounts to solving large-scale Maxwell eigenvalue problems, which are notoriously challenging due to high multiplicity of zero eigenvalue. In this paper, we try to address this problem in such a broad context that band structure of three dimensional isotropic photonic crystals with all 14 Bravais lattices can be efficiently computed in a unified framework. We uncover the delicate machinery behind several key results of our work and on the basis of this new understanding we drastically simplify the derivations, proofs and arguments in our framework. In this work particular effort is made on reformulating the Bloch boundary condition for all 14 Bravais lattices in the redefined orthogonal coordinate system, and establishing eigen-decomposition of discrete partial derivative operators by systematic use of commutativity among them, which has been overlooked previously, and reducing eigen-decomposition of double-curl operator to the canonical form of a 3x3 complex skew-symmetric matrix under unitary congruence. With the validity of the novel nullspace free method in the broad context, we perform some calculations on one benchmark system to demonstrate the accuracy and efficiency of our algorithm.

We implemented an adaptively refined least-squares finite element approach for the Navier-Stokes equations that govern generalized Newtonian fluid flows using the Carreau model. To capture the flow region, we developed an adaptive mesh refinement approach based on the least-squares method. The generated refined grids agree well with the physical attributes of the flows. We also proved that the least-squares approximation converges to the linearized versions solutions of the Carreau model at the best possible rate. Model problems considered in the study are the flow past a planar channel and 4-to-1 contraction problems. We presented the numerical results of the model problems, revealing the efficiency of the proposed scheme, and investigated the physical parameter effects.

In this paper we present an error estimate for the explicit Runge-Kutta discontinuous Galerkin method to solve a linear hyperbolic equation in one dimension with discontinuous but piecewise smooth initial data. The discontinuous finite element space is made up of piecewise polynomials of arbitrary degree $k\geq1$, and time is advanced by the third order explicit total variation diminishing Runge-Kutta method under the standard CFL temporal-spatial condition. The $L^2(\mathbb{R}\backslash\mathcal{R}_T)$-norm error at the final time $T$ is optimal in both space and time, where $\mathcal{R}_T$ is the pollution region due to the initial discontinuity with the width $\mathcal{O}(\sqrt{T\beta}h^{1/2}\log(1/h))$. Here $h$ is the maximum cell length and $\beta$ is the flowing speed. These results are independent of the time step and hold also for the semi-discrete discontinuous Galerkin method.

It is well-known that sparse grid algorithm has been widely accepted as an efficient tool to overcome the "curse of dimensionality" in some degree. In this note, we first give the error estimate of hyperbolic cross (HC) approximations with generalized Hermite functions. The exponential convergence in both regular and optimized hyperbolic cross approximations has been shown. Moreover, the error estimate of Hermite spectral method to high-dimensional linear parabolic PDEs with HC approximations has been investigated in the properly weighted Korobov spaces. The numerical result verifies the exponential convergence of this approach.