We introduce a new adaptive method for analyzing nonlinear and nonstationary data. This method is inspired by the empirical mode decomposition (EMD) method and the recently developed compressed sensing theory. 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 ≥ 0 is assumed to be smoother than cos(θ(t)) and θ is a piecewise smooth increasing function. We formulate this problem as a nonlinear L1 optimization problem. Further, we propose an iterative algorithm to solve this nonlinear optimization problem recursively. We also introduce an adaptive filter method to decompose data with noise. Numerical examples are given to demonstrate the robustness of our method and comparison is made with the EMD method. One advantage of performing such a decomposition is to preserve some intrinsic physical property of the signal, such as trend and instantaneous frequency. Our method shares many important properties of the original EMD method. Because our method is based on a solid mathematical formulation, its performance does not depend on numerical parameters such as the number of shifting or stop criterion, which seem to have a major effect on the original EMD method. Our method is also less sensitive to noise perturbation and the end effect compared with the original EMD method.

By performing estimates on the integral of the absolute value of vorticity along a local vortex line segment, we establish a relatively sharp dynamic growth estimate of maximum vorticity under some assumptions on the local geometric regularity of the vorticity vector. Our analysis applies to both the 3D incompressible Euler equations and the surface quasi-geostrophic model (SQG). As an application of our vorticity growth estimate, we apply our result to the 3D Euler equation with the two anti-parallel vortex tubes initial data considered by Hou-Li [12]. Under some additional assumption on the vorticity eld, which seems to be consistent with the computational results of [12], we show that the maximum vorticity can not grow faster than double exponential in time. Our analysis extends the earlier results by Cordoba-Feerman [6, 7] and Deng-Hou-Yu [8, 9].

The Laplace-Beltrami operator (LBO) is a fundamental object associated to Riemannian manifolds, which encodes all intrinsic geometry of the manifolds and has many desirable prop- erties. Recently, we proposed a novel numerical method, Point Integral method (PIM), to discretize the Laplace-Beltrami operator on point clouds [28]. In this paper, we analyze the convergence of Point Integral method (PIM) for Poisson equation with Neumann boundary condition on submanifolds isometrically embedded in Euclidean spaces.

Thetransmissioneigenvalueproblem,besidesitscriticalroleininversescattering problems, deserves special interest of its own due to the fact that the corresponding differen- tial operator is neither elliptic nor self-adjoint. In this paper, we provide a spectral analysis and propose a novel iterative algorithm for the computation of a few positive real eigen- values and the corresponding eigenfunctions of the transmission eigenvalue problem. Based on approximation using continuous finite elements, we first derive an associated symmetric quadratic eigenvalue problem (QEP) for the transmission eigenvalue problem to eliminate the nonphysical zero eigenvalues while preserve all nonzero ones. In addition, the derived QEP enables us to consider more refined discretization to overcome the limitation on the number of degrees of freedom. We then transform the QEP to a parameterized symmet- ric definite generalized eigenvalue problem (GEP) and develop a secant-type iteration for solving the resulting GEPs. Moreover, we carry out spectral analysis for various existence intervals of desired positive real eigenvalues, since a few lowest positive real transmission eigenvalues are of practical interest in the estimation and the reconstruction of the index of refraction. Numerical experiments show that the proposed method can find those desired smallest positive real transmission eigenvalues accurately, efficiently, and robustly.

In this paper we study the stochastic Galerkin approximation for the linear transport equation with random inputs and diffusive scal- ing. We first establish uniform (in the Knudsen number) stability results in the random space for the transport equation with uncertain scattering coefficients, and then prove the uniform spectral conver- gence (and consequently the sharp stochastic Asymptotic-Preserving property) of the stochastic Galerkin method. A micro-macro decom- position based fully discrete scheme is adopted for the problem and proved to have a uniform stability. Numerical experiments are conducted to demonstrate the stability and asymptotic properties of the method.