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.

No abstract uploaded!

Topological qauntum field theory(TQFT) is a very powerful theoretical tool to study topological phases and phase transitions. In 2+1D, it is well known that the Chern-Simons theory captures all the universal topological data of topological phases, e.g., quasi-particle braiding statistics, chiral central charge and even provides us a deep insight for the nature of topological phase transitions. Recently, topological phases of quantum matter are also intensively studied in 3+1D and it has been shown that loop like excitation obeys the so-called three-loop-braiding statistics. In this paper, we will try to establish a TQFT framework to understand the quantum statistics of particle and loop like excitation in 3+1D. We will focus on Abelian topological phases for simplicity, however, the general framework developed here is not limited to Abelian topological phases.

We give a new, simple algorithm for simultaneous degree elevation and knot insertion for B-spline curves. The method is based on the simple approach of computing derivatives using the control points, resampling the knot vector, and then computing the new control points from the derivatives. We compare our approach with previous algorithms and illustrate it with examples.

The main object of this paper is to find a criterion for comparison of two tests for non-parametric hypotheses, taking advantage of the qualitative information that may exist. After a detailed analysis of the problem and some earlier suggestins for its solution (sections 2–4), a criterion is suggested in section 5. In order to apply it to a concrete case, a location problem is specified in section 6. The rank tests to be compared are analyzed in section 7, and the comparison by way of the criterion is carried out in section 8. It turns out that sign tests, sometimes slightly modified, are very often optimal according to the criterion used.