ON THE ERROR ESTIMATES OF A NEW OPERATE SPLITTING METHOD FOR THE NAVIER-STOKES EQUATIONS

In this paper, a new operator splitting scheme is introduced for the numerical solution of the incompressible Navier-Stokes equations. Under some mild regularity assumptions on the PDE solution, the stability of the scheme is presented, and error estimates for the velocity and the pressure of the proposed operator splitting scheme are given.     

CONSTRUCTION OF GEOMETRIC PARTIAL DIFFERENTIAL EQUATIONS FOR LEVEL SETS

Geometric partial differential equations of level-set form are usually constructed by a variational method using either Dirac delta function or co-area formula in the energy functional to be minimized. However, the equations derived by these two approaches are not consistent. In this paper, we present a third approach for constructing the level-set form equations. By representing various differential geometry quantities and differential geometry operators in terms of the implicit surface, we are able to reformulate three classes of parametric geometric partial differential equations （second-order, fourth-order and sixth- order） into the level-set forms. The reformulation of the equations is generic and simple, and the resulting equations are consistent with their parametric form counterparts. We further prove that the equations derived using co-area formula are also consistent with the parametric forms. However, these equations are of much complicated forms than these given by the equations we derived.     

A LIL and limit distributions for trimmed sums of random vectors attracted to operator semi-stable laws

Let θ∈ Rdbe a unit vector and let X,X1,X2,...be a sequence of i.i.d.Rd-valued random vectors attracted to operator semi-stable laws.For each integer n ≥ 1,let X1,n ≤···≤ Xn,n denote the order statistics of X1,X2,...,Xn according to priority of index,namely | X1,n,θ | ≥···≥ | Xn,n,θ |,where ·,· is an inner product on Rd.For all integers r ≥ 0,define by(r)Sn = n-ri=1Xi,n the trimmed sum.In this paper we investigate a law of the iterated logarithm and limit distributions for trimmed sums(r)Sn.Our results give information about the maximal growth rate of sample paths for partial sums of X when r extreme terms are excluded.A stochastically compactness of(r)Sn is obtained.     

SOME RESULTS ON BEST APPROXIMATION IN SPACES WITH CONVEX STRUCTURE

Some generalizations of the result proved by S.P. Singh [J. Approx. Theory 25（1979）, 89-90] are presented in convex metric spaces. The results proved contain several known results on the subject.     

Combinatorial principles between RRT 2 2 and RT 2 2

We study the strength of some combinatorial principles weaker than Ramsey theorem for pairs over RCA0. First, we prove that Rainbow Ramsey theorem for pairs does not imply Thin Set theorem for pairs. Furthermore, we get some other related results on reverse mathematics using the same method. For instance, Rainbow Ramsey theorem for pairs is strictly weaker than ErdSs- Moser theorem under RCA0.     

On a criterion of universal spectra

For positive integers N1 , N2 , . . . , Nn , let L = Zn + A and Λ = N1Z ×···× NnZ + Γ be two rational periodic sets, where A(1/N1 )Z ×···× (1/Nn)Z and ΓZn are finite sets with (A-A) ∩ Zn = {0} and (Γ-Γ) ∩ (N1Z ×···× NnZ) = {0}. In this note, we shall determine conditions under which the tiling set L has universal spectrum Λ. We first obtain a criterion of universal spectra. This criterion combined with the properties of compatible pair yields many necessary and sufficient conditions for Λ to be a universal spectrum for L. We then show that, under some mild additional conditions, the conjecture of Lagarias and Szabó is true. The results here extend the corresponding results of Lagarias, Szabó and Wang.     

A NEW TRUST-REGION ALGORITHM FOR NONLINEAR CONSTRAINED OPTIMIZATION

We propose a new trust region algorithm for nonlinear constrained optimization problems. In each iteration of our algorithm, the trial step is computed by minimizing a quadratic approximation to the augmented Lagrange function in the trust region. The augmented Lagrange function is also used as a merit function to decide whether the trial step should be accepted. Our method extends the traditional trust region approach by combining a filter technique into the rules for accepting trial steps so that a trial step could still be accepted even when it is rejected by the traditional rule based on merit function reduction. An estimate of the Lagrange multiplier is updated at each iteration, and the penalty parameter is updated to force sufficient reduction in the norm of the constraint violations. Active set technique is used to handle the inequality constraints. Numerical results for a set of constrained problems from the CUTEr collection are also reported.     

On the Clique-Transversal Number in （Claw,K4）-Free 4-Regular Graphs

A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G.The clique-transversal number,denoted by τC(G),is the minimum cardinality of a clique-transversal set in G.In this paper,we first present a lower bound on τC(G) and characterize the extremal graphs achieving the lower bound for a connected(claw,K4)-free 4-regular graph G.Furthermore,we show that for any 2-connected(claw,K4)-free 4-regular graph G of order n,its clique-transversal number equals to [n/3].     

A Remark on Pal Type Interpolation on Non-Uniformly Distributed Nodes on the Unit Circle

In this paper we study the problem of explicit representation and convergence of Pal type （0;1） interpolation and its converse, with some additional conditions, on the non-uniformly distributed nodes on the unit circle obtaIned by projecting the interlaced zeros of Pn （x） and Pn′ （x） on the unit circle. The motivation to this problem can be traced to the recent studies on the regularity of Birkhoff interpolation and Pal type interpolations on non-uniformly distributed zeros on the unit circle.     

Stable Border Bases for Ideals of Numerical Cartesian Sets

In this paper, we discuss a special class of sets of bivariate empirical points, namely, numerical cartesian sets. We find that the stable quotient bases for numerical cartesian sets are unique if they exist. Furthermore, the corresponding border bases are the unique stable border bases for the vanishing ideals of numerical cartesian sets.     

CONVERGENCE OF AN IMMERSED INTERFACE UPWIND SCHEME FOR LINEAR ADVECTION EQUATIONS WITH PIECEWISE CONSTANT COEFFICIENTS I： L^1-ERROR ESTIMATES

We study the L^l-error estimates for the upwind scheme to the linear advection equations with a piecewise constant coefficients modeling linear waves crossing interfaces. Here the interface condition is immersed into the upwind scheme. We prove that, for initial data with a bounded variation, the numerical solution of the immersed interface upwind scheme converges in L^l-norm to the differential equation with the corresponding interface condition. We derive the one-halfth order L^l-error bounds with explicit coefficients following a technique used in [25]. We also use some inequalities on binomial coefficients proved in a consecutive paper [32].     

一类三阶有理差分方程的奇点集和解的渐近性

研究三阶有理差分方程x_(n+1)=ax_(n-1)+x_(n-1)x_n/bx_(n-2)+cx_n,n=0,1,2,...的奇点集和解{x_n}_(n=-2)~∞的渐近性,其中a,b,c∈R,初始值x_(-2),x_(-1),x_0∈R.由a,b,c的取值的不同,而得到解的不同的渐近性.     

Multiplicity results on a nonlinear biharmonic equation

Let ω be a bounded open set in Rn with smooth boundary ω We are concerned with a fourth order semilinear elliptic boundary value problem Δ²u + cΔu = bu⁺ + s inω under Dirichlet boundary condition. We investigate the existence of solutions of the fourth order nonlinear equation (0.1) when the nonlinearity bu⁺ crosses eigenvalues of Δ² + cΔ under Dirichlet boundary condition.     

IMAGE SEGMENTATION BY PIECEWISE CONSTANT MUMFORD-SHAH MODEL WITHOUT ESTIMATING THE CONSTANTS

In this work, we try to use the so-called Piecewise Constant Level Set Method （PCLSM） for the Mumford-Shah segmentation model. For image segmentation, the Mumford-Shah model needs to find the regions and the constant values inside the regions for the segmen- tation. In order to use PCLSM for this purpose, we need to solve a minimization problem using the level set function and the constant values as minimization variables. In this work, we test on a model such that we only need to minimize with respect to the level set function, i.e., we do not need to minimize with respect to the constant values. Gradient descent method and Newton method are used to solve the Euler-Lagrange equation for the minimization problem. Numerical experiments are given to show the efficiency and advantages of the new model and algorithms.     

A PERTURBATION METHOD FOR THE NUMERICAL SOLUTION OF THE BERNOULLI PROBLEM

We consider the numerical solution of the free boundary Bernoulli problem by employing level set formulations. Using a perturbation technique, we derive a second order method that leads to a fast iteration solver. The iteration procedure is adapted in order to work in the case of topology changes. Various numerical experiments confirm the efficiency of the derived numerical method.     

PREDUAL SPACES FOR Q SPACES

To find the predual spaces Pα（R^n） of Qα（R^n） is an important motivation in the study of Q spaces. In this article, wavelet methods are used to solve this problem in a constructive way. First, an wavelet tent atomic characterization of Pα（Rn） is given, then its usual atomic characterization and Poisson extension characterization are given. Finally, the continuity on Pα of Calderon-Zygmund operators is studied, and the result can be also applied to give the Morrey characterization of Pα（Rn）.     

STABILIZED FEM FOR CONVECTION-DIFFUSION PROBLEMS ON LAYER-ADAPTED MESHES

The application of a standard Galerkin finite element method for convection-diffusion problems leads to oscillations in the discrete solution, therefore stabilization seems to be necessary. We discuss several recent stabilization methods, especially its combination with a Galerkin method on layer-adapted meshes. Supercloseness results obtained allow an improvement of the discrete solution using recovery techniques.     

A TWO-SCALE HIGHER-ORDER FINITE ELEMENT DISCRETIZATION FOR SCHROEDINGER EQUATION

In this paper, a two-scale higher-order finite element discretization scheme is proposed and analyzed for a Schroedinger equation on tensor product domains. With the scheme, the solution of the eigenvalue problem on a fine grid can be reduced to an eigenvalue problem on a much coarser grid together with some eigenvalue problems on partially fine grids. It is shown theoretically and numerically that the proposed two-scale higher-order scheme not only significantly reduces the number of degrees of freedom but also produces very accurate approximations.     

FINITE ELEMENTS WITH LOCAL PROJECTION STABILIZATION FOR INCOMPRESSIBLE FLOW PROBLEMS

In this paper we review recent developments in the analysis of finite element methods for incompressible flow problems with local projection stabilization （LPS）. These methods preserve the favourable stability and approximation properties of classical residual-based stabilization （RBS） techniques but avoid the strong coupling of velocity and pressure in the stabilization terms. LPS-methods belong to the class of symmetric stabilization techniques and may be characterized as variational multiscale methods. In this work we summarize the most important a priori estimates of this class of stabilization schemes developed in the past 6 years. We consider the Stokes equations, the Oseen linearization and the NavierStokes equations. Furthermore, we apply it to optimal control problems with linear（ized） flow problems, since the symmetry of the stabilization leads to the nice feature that the operations ＂discretize＂ and ＂optimize＂ commute.     

AN EFFICIENT METHOD FOR MULTIOBJECTIVE OPTIMAL CONTROL AND OPTIMAL CONTROL SUBJECT TO INTEGRAL CONSTRAINTS

We introduce a new and efficient numerical method for multicriterion optimal control and single criterion optimal control under integral constraints. The approach is based on extending the state space to include information on a ＂budget＂ remaining to satisfy each constraint; the augmented Hamilton-Jacobi-Bellman PDE is then solved numerically. The efficiency of our approach hinges on the causality in that PDE, i.e., the monotonicity of characteristic curves in one of the newly added dimensions. A semi-Lagrangian ＂marching＂ method is used to approximate the discontinuous viscosity solution efficiently. We compare this to a recently introduced ＂weighted sum＂ based algorithm for the same problem [25]. We illustrate our method using examples from flight path planning and robotic navigation in the presence of friendly and adversarial observers.