It is well known that the nonlinear filter has important applications in military, engineering and commercial industries. In this paper, we propose efficient and accurate numerical algorithms for the realization of the Yau-Yau method for solving nonlinear filtering problems by using finite difference schemes. The Yau-Yau method reduces the nonlinear filtering problem to the initial-value problem of Kolmogorov equations. We first solve this problem by the implicit Euler method, which is stable in most cases, but costly. Then, we propose a quasi-implicit Euler method which is feasible for acceleration by fast Fourier transformations. Furthermore, we propose a superposition technique which enables us to deal with the nonlinear filtering problem in an off-time process and thus, save a large amount of computational cost. Next, we prove that the numerical solutions of Kolmogorov equations by our schemes are always nonnegative in each iteration. Consequently, our iterative process preserves the probability density functions. In addition, we prove convergence of our schemes under some mild conditions. Numerical results show that the proposed algorithms are efficient and promising.

We consider the quermassintegral preserving flow of closed \emph{h-convex} hypersurfaces in hyperbolic space with the speed given by any positive power of a smooth symmetric, strictly increasing, and homogeneous of degree one function $f$ of the principal curvatures which is inverse concave and has dual $f_*$ approaching zero on the boundary of the positive cone. We prove that if the initial hypersurface is \emph{h-convex}, then the solution of the flow becomes strictly \emph{h-convex} for $t>0$, the flow exists for all time and converges to a geodesic sphere exponentially in the smooth topology.

No abstract uploaded!

This paper is concerned with a mean-reversion trading rule. In contrast to most market models treated in the literature, the underlying market is solely determined by a two-state Markov chain. The major advantage of such Markov chain model is its striking simplicity and yet its capability of capturing various market movements. The purpose of this paper is to study an optimal trading rule under such a model. The objective of the problem under consideration is to nd a sequence stopping (buying and selling) times so as to maximize an expected return. Under some suitable conditions, explicit solutions to the associated HJ equations (variational inequalities) are obtained. The optimal stopping times are given in terms of a set of threshold levels. A verication theorem is provided to justify their optimality. Finally, a numerical example is provided to illustrate the results.

In this paper we first introduce a fractional form formula among a number of Euler’s formulas. We then extend the formula and with mathematical induction prove the case when the number of terms increases and the exponent is integer. Afterwards, we study the connection between Euler’s formula and Lagrange interpolating polynomial and use the latter to prove part of the extended formula. We then obtain a new formula from this connection. At last, we derive a set of new equations from the extended formula.