We introduce a new iterative regularization procedure for inverse problems based on the use of Bregman distances, with particular focus on problems arising in image processing. We are motivated by the problem of restoring noisy and blurry images via variational methods by using total variation regularization. We obtain rigorous convergence results and effective stopping criteria for the general procedure. The numerical results for denoising appear to give significant improvement over standard models, and preliminary results for deblurring/denoising are very encouraging.

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.

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.

In this article, we present a second-order in time implicit-explicit (IMEX) local discontinuous Galerkin (LDG) method for computing the Cahn-Hilliard equation, which describes the phase separation phenomenon. It is well-known that the Cahn-Hilliard equation has a nonlinear stability property, i.e., the free-energy functional decreases with respect to time. The discretized Cahn-Hilliard system modeled by the IMEX LDG method can inherit the nonlinear stability of the continuous model. We apply a stabilization technique and prove unconditional energy stability of our scheme. Numerical experiments are performed to validate the analysis. Computational efficiency can be significantly enhanced by using this IMEX LDG method with a large time step.

In this paper, we develop a second-order asymptotic-preserving and positivity-preserving discontinuous Galerkin (DG) scheme for the Kerr-Debye model. By using the approach first introduced by Zhang and Shu in Ref.~\refcite{ZhSh:04} with an energy estimate and Taylor expansion, the asymptotic-preserving property of the semi-discrete DG methods is proved rigorously. In addition, we propose a class of unconditional positivity-preserving implicit-explicit (IMEX) Runge-Kutta methods for the system of ordinary differential equations arising from the semi-discretization of the Kerr-Debye model. The new IMEX Runge-Kutta methods are based on the modification of the strong-stability-preserving (SSP) implicit Runge-Kutta method and have second-order accuracy. The numerical results validate our analysis.