Abstract In this paper, we investigate numerical approximations of the scalar conservation law with the Caputo derivative, which introduces the memory effect. We construct the first order and the second order explicit upwind schemes for such equations, which are shown to be conditionally $\ell^1$ contracting and TVD. However, the Caputo derivative leads to the modified CFL-type stability condition, $ (\Delta t)^{\alpha} = O(\Delta x)$, where $\alpha \in (0,1]$ is the fractional exponent in the derivative. When $\alpha$ small, such strong constraint makes the numerical implementation extremely impractical. We have then proposed the implicit upwind scheme to overcome this issue, which is proved to be unconditionally $\ell^1$ contracting and TVD. Various numerical tests are presented to validate the properties of the methods and provide more numerical evidence in interpreting the memory effect in conservation laws.

In this paper, we present L2 and negative-order norm estimates for the local discontinuous Galerkin (LDG) method solving variable coefficient Schrödinger equations. For these special solutions the LDG method exhibits ‘‘hidden accuracy", and we are able to extract it through the use of a convolution kernel that is composed of a linear combination of B-splines. This technical was initially introduced by Cockburn, Luskin, Shu, and Süli for linear hyperbolic equations and extended by Ryan et al. as a smoothness-increasing accuracy-conserving (SIAC) filter. We demonstrate that it is possible to extend the SIAC filter on Schrödinger equations. When polynomials of degree k are used, we can prove theoretically the LDG method solutions are of order k + 1, whereas the post-processed solutions that convolution with the SIAC filter are of order at least 2k. Additionally, we present numerical results to confirm that the accuracy of LDG solutions can be improved from O(hk+1) to at least O(h2k+1) for Schrödinger equations by using alternating numerical fluxes.

Unmixing problems in many areas such as hyperspectral imaging and differential optical absorption spectroscopy (DOAS) often require finding sparse nonnegative linear combinations of dictionary elements that match observed data. We show how aspects of these problems, such as misalignment of DOAS references and uncertainty in hyperspectral endmembers, can be modeled by expanding the dictionary with grouped elements and imposing a structured sparsity assumption that the combinations within each group should be sparse or even 1-sparse. If the dictionary is highly coherent, it is difficult to obtain good solutions using convex or greedy methods, such as nonnegative least squares (NNLS) or orthogonal matching pursuit. We use penalties related to the Hoyer measure, which is the ratio of the l_1 and l_1 norms, as sparsity penalties to be added to the objective in NNLS-type models. For solving the

No abstract uploaded!

With the rapid development of internet economy, transparent logistics is stepping into a prosperity period with massive transportation data generated and collected every day. In this paper, we focus on the segmentation of GPS trajectory data generated in logistics transportation to analyze the vehicle behaviors and extract business affair information according to the vehicle behavior characteristics, which is challenging due to the complexity of trajectory data and unavailability of road information. We extract the stopping points from the trajectory data sequence based on the duration of nonmovement, and construct business time window and electronic fence by analyzing the driving habits of vehicles. Furthermore, we propose a probabilistic logic based data segmentation method (PLDSM) which not only helps finding all the business points but also assists in inferring the business affair categories. An efficient