We propose efficient Eulerian methods for approximating the finite-time Lyapunov exponent (FTLE). The idea is to compute the related flow map using the Level Set Method and the Liouville equation. There are several advantages of the proposed approach. Unlike the usual Lagrangian-type computations, the resulting method requires the velocity field defined only at discrete locations. No interpolation of the velocity field is needed. Also, the method automatically stops a particle trajectory in the case when the ray hits the boundary of the computational domain. The computational complexity of the algorithm is <i>O</i>(<i>x</i>^(<i>d</i>+1)) with <i>d</i> the dimension of the physical space. Since there are the same number of mesh points in the <i>x</i><i>t</i> space, the computational complexity of the proposed Eulerian approach is optimal in the sense that each grid point is visited for only <i>O</i>(1) time. We also extend the algorithm to compute the FTLE

We establish theoretical recovery guarantees of a family of Riemannian optimization algorithms for low rank matrix recovery, which is about recovering an mimes n rank mimes n matrix from mimes n number of linear measurements. The algorithms are first interpreted as iterative hard thresholding algorithms with subspace projections. Based on this connection, we show that provided the restricted isometry constant mimes n of the sensing operator is less than mimes n, the Riemannian gradient descent algorithm and a restarted variant of the Riemannian conjugate gradient algorithm are guaranteed to converge linearly to the underlying rank mimes n matrix if they are initialized by one step hard thresholding. Empirical evaluation shows that the algorithms are able to recover a low rank matrix from nearly the minimum number of measurements necessary.

We develop numerical methods for solving partial differential equations (PDE) defined on an evolving interface represented by the grid based particle method (GBPM) recently proposed in [S. Leung, H.K. Zhao, A grid based particle method for moving interface problems, J. Comput. Phys. 228 (2009) 77067728]. In particular, we develop implicit time discretization methods for the advectiondiffusion equation where the time step is restricted solely by the advection part of the equation. We also generalize the GBPM to solve high order geometrical flows including surface diffusion and Willmore-type flows. The resulting algorithm can be easily implemented since the method is based on meshless particles quasi-uniformly sampled on the interface. Furthermore, without any computational mesh or triangulation defined on the interface, we do not require remeshing or reparametrization in the case of highly distorted motion

We propose Gaussian-beam based Eulerian methods to compute semi-classical solutions of the Schrdinger equation. Traditional Gaussian beam type methods for the Schrdinger equation are based on the Lagrangian ray tracing. Based on the first Eulerian Gaussian beam framework proposed in Leung et al.[S. Leung, J. Qian, R. Burridge, Eulerian Gaussian beams for high frequency wave propagation, Geophysics 72 (2007) SM61SM76], we develop a new Eulerian Gaussian beam method which uses global Cartesian coordinates, level-set based implicit representation and Liouville equations. The resulting method gives uniformly distributed phases and amplitudes in phase space simultaneously. To obtain semi-classical solutions to the Schrdinger equation with different initial wave functions, we only need to slightly modify the summation formula. This yields a very efficient method for computing semi

Using the tri-hamiltonian splitting method, the authors of [Anco and Mobasheramini, Physica D, 355: 1--23, 2017] derived two U (1) -invariant nonlinear PDEs that arise from the hierarchy of the nonlinear Schrdinger equation and admit peakons ($ non-smooth\solitons $). In the present paper, these two peakon PDEs are generalized to a family of U (1) -invariant peakon PDEs parametrized by the real projective line U (1) . All equations in this family are shown to posses $ conservative\peakon\solutions $(whose Sobolev U (1) norm is time invariant). The Hamiltonian structure for the sector of conservative peakons is identified and the peakon ODEs are shown to be Hamiltonian with respect to several Poisson structures. It is shown that the resulting Hamilonian peakon flows in the case of the two peakon equations derived in [Anco and Mobasheramini, Physica D, 355: 1--23, 2017] form orthogonal families, while in general the Hamiltonian peakon flows for two different equations in the general family intersect at a fixed angle equal to the angle between two lines in U (1) parametrizing those two equations. Moreover, it is shown that inverse spectral methods allow one to solve explicitly the dynamics of conservative peakons using explicit solutions to a certain interpolation problem. The graphs of multipeakon solutions confirm the existence of multipeakon breathers as well as asymptotic formation of pairs of two peakon bound states in the non-periodic time domain.