No abstract uploaded!

The numerical simulation of the band structure of three-dimensional dispersive metallic photonic crystals with face-centered cubic lattices leads to large-scale nonlinear eigenvalue problems, which are very challenging due to a high dimensional subspace associated with the eigenvalue zero and the fact that the desired eigenvalues (with smallest real part) cluster and close to the zero eigenvalues. For the solution of the nonlinear eigenvalue problem, a Newton-type iterative method is proposed and the nullspace-free method is applied to exclude the zero eigenvalues from the associated generalized eigenvalue problem. To find the successive eigenvalue/eigenvector pairs, we propose a new non-equivalence deflation method to transform converged eigenvalues to infinity, while all other eigenvalues remain unchanged. The deflated problem is then solved by the same Newton-type method, which is used as a hybrid method that combines with the Jacobi-Davidson and the nonlinear Arnoldi methods to compute the clustering eigenvalues. Numerical results illustrate that the proposed method is robust even for the case of computing many clustering eigenvalues in very large problems.

Image restoration is a common problem in visual process. In this paper, a modified minimization model is presented, which combines the L1 and L2 fidelity terms with a combined quadratic L2 and TV regularizer just as the regularizer of Cai et al. (2013). The combined regularizer has the priorities of preserving desirable edges and ensuring several kinds of noises can be removed clearly. Split-Bregman algorithm is effi- ciently employed to solve this model and convergence analysis is also discussed. Moreover, we extend the proposed model and algorithm for image restoration involving blurry images and color images. Experimental results show that our proposed model and algorithm have good performance both in visual and ISNR values for different kinds of blurs and noises including mixed noise.

No abstract uploaded!

In this paper we consider a discontinuous Galerkin discretization of the ideal magnetohydrodynamics (MHD) equations on unstructured meshes, and the divergence free constraint ($\nabla \cdot \B = 0$) of its magnetic field $\B$. We first present two approaches for maintaining the divergence free constraint, namely the approach of a locally divergence free projection inspired by locally divergence free elements \cite{Li2005}, and another approach of the divergence cleaning technique given by Dedner et al. \cite{Dedner2002}. By combining these two approaches we obtain a efficient method at the almost same numerical cost. Finally, numerical experiments are performed to show the capacity and efficiency of the scheme.