No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

We construct a local Lax-Friedrichs type positivity-preserving flux for compressible Navier-Stokes equations, which can be easily extended to high dimensions for generic forms of equations of state, shear stress tensor and heat flux. With this positivity-preserving flux, any finite volume type schemes including discontinuous Galerkin (DG) schemes with strong stability preserving Runge-Kutta time discretizations satisfy a weak positivity property. With a simple and effi- cient positivity-preserving limiter, high order explicit Runge-Kutta DG schemes are rendered preserving the positivity of density and internal energy without los- ing local conservation or high order accuracy. Numerical tests suggest that the positivity-preserving flux and the positivity-preserving limiter do not induce excessive artificial viscosity, and the high order positivity-preserving DG schemes without other limiters can produce satisfying non-oscillatory solutions when the nonlinear diffusion in compressible Navier-Stokes equations is accurately resolved.

It is well known that the nonlinear filtering problem has important applications in both military and civil industries. The central problem of nonlinear filtering is to solve the Duncan-Mortensen-Zakai (DMZ) equation in real time and in a memoryless manner. In this paper, we shall extend the algorithm developed previously by S.-T. Yau and the second author to the most general setting of nonlinear filterings, where the explicit time-dependence is in the drift term, observation term, and the variance of the noises could be a matrix of functions of both time and the states. To preserve the off-line virture of the algorithm, necessary modifications are illustrated clearly. Moreover, it is shown rigorously that the approximated solution obtained by the algorithm converges to the real solution in the $L^1$ sense. And the precise error has been estimated. Finally, the numerical simulation support the feasibility and efficiency of our algorithm.