No abstract uploaded!

No abstract uploaded!

We propose a simple finite difference scheme for Navier--Stokes equations in primitive formulation on curvilinear domains. With proper boundary treatment and interplay between covariant and contravariant components, the spatial discretization admits exact Hodge decomposition and energy identity. As a result, the pressure can be decoupled from the momentum equation with explicit time stepping. No artificial pressure boundary condition is needed. In addition, it can be shown that this spatially compatible discretization leads to uniform inf-sup condition, which plays a crucial role in the pressure approximation of both dynamic and steady state calculations. Numerical experiments demonstrate the robustness and efficiency of our scheme.

Let k be a commutative Noetherian ring and C−− be a locally finite k-linear category equipped with a self-embedding functor of degree 1. We show under a moderate condition that finitely generated torsion representations of C−− are super finitely presented (that is, they have projective resolutions each term of which is finitely generated). In the situation that these self-embedding functors are genetic functors, we give upper bounds for homological degrees of finitely generated torsion modules. These results apply to quite a few categories recently appearing in representation stability theory. In particular, when k is a field of characteristic 0, we obtain another upper bound for homological degrees of finitely generated FI-modules.

We study the super-resolution (SR) problem of recovering point sources consisting of a collection of isolated and suitably separated spikes from only the low frequency measurements. If the peak separation is above a factor in $(1, 2)$ of the Rayleigh length (physical resolution limit), L1 minimization is guaranteed to recover such sparse signals. However, below such critical length scale, especially the Rayleigh length, the $L_1$ certificate no longer exists. We show several local properties (local minimum, directional stationarity, and sparsity) of the limit points of minimizing two $L_1$ based nonconvex penalties, the difference of $L_1$ and $L_2$ norms $(L_{1-2})$ and capped $L_1 (CL_1)$, subject to the measurement constraints. In one and two dimensional numerical SR examples,the local optimal solutions from dierence of convex function algorithms outperform the global L1 solutions near or below Rayleigh length scales either in the accuracy of ground truth recovery or in nding a sparse solution satisfying the constraints more accurately.