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.

Based on work of Rasmussen [Ras03], we construct a concordance invariant associated to the knot Floer complex, and exhibit examples in which this invariant gives arbitrarily better bounds on the 4-ball genus than the Ozsv ́ath-Szab ́o τ invariant.

Given an element in the first homology of a rational homology 3-sphere Y, one can consider the minimal rational genus of all knots in this homology class. This defines a function Θ on H1(Y;Z), which was introduced by Turaev as an analogue of Thurston norm. We will give a lower bound for this function using the correction terms in Heegaard Floer homology. As a corollary, we show that Floer simple knots in L-spaces are genus minimizers in their homology classes, hence answer questions of Turaev and Rasmussen about genus minimizers in lens spaces.

Two Dehn surgeries on a knot are called purely cosmetic, if they yield manifolds that are homeomorphic as oriented manifolds. Suppose there exist purely cosmetic surgeries on a knot in S^3, we show that the two surgery slopes must be the opposite of each other. One ingredient of our proof is a Dehn surgery formula for correction terms in Heegaard Floer homology.

We introduce a new adaptive method for analyzing nonlinear and nonstationary data. This method is inspired by the empirical mode decomposition (EMD) method and the recently developed compressed sensing theory. The main idea is to look for the sparsest representation of multiscale data within the largest possible dictionary consisting of intrinsic mode functions of the form {a(t) cos(θ(t))}, where a ≥ 0 is assumed to be smoother than cos(θ(t)) and θ is a piecewise smooth increasing function. We formulate this problem as a nonlinear L1 optimization problem. Further, we propose an iterative algorithm to solve this nonlinear optimization problem recursively. We also introduce an adaptive filter method to decompose data with noise. Numerical examples are given to demonstrate the robustness of our method and comparison is made with the EMD method. One advantage of performing such a decomposition is to preserve some intrinsic physical property of the signal, such as trend and instantaneous frequency. Our method shares many important properties of the original EMD method. Because our method is based on a solid mathematical formulation, its performance does not depend on numerical parameters such as the number of shifting or stop criterion, which seem to have a major effect on the original EMD method. Our method is also less sensitive to noise perturbation and the end effect compared with the original EMD method.