We prove an estimate on the smallest singular value of a multiplicatively and additively deformed random rectangular matrix. Suppose $n\le N \le M \le dN$ for some constant $d\ge 1$. Let $X$ be an $M\times n$ random matrix with independent and identically distributed entries, which have zero mean, unit variance and arbitrarily high moments. Let $T$ be an $N\times M$ deterministic matrix with comparable singular values $c\le s_{N}(T) \le s_{1}(T) \le c^{-1}$ for some constant $c>0$. Let $A$ be an $N\times n$ deterministic matrix with $\|A\|=O(\sqrt{N})$. Then we prove that for any $\epsilon>0$, the smallest singular value of $TX-A$ is larger than $N^{-\epsilon}(\sqrt{N}-\sqrt{n-1})$ with high probability. If we assume further the entries of $X$ have subgaussian decay, then the smallest singular value of $TX-A$ is at least of the order $\sqrt{N}-\sqrt{n-1}$ with high probability, which is an essentially optimal estimate.

Given an acyclic representation  of the fundamental group of a compact oriented odd-dimensional manifold, which is close enough to an acyclic unitary representation, we define a refinement T of the Ray-Singer torsion associated to , which can be viewed as the analytic counterpart of the refined combinatorial torsion introduced by Turaev. T is equal to the graded determinant of the odd signature operator up to a correction term, the metric anomaly, needed to make it independent of the choice of the Riemannian metric.T is a holomorphic function on the space of such representations of the fundamental group. When  is a unitary representation, the absolute value of T is equal to the Ray-Singer torsion and the phase of T is proportional to the -invariant of the odd signature operator. The fact that the Ray-Singer torsion and the-invariant can be combined into one holomorphic function allows one to use methods of complex analysis to study both invariants. In particular, using these methods we compute the quotient of the refined analytic torsion and Turaev’s refinement of the combinatorial torsion generalizing in this way the classical Cheeger-M¨uller theorem. As an application, we extend and improve a result of Farber about the relationship between the Farber-Turaev absolute torsion and the -invariant. As part of our construction of T we prove several new results about determinants and -invariants of non self-adjoint elliptic operators.

We propose the notion of partial resolution of a ring, which is by definition the endomorphism ring of a certain generator of the given ring. We prove that the singularity category of the partial resolution is a quotient of the singularity category of the given ring. Consequences and examples are given.

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.

This article studied the speed of addition and multiplication of natural number in different scale systems, the times of addition and multiplication in different scale systems have been compared quantificationally through a function model presented. The conclusion is that binary system is the best for addition, binary system and ternary system are better than other scale systems for multiplication, and they each has a suitable range.