No abstract uploaded!

The first author constructed a q-parameterized spherical category $\sC$ over C(q) in [Liu15], whose simple objects are labelled by all Young diagrams. In this paper, we compute closed-form expressions for the fusion rule of $\sC$, using Littlewood-Richardson coefficients, as well as the characters (including a generating function), using symmetric functions with infinite variables.

The main purpose of this paper is to analyze the stability and error estimates of the local discontinuous Galerkin (LDG) methods coupled with carefully chosen implicit-explicit (IMEX) Runge-Kutta time discretization up to third order accuracy, for solving one-dimensional linear advection-diffusion equations. In the time discretization the advection term is treated explicitly and the diffusion term implicitly. There are three highlights of this work. The first is that we establish an important relationship between the gradient and interface jump of the numerical solution with the independent numerical solution of the gradient in the LDG methods. The second is that, by aid of the aforementioned relationship and the energy method, we show that the IMEX LDG schemes are unconditionally stable for the linear problems, in the sense that the time-step $\dt$ is only required to be upper-bounded by a constant which depends on the ratio of the diffusion and the square of the advection coefficients and is independent of the mesh-size $h$, even though the advection term is treated explicitly. The last is that under this time step condition, we obtain optimal error estimates in both space and time for the third order IMEX Runge-Kutta time-marching coupled with LDG spatial discretization. Numerical experiments are also given to verify the main results.

No abstract uploaded!

We study analytical and numerical properties of the L 1 - L 2 minimization problem for sparse representation of a signal over a highly coherent dictionary. Though the L 1 - L 2 metric is non-convex, it is Lipschitz continuous. The difference of convex algorithm (DCA) is readily applicable for computing the sparse representation coefficients. The L 1 - L 2 minimization appears as an initialization step of DCA. We further integrate DCA with a non-standard simulated annealing methodology to approximate globally sparse solutions. Non-Gaussian random perturbations are more effective than standard Gaussian perturbations for improving sparsity of solutions. In numerical experiments, we conduct an extensive comparison among sparse penalties such as L 1 - L 2 for L 1 - L 2 based on data from three specific applications (over-sampled discreet cosine basis, differential absorption optical spectroscopy, and image denoising) where