四阶方程两点边值问题Hermite有限元解的渐近展式与外推

1引言有限元解的渐近展式是提高微分方程数值解精度的重要工具,比如亏量校正和外推就是建立在有限元解的渐近展式的基础之上．许多作者对此进行了大量的研究(见[1]-[4]),特别是文[1],提出了在研究有限元解的渐近展式中十分有用的能量嵌入技巧．本文利用能量嵌入定理得到了四阶方程两点边值问题Hermite有限元解及其二阶平均导数的渐近展式,进一步我们还讨论了它们的Richardson外推公式．考虑四阶方程两点边值问题     

Generalized 3G theorem and application to relativistic stable process on non-smooth open sets

Let G(x,y) and GD(x,y) be the Green functions of rotationally invariant symmetric α-stable process in Rd and in an open set D, respectively, where 0<α<2. The inequality GD(x,y)GD(y,z)/GD(x,z)?c(G(x,y)+G(y,z)) is a very useful tool in studying (local) Schrödinger operators. When the above inequality is true with c=c(D)∈(0,∞), then we say that the 3G theorem holds in D. In this paper, we establish a generalized version of 3G theorem when D is a bounded κ-fat open set, which includes a bounded John domain. The 3G we consider is of the form GD(x,y)GD(z,w)/GD(x,w), where y may be different from z. When y=z, we recover the usual 3G. The 3G form GD(x,y)GD(z,w)/GD(x,w) appears in non-local Schrödinger operator theory. Using our generalized 3G theorem, we give a concrete class of functions belonging to the non-local Kato class, introduced by Chen and Song, on κ-fat open sets. As an application, we discuss relativistic α-stable processes (relativistic Hamiltonian when α=1) in κ-fat open sets. We identify the Martin boundary and the minimal Martin boundary with the Euclidean boundary for relativistic α-stable processes in κ-fat open sets. Furthermore, we show that relative Fatou type theorem is true for relativistic stable processes in κ-fat open sets. The main results of this paper hold for a large class of symmetric Markov processes, as are illustrated in the last section of this paper. We also discuss the generalized 3G theorem for a large class of symmetric stable Lévy processes.     

On the uniqueness of the foliation of spheres of constant mean curvature in asymptotically flat 3-manifolds

In this note we study constant mean curvature surfaces in asymptotically flat 3-manifolds. We prove that, outside a given compact subset in an asymptotically flat 3-manifold with positive mass, stable spheres of given constant mean curvature are unique. Therefore we are able to conclude that the foliation of stable spheres of constant mean curvature in an asymptotically flat 3-manifold with positive mass outside a given compact subset is unique.

     

具功能反应的三种群捕食者——食饵系统数学模型稳定性的研究

[1]中提出了具有功能反应的三种群捕食者——食饵系统的两种模型(Ⅰ)、(Ⅱ),并给出了局部渐近稳定的条件。本文研究了另外两种模型(Ⅲ)和(Ⅳ)的局部渐近稳定的条件。     

强混合样本下回归加权估计的一致渐近正态性

在强混合样本下,讨论固定设计回归模型的加权函数估计的一致渐近正态性,给出一致渐近正态性的收敛速度,这个速度接近n-1／6．     

Decay Rates in Probability Metrics Towards Homogeneous Cooling States for the Inelastic Maxwell Model

We quantify the long-time behavior of solutions to the nonlinear Boltzmann equation for spatially uniform freely cooling inelastic Maxwell molecules by means of the contraction property of a suitable metric in the set of probability measures. Existence, uniqueness, and precise estimates of overpopulated high energy tails of the self-similar profile proved in ref. 9 are revisited and derived from this new Liapunov functional. For general initial conditions the solutions of the Boltzmann equation are then proved to converge with computable rate as t → ∞ to the self-similar solution in this distance, which metrizes the weak convergence of measures. Moreover, we can relate this Fourier distance to the Euclidean Wasserstein distance or Tanaka functional proving also its exponential convergence towards the homogeneous cooling states. The findings are relevant in the understanding of the conjecture formulated by Ernst and Brito in refs. 15, 16, and complement and improve recent studies on the same problem of Bobylev and Cercignani⁽⁹⁾ and Bobylev, Cercignani and one of the authors.⁽¹¹⁾     

求解比例延迟微分方程的Rosenbrock方法的渐近稳定性(英文)

本文讨论了一类Rosenbrock方法求解比例延迟微分方程,y′(t)=λy(t) μy(qt),λ,μ∈C,0     

On the Erlang Loss Model with Time Dependent Input

We consider the M(t)/M(t)/m/m queue, where the arrival rate λ(t) and service rate μ(t) are arbitrary (smooth) functions of time. Letting p_n(t) be the probability that n servers are occupied at time t (0≤ n≤ m, t > 0), we study this distribution asymptotically, for m→∞ with a comparably large arrival rate λ(t) = O(m) (with μ(t) = O(1)). We use singular perturbation techniques to solve the forward equation for p_n(t) asymptotically. Particular attention is paid to computing the mean number of occupied servers and the blocking probability p_m(t). The analysis involves several different space-time ranges, as well as different initial conditions (we assume that at t = 0 exactly n₀ servers are occupied, 0≤ n₀≤ m). Numerical studies back up the asymptotic analysis. AMS subject classification: 60K25,34E10 Supported in part by NSF grants DMS-99-71656 and DMS-02-02815     

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality. This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA.     

一类非线性常微分方程振荡解的渐近表示

在本文中,我们讨论了非线性常微分方程y"=a0|x|αy3 a1|x|βy2 α2|x|γy α3|x|δ振荡解的渐近表示．在这个方程中将α0,α,α1,β,α2,γ,α3,δ分别换成0,0,6,0,0,0,sgn(x),1就是著名的第一类Painleve方程,而将α0,α,α1,β,α2,γ,α3,δ分别换成2,0,0,0,sgn(x),1,α0,就是著名的第二类Painleve方程．当α0,α,α1,β,α2,γ,α3,δ分别换成-β/3γ,0,0,0,1/γ,1,α,0时,可用于组合KdV方程孤立子解的化简．