Plurisubharmonic polynomials and bumping

We wish to study the problem of bumping outwards a pseudoconvex, finite-type domain in such a way that pseudoconvexity is preserved and such that the lowest possible orders of contact of the bumped domain with ∂Ω, at the site of the bumping, are explicitly realised. Generally, when , the known methods lead to bumpings with high orders of contact—which are not explicitly known either—at the site of the bumping. Precise orders are known for h-extendible/semiregular domains. This paper is motivated by certain families of non-semiregular domains in . These families are identified by the behaviour of the least-weight plurisubharmonic polynomial in the Catlin normal form. Accordingly, we study how to perturb certain homogeneous plurisubharmonic polynomials without destroying plurisubharmonicity. The first-named author is supported by a grant from the UGC under DSA-SAP, Phase IV.     

New results for global stability of a class of neutral-type neural systems with time delays

This paper studies the global convergence properties of a class of neutral-type neural networks with discrete time delays. This class of neutral systems includes Cohen–Grossberg neural networks, Hopfield neural networks and cellular neural networks. Based on the Lyapunov stability theorems, some delay independent sufficient conditions for the global asymptotic stability of the equilibrium point for this class of neutral-type systems are derived. It is shown that the results presented in this paper for neutral-type delayed neural networks are the generalization of a recently reported stability result. A numerical example is also given to demonstrate the applicability of our proposed stability criteria.     

Diameter preserving bijections between Grassmann spaces over Bezout domains

Let R, S be Bezout domains. Assume that n is an integer ≥ 3, 1 ≤ k ≤ n − 2. Denoted by the k-dimensional Grassmann space on . Let be a map. This paper proves the following are equivalent: (i) is an adjacency preserving bijection in both directions. (ii) is a diameter preserving bijection in both directions. Moreover, Chow’s theorem on Grassmann spaces over division rings is extended to the case of Bezout domains: If is an adjacency preserving bijection in both directions, then is induced by either a collineation or the duality of a collineation. Project 10671026 supported by National Natural Science Foundation of China.     

A powerful route minimization heuristic for the vehicle routing problem with time windows

We suggest an efficient route minimization heuristic for the vehicle routing problem with time windows. The heuristic is based on the ejection pool, powerful insertion and guided local search strategies. Experimental results on the Gehring and Homberger’s benchmarks demonstrate that our algorithm outperforms previous approaches and found 18 new best-known solutions.     

Strichartz type estimates for fractional heat equations

We obtain Strichartz estimates for the fractional heat equations by using both the abstract Strichartz estimates of Keel-Tao and the Hardy-Littlewood-Sobolev inequality. We also prove an endpoint homogeneous Strichartz estimate via replacing by BMOx(Rn) and a parabolic homogeneous Strichartz estimate. Meanwhile, we generalize the Strichartz estimates by replacing the Lebesgue spaces with either Besov spaces or Sobolev spaces. Moreover, we establish the Strichartz estimates for the fractional heat equations with a time dependent potential of an appropriate integrability. As an application, we prove the global existence and uniqueness of regular solutions in spatial variables for the generalized Navier-Stokes system with Lr(Rn) data.     

抛物型方程的一种高精度区域分解有限差分算法

1引言 近年来,区域分解算法以可以将大型问题分解为一系列小型问题以减少计算规模及算法可高度并行实现等特点受到了人们的广泛关注.前人也做了很多很好的工作:参考文献[1]中C.N.Dawson等人提出了显一隐格式的区域分解算法,在时间层不分层的内边界点采用大步长向前-中心差分显格式及在内点采用古典隐格式,取得的精度为O(△t+h2+H3).参考文献[2]中给出了[1]中区域分解算法对于内边界点为等距分布的多子区域时的新的误差估计,使含H3误差项的系数比[1]中缩小了一倍.还将采用大步长日的saul'yev的非对称差分格式应用于内边界点,并给出了两个子区域和多个子区域情形下差分解的先验误差估计.     

使用PML技术求解Helmholtz方程的几种区域分解算法

1引言 在科学与工程计算中,时谐声波和电磁波散射现象的模拟常归结为Helmholtz方程的数值求解,这是一个重要而具有挑战性的问题.     

Convergence analysis of a balancing domain decomposition method for solving a class of indefinite linear systems

A variant of balancing domain decomposition method by constraints (BDDC) is proposed for solving a class of indefinite systems of linear equations of the form (K?σ²M)u=f, which arise from solving eigenvalue problems when an inverse shifted method is used and also from the finite element discretization of Helmholtz equations. Here, both K and M are symmetric positive definite. The proposed BDDC method is closely related to the previous dual–primal finite element tearing and interconnecting method (FETI‐DP) for solving this type of problems (Appl. Numer. Math. 2005; 54 :150–166), where a coarse level problem containing certain free‐space solutions of the inherent homogeneous partial differential equation is used in the algorithm to accelerate the convergence. Under the condition that the diameters of the subdomains are small enough, the convergence rate of the proposed algorithm is established, which depends polylogarithmically on the dimension of the individual subdomain problems and which improves with a decrease of the subdomain diameters. These results are supported by numerical experiments of solving a two‐dimensional problem. Copyright © 2009 John Wiley & Sons, Ltd.     

Carleson measures on planar sets

In this paper, we investigate what are Carleson measures on open subsets in the complex plane. A circular domain is a connected open subset whose boundary consists of finitely many disjoint circles. We call a domain G multi-nicely connected if there exists a circular domain W and a conformal map ψ from W onto G such that ψ is almost univalent with respect the arclength on δW. We characterize all Carleson measures for those open subsets so that each of their components is multinicely connected and harmonic measures of the components are mutually singular. Our results suggest the extension of Carleson measures probably is up to this class of open subsets     

Asymptotic Results for the Sum of Dependent Non-identically Distributed Random Variables

In this paper we extend some results about the probability that the sum of n dependent subexponential random variables exceeds a given threshold u. In particular, the case of non-identically distributed and not necessarily positive random variables is investigated. Furthermore we establish criteria how far the tail of the marginal distribution of an individual summand may deviate from the others so that it still influences the asymptotic behavior of the sum. Finally we explicitly construct a dependence structure for which, even for regularly varying marginal distributions, no asymptotic limit of the tail of the sum exists. Some explicit calculations for diagonal copulas and t-copulas are given. Dominik Kortschak was supported by the Austrian Science Fund Project P18392.