In this paper, we consider the time-dependent Maxwell’s equations when Cole–Cole dispersive medium is involved. The Cole–Cole model contains a fractional time derivative term, which couples with the standard Maxwell’s equations in free space and creates some challenges in developing and analyzing time-domain finite element methods for solving this model as mentioned in our earlier work [J. Li, J. Sci. Comput., 47 (2001), pp. 1–26]. By adopting some techniques developed for the fractional diffusion equations [V.J. Ervin, N. Heuer, and J.P. Roop, SIAM J. Numer. Anal., 45 (2007), pp. 572–591], [Y. Lin and C. Xu, J. Comput. Phys., 225 (2007), pp. 1533–1552], [F. Liu, P. Zhuang, V. Anh, I. Turner, and K. Burrage, Appl. Math. Comput., 191 (2007), pp. 12–20], we propose two fully discrete mixed finite element schemes for the Cole–Cole model. Numerical stability and optimal error estimates are proved for both schemes. The proposed algorithms are implemented and detailed numerical results are provided to justify our theoretical analysis.

In a recent paper [11], Hou and Shi introduced a new adaptive data analysis method to analyze nonlinear and non-stationary data.The main idea is to look for the sparsest representation of multiscale data within the largest possible dictionary consisting of intrinsic mode functions of the form{a(t)cos(θ(t))}, where a∈V(θ), V(θ) consists of the functions that are less oscillatory than cos(θ(t))and θ0. This problem was formulated as a nonlinear L0 optimization problem and an iterative nonlinear matching pursuit method was proposed to solve this nonlinear optimization problem. In this paper, we prove the convergence of this nonlinear matching pursuit method under some scale separation assumptions on the signal. We consider both well- resolved and poorly sample dsignals, as well as signals with noise. In the case without noise, we prove that our method gives exact recovery of the original signal.

No abstract uploaded!

We associate to a finite digraph D a lattice polytope PD whose vertices are the rows of the Laplacian matrix of D. This generalizes a construction introduced by Braun and the third author. As a consequence of the Matrix-Tree Theorem, we show that the normalized volume of PD equals the complexity of D, and PD contains the origin in its relative interior if and only if D is strongly connected. Interesting connections with other families of simplices are established and then used to describe reflexivity, the h∗-polynomial, and the integer decomposition property of PD in these cases. We extend Braun and Meyer’s study of cycles by considering cycle digraphs. In this setting, we characterize reflexivity and show there are only four non-trivial reflexive Laplacian simplices having the integer decomposition property.

In this paper, we give a condition on the bicharacteristic which guarantees the global existence of the mild solution to the Boltzmann equation with an external force for the hard-sphere model and potentials with angular cutoff in infinite vacuum. This generalizes the previous results to the case when the force can have arbitrary strength. The constructive condition on the bicharacteristic is used to obtain the pointwise estimates on the collision operator so that the global existence comes from the contraction mapping theorem.