We present and analyze two numerical methods for the logarithmic Schrödinger equation (LogSE) consisting of a regularized splitting method and a regularized conservative Crank–Nicolson finite difference method (CNFD). In order to avoid numerical blow-up and/or to suppress round-off error due to the logarithmic nonlinearity in the LogSE, a regularized logarithmic Schrödinger equation (RLogSE) with a small regularized parameter 0<ε≪1 is adopted to approximate the LogSE with linear convergence rate O(ε). Then we use the Lie–Trotter splitting integrator to solve the RLogSE and establish its error bound O(τ^{1/2}ln(ε^{−1})) with τ>0 the time step, which implies an error bound at O(ε+τ^{1/2}ln(ε^{−1})) for the LogSE by the Lie–Trotter splitting method. In addition, the CNFD is also applied to discretize the RLogSE, which conserves the mass and energy in the discretized level. Numerical results are reported to confirm our error bounds and to demonstrate rich and complicated dynamics of the LogSE.

In the paper, we study the Prandtl system with initial data admitting non-degenerate critical points. For any index \sigma\in [3/2, 2], we obtain the local in time well-posedness in the space of Gevrey class \sigma\in [3/2, 2], in the tangential variable and Sobolev class in the normal variable so that the monotonicity condition on the tangential velocity is not needed to overcome the loss of tangential derivative. This answers the open question raised in the paper of D. Grard-Varet and N. Masmoudi [{\it Ann. Sci. c. Norm. Supr}.(4) 48 (2015), no. 6, 1273-1325], in which the case \sigma\in [3/2, 2], is solved.

We prove that classical solution of the spatially inhomogeneous and angular non-cutoff Boltzmann equation is C with respect to all variables, locally in the space and time variables. The proof relies on a generalized uncertainty principle, some improved upper bound and coercivity estimates on the nonlinear collision operator, and some subtle analysis on the commutators between the collision operators and some appropriately chosen pseudo-differential operators. To cite this article: R. Alexandre et al., CR Acad. Sci. Paris, Ser. I 347 (2009).

In this paper, we discuss error estimates associated with three different aggregation-diffusion splitting schemes for the Keller-Segel equations. We start with one algorithm based on the Trotter product formula, and we show that the convergence rate is CΔt, where Δt is the time-step size. Secondly, we prove the convergence rate CΔt2 for the Strang's splitting. Lastly, we study a splitting scheme with the linear transport approximation, and prove the convergence rate CΔt.

No abstract uploaded!