This work is devoted to the numerical computation of complex band structure $\k=\k(\omega)\in\mathbb C^3$ for positive $\omega$ of three dimensional isotropic dispersive or non-dispersive photonic crystals from the perspective of structured quadratic eigenvalue problems (QEPs). Our basic strategy is to fix two degrees of freedom in $\k\in\mathbb C^3$ and to view the remaining one as the eigenvalue of a quadratic operator pencil derived from Maxwell's equations. Then Yee's scheme is employed to discretize $\nabla\times$ and $\k\times$ operators in this quadratic operator pencil. Distinct from the others' works which either ignore or directly exploit the Hamiltonian structure of the spectrum of the resulting QEP, we reformulate this QEP into an equivalent $\top$-palindromic QEP to facilitate the use of superior structure-preserving algorithms. Ultimately we rely on the structured Arnoldi algorithm, namely the G$\top$SHIRA algorithm, to compute eigenvalues of a $\top$-skew-Hamiltonian pair which are near or in $[-2,2]$, a much narrower region than the whole positive real axis in the origin problem. Moreover, to accelerate the inner iterations of the G$\top$SHIRA algorithm, we propose the preconditioning technique, making most of the eigenmatrix, which can essentially be seen as the Kronecker product of three discrete Fourier transformation matrices, of the commutative discretized $\partial_x,\partial_y,\partial_z$ operators. The advantage of our method is discussed in detail and corroborated by several numerical results.

Staggered grid techniques have been applied successfully to many problems. A distinctive advantage is that physical laws arising from the corresponding partial differential equations are automatically preserved. Recently, a staggered discontinuous Galerkin (SDG) method was developed for the convectiondiffusion equation. In this paper, we are interested in solving the steady state convectiondiffusion equation with a small diffusion coefficient . It is known that the exact solution may have large gradient in some regions and thus a very fine mesh is needed. For convection dominated problems, that is, when is small, exact solutions may contain sharp layers. In these cases, adaptive mesh refinement is crucial in order to reduce the computational cost. In this paper, a new SDG method is proposed and the proof of its stability is provided. In order to construct an adaptive mesh refinement strategy for this new

We use a positive parameter to develop a dierentiable perturbed reconstruction model to solve the L1–L2 magnetic resonance image (MRI) reconstruction problem. We use Bregman iterative formulation to solve the dierentiable perturbed L1–L2 model, and lagged diusivity xed-point iteration to solve the minimization problem in the Bregman iteration. Two Fourier transforms and an inverse Fourier transform are used to accelerate L1–L2 MRI reconstruction. Real MR images are used to test the method in numerical experiments. The results demonstrate that the proposed method is very ecient for L1–L2MRI reconstruction.

In this paper, we apply discontinuous Galerkin (DG) methods to solve two model equations: Krause's consensus models and pressureless Euler equations. These two models are used to describe the collisions of particles, and the distributions can be identified as density functions. If the particles are placed at a single point, then the density function turns out to be a $\delta$-function and is difficult to be well approximated numerically. In this paper, we use DG method to approximate such a singularity and demonstrate the good performance of the scheme. Since the density functions are always positive, we apply a positivity-preserving limiter to them. Moreover, for pressureless Euler equations, the velocity satisfies the maximum principle. We also construct special limiters to fulfill this requirement.

No abstract uploaded!