No abstract uploaded!

No abstract uploaded!

In two earlier papers with the same title, we studied connections between Voronoi’s formula in the divisor problem and Atkinson’s formula for the mean square of Riemann’s zeta-function. Now we consider this correspondence in terms of segments of sums appearing in these formulae and show that a certain arithmetic conjecture concerning the divisor function implies best possible bounds for the classical error terms Δ($x$) and$E$($T$).

No abstract uploaded!

We present novel algorithms for compressible flows that\n\nare efficient for all Mach numbers. The approach is based on several\n\ningredients: semi-implicit schemes, the gauge decomposition\n\nof the velocity field and a second order formulation of the density\n\nequation (in the isentropic case) and of the energy equation (in\n\nthe full Navier-Stokes case). Additionally, we show that our approach\n\ncorresponds to a micro-macro decomposition of the model,\n\nwhere the macro field corresponds to the incompressible component\n\nsatisfying a perturbed low Mach number limit equation and\n\nthe micro field is the potential component of the velocity. Finally,\n\nwe also use the conservative variables in order to obtain a proper\n\nconservative formulation of the equations when the Mach number\n\nis order unity. We successively consider the isentropic case, the\n\nfull Navier-Stokes case, and the isentropic Navier-Stokes-Poisson\n\ncase. In this work, we only concentrate on the question of the\n\ntime discretization and show that the proposed method leads to\n\nAsymptotic Preserving schemes for compressible flows in the low\n\nMach number limit.