We consider a class of time dependent second order partial differential equations governed by a decaying entropy. The solution usually corresponds to a density distribution, hence positivity (non-negativity) is expected. This class of problems covers important cases such as Fokker-Planck type equations and aggregation models, which have been studied intensively in the past decades. In this paper, we design a high order discontinuous Galerkin method for such problems. If the interaction potential is not involved, or the interaction is defined by a smooth kernel, our semi-discrete scheme admits an entropy inequality on the discrete level. Furthermore, by applying the positivity-preserving limiter, our fully discretized scheme produces non-negative solutions for all cases under a time step constraint. Our method also applies to two dimensional problems on Cartesian meshes. Numerical examples are given to confirm the high order accuracy for smooth test cases and to demonstrate the effectiveness for preserving long time asymptotics.

We present a new perspective on graph-based methods for collaborative ranking for recommender systems. Unlike user-based or itembased methods that compute a weighted average of ratings given by the nearest neighbors, or lowrank approximation methods using convex optimization and the nuclear norm, we formulate matrix completion as a series of semi-supervised learning problems, and propagate the known ratings to the missing ones on the user-user or itemitem graph globally. The semi-supervised learning problems are expressed as Laplace-Beltrami equations on a manifold, or namely, harmonic extension, and can be discretized by a point integral method. We show that our approach does not impose a low-rank Euclidean subspace on the data points, but instead minimizes the dimension of the underlying manifold. Our method, named LDM (low dimensional manifold), turns out to be particularly effective in generating rankings of items, showing decent computational efficiency and robust ranking quality compared to state-ofthe- art methods.

In this paper we discuss the derivation and use of local pressure boundary conditions for finite difference schemes for the unsteady incompressible Navier-Stokes equations in the velocity-pressure formulation. Their use is especially well suited for the computation of moderate to large Reynolds number flows. We explore the similarities between the implementation and use of local pressure boundary conditions and local vorticity boundary conditions in the design of numerical schemes for incompressible flow in 2D. In their respective formulations, when these local numerical boundary conditions are coupled with a fully explicit convectively stable time stepping procedure, the resulting methods are simple to implement and highly efficient. Unlike the vorticity formulation, the use of the local pressure boundary condition approach is readily applicable to 3D flows. The simplicity of the local pressure boundary condition approach and its easy adaptation to more general flow settings make the resulting scheme an attractive alternative to the more popular methods for solving the Navier-Stokes equations in the velocity-pressure formulation. We present numerical results of a second-order finite difference scheme on a nonstaggered grid using local pressure boundary conditions. Stability and accuracy of the scheme applied to Stokes flow is demonstrated using normal mode analysis. Also described is the extension of the method to variable density flows.

No abstract uploaded!

In this paper, we apply a simple finite element numerical scheme, proposed in an earlier work (Liu in Math Comput 70(234):579-593, 2000), to perform a high resolution numerical simulation of incompressible flow over an irregular domain and analyze its boundary layer separation. Compared with many classical finite element fluid solvers, this numerical method avoids a Stokes solver, and only two Poisson-like equations need to be solved at each time step/stage. In addition, its combination with the fully explicit fourth order Runge-Kutta (RK4) time discretization enables us to compute high Reynolds number flow in a very efficient way. As an application of this robust numerical solver, the dynamical mechanism of the boundary layer separation for a triangular cavity flow with Reynolds numbers \(Re=10^4\) and \(Re=10^5\) , including the precise values of bifurcation location and critical time, are reported in this paper. In addition, we provide a super-convergence analysis for the simple finite element numerical scheme, using linear elements over a uniform triangulation with right triangles.