No abstract uploaded!

In this paper we propose a time-domain finite element method for modeling of electromagnetic cloaks. The permittivity and permeability of the cloak model are described by the Drude dispersion model. The model to be solved is quite challenging in that we have to solve a coupled problem with different partial differential equations given in different regions. Our method is based on a mixed finite element method using edge elements with different types of meshes in different regions. Numerical results demonstrate that our algorithm is quite effective for simulating cloaks in time-domain. To our knowledge, this is the first cloak simulation carried out by the time-domain finite element method.

No abstract uploaded!

In this paper, we apply the local discontinuous Galerkin (LDG) method to 2D Keller--Segel (KS) chemotaxis model. We improve the results upon (Y. Epshteyn and A. Kurganov, SIAM Journal on Numerical Analysis, 47 (2008), 368-408) and give optimal rate of convergence under special finite element spaces before the blow-up occurs (the exact solutions are smooth). Moreover, to construct physically relevant numerical approximations, we consider $P^1$ LDG scheme and develop a positivity-preserving limiter to the scheme, extending the idea in (Y. Zhang, X. Zhang and C.-W. Shu, Journal of Computational Physics, 229 (2010), 8918-8934). With this limiter, we can prove the $L^1$-stability of the numerical scheme. Numerical experiments are performed to demonstrate the good performance of the positivity-preserving LDG scheme. Moreover, it is known that the chemotaxis model will yield blow-up solutions under certain initial conditions. We numerically demonstrate how to find the approximate blow-up time by using the $L^2$-norm of the $L^1$-stable numerical solution.

This article focuses on the discrete double-curl operator arising in the Maxwell equation that models three dimensional photonic crystals with face centered cubic lattice. The discrete double-curl operator is the degenerate coefficient matrix of the generalized eigenvalue problems (GEVP) due to the Maxwell equation. We derive an eigendecomposition of the degenerate coefficient matrix and explore an explicit form of orthogonal basis for the range and null spaces of this matrix. To solve the GEVP, we apply these theoretical results to project the GEVP to a standard eigenvalue problem (SEVP), which involves only the eigenspace associated with the nonzero eigenvalues of the GEVP and therefore the zero eigenvalues are excluded and will not degrade the computational efficiency. This projected SEVP can be solved efficiently by the inverse Lanczos method. The linear systems within the inverse Lanczos method are well-conditioned and can be solved efficiently by the conjugate gradient method without using a preconditioner. We also demonstrate how two forms of matrix-vector multiplications, which are the most costly part of the inverse Lanczos method, can be computed by fast Fourier transformation due to the eigendecomposition to significantly reduce the computation cost. Integrating all of these findings and techniques, we obtain a fast eigenvalue solver. The solver has been implemented by MATLAB and successfully solves each of a set of $5.184$ million dimension eigenvalue problems within $50$ to $104$ minutes on a workstation with two Intel Quad-C ore Xeon X5687 3.6 GHz CPUs.