No abstract uploaded!

In this paper, we construct some unirational Calabi–Yau threefolds in characteristic 3. We adopt the method by Schoen, but we use quasi-elliptic surfaces instead of elliptic surfaces. We find new examples which do not admit a lifting to characteristic zero.

We consider the solution of large-scale Lyapunov and Stein equations. For Stein equations, the well-known Smith method will be adapted, with A_k = A^{2^k} not explicitly computed but in the recursive form A_k = A^{2^k}, and the fast growing but diminishing components in the approximate solutions truncated. Lyapunov equations will be first treated with the Cayley transform before the Smith method is applied. For algebraic equations with numerically low-ranked solutions of dimension <i>n</i>, the resulting algorithms are of an efficient <i>O</i>(<i>n</i>) computational complexity and memory requirement per iteration and converge essentially quadratically. An application in the estimation of a lower bound of the condition number for continuous-time algebraic Riccati equations is presented, as well as some numerical results.

In the long-time scale, we consider the fluid dynamical limits for the kinetic equations when the fluctuation is decomposed into even and odd parts with respect to the microscopic velocity with different scalings. It is shown that when the background state is an absolute Maxwellian, the limit fluid dynamical equations are the incompressible Navier-Stokes equations with viscous heating. This is different from the case when the even and odd parts of the fluctuation have the same scaling where the standard incompressible Navier-Stokes equations without viscous heating are obtained. On the other hand, when the background is a local Maxwellian, it is shown that the above even-odd decomposition leads to a non-classical fluid dynamical system without viscous heating which has been used to describe the ghost effect in the kinetic theory. In addition, the above even-odd decomposition is justified rigorously for the Boltzmann equation for the former case when the background is an absolute Maxwellian.

The immersed boundary method is one of the most useful computational methods in studying fluid structure interaction. On the other hand, the Immersed Boundary method is also known to require small time steps to maintain stability when solved with an explicit method. Many implicit or approximately implicit methods have been proposed in the literature to remove this severe time step stability constraint, but none of them give satisfactory performance. In this paper, we propose an efficient semi-implicit scheme to remove this stiffness from the immersed boundary method for the Navier–Stokes equations. The construction of our semi-implicit scheme consists of two steps. First, we obtain a semiimplicit discretization which is proved to be unconditionally stable. This unconditionally stable semi-implicit scheme is still quite expensive to implement in practice. Next, we apply the small scale decomposition to the unconditionally stable semi-implicit scheme to construct our efficient semi-implicit scheme. Unlike other implicit or semi-implicit schemes proposed in the literature, our semi-implicit scheme can be solved explicitly in the spectral space. Thus the computational cost of our semi-implicit schemes is comparable to that of an explicit scheme. Our extensive numerical experiments show that our semiimplicit scheme has much better stability property than an explicit scheme. This offers a substantial computational saving in using the immersed boundary method.