带Poisson跳年龄相关随机时滞种群系统的均方稳定性

本文研究了带Poisson跳年龄相关随机时滞种群系统均方稳定性的问题.在一定条件下,给出了数值解均方稳定的定义.利用补偿随机θ法讨论系统数值解的均方稳定性,给出数值解稳定的充分条件.获得了当1/2≤θ≤1时,对于任意的步长?τ/m,数值解是均方稳定的;当0≤θ1,时,如果步长?t∈(0,?t0),数值解是指数均方稳定的的结果.最后通过数值算例推广并验证了结果的有效性和正确性.     

滞后型分段连续随机微分方程的稳定性

本文研究了滞后型分段连续随机微分方程的解析稳定性和数值稳定性问题.首先,利用伊藤公式等方法获得了解析解均方稳定的条件,其次,对于包括均方稳定和T-稳定在内的Euler-Maruyama方法的数值稳定性问题,运用不等式技术和随机分析方法获得了一些新的结果,证明了在一定条件下,Euler-Maruyama方法既是均方稳定又是T-稳定的,推广了随机延迟微分方程的数值稳定性结论.     

求解二维浅水波方程的移动网格旋转通量法

为提高求解二维浅水波方程数值算法的分辨率,拟构造求解该方程的新算法:基于移动网格法,选用熵稳定数值通量函数,利用旋转不变性得到混合数值通量.该算法中,浅水波方程的数值求解和依据解的特性进行自适应疏密分布的网格计算过程交错进行.利用变分原理进行网格重构,新网格上的物理量采用二阶精度的守恒型插值公式计算,最终采用三阶强稳定Runge-Kutta法与满足热力学第二定律的熵稳定格式实现浅水波方程的数值求解.数值结果表明,新算法具有良好的间断捕捉能力,分辨率高.     

非线性中立型延迟积分微分方程单支方法的稳定性分析

本文研究求解R(α,β1,β2,γ)类非线性中立型延迟积分微分方程单支方法的数值稳定性,结果表明:在一定条件下,A-稳定的单支方法是数值稳定的,强A-稳定的单支方法是渐近稳定的,最后的数值试验验证了所获理论的正确性.     

非线性随机延迟微分方程Heun方法的数值稳定性

本文讨论一般非线性随机延迟微分方程Heun方法的数值稳定性,证明了如果问题本身满足零解是均方指数稳定和均方渐近稳定的充分条件,则当方程的漂移项进一步满足一定的条件时,Heun方法是Ms.稳定的,带线性插值的Heun方法是均方指数稳定的和GMS-稳定的理论结果.文末的数值试验进一步验证了所得的相关结论.     

滞后型分段连续随机微分方程的稳定性（英文）

本文研究了滞后型分段连续随机微分方程的解析稳定性和数值稳定性问题.首先,利用伊藤公式等方法获得了解析解均方稳定的条件,其次,对于包括均方稳定和T-稳定在内的Euler-Maruyama方法的数值稳定性问题,运用不等式技术和随机分析方法获得了一些新的结果,证明了在一定条件下,Euler-Maruyama方法既是均方稳定又是T-稳定的,推广了随机延迟微分方程的数值稳定性结论.     

一类多级隐式Hybrid单步法

§1 引言 众所周知,对于stiff常微分方程组的初值问题,能构造高阶A-稳定的隐式Rung-Kutta方法,但是,对非线性stiff系统的数值试验结果表明[2],[3],某些A-稳定的RK方法却得不到稳定的数值解。为此,A.Prothero在[4]中引入了更为合理的S-稳定的概念,证明了某些A-稳定的RK方法并不是S-稳定的。[3]中的数值试验结果恰好说明,这些A-稳定但不是S-稳定的方法的数值结果是不稳定的。     

Abel变换数值反演的积分算子方法

本文研究了Abel变换的数值反演问题.利用Abel变换的理论反演公式与数值求导的积分算子法相结合的方法,对反演公式中奇异积分合理处理,获得Abel变换数值反演的一种算法,并进行了理论分析与数值实验. 结果表明该算法具有计算简单、数值稳定等优点.     

求解二维Euler方程的旋转通量混合格式

为提高求解二维Euler方程数值结果的分辨率,提出了一种旋转通量混合格式.该算法采用旋转通量法的类一维处理思想,通量函数选用满足热力学第二定律的熵稳定数值通量和具有良好鲁棒性的HLL数值通量耦合的混合格式,时间方向采用三阶强稳定Runge-Kutta方法进行推进.该旋转通量混合格式具有结构简单、分辨率高的优点,数值结果...     

在有一级化学反应时粘弹性流体流经无限竖直多孔平板时的边界层流动

在有一级化学反应时,研究不可压缩的粘弹性流体,在竖直多孔连续运动平板上的不稳定自然对流.控制方程用隐式有限差分法进行数值求解.与解析解的结果比较,证明所选用的数值方法有效.详细图示了速度分布的数值结果.研究了粘弹性参数、无量纲化学反应参数和平板运动速度,对稳定的速度分布、与时间相关的摩擦因数、Nusselt数和Sherwood数的影响.     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001     

Homotopical stable ranks for Banach algebras

The connected stable rank and the general stable rank are homotopy invariants for Banach algebras, whereas the Bass stable rank and the topological stable rank should be thought of as dimensional invariants. This paper studies the two homotopical stable ranks, viz. their general properties as well as specific examples and computations. The picture that emerges is that of a strong affinity between the homotopical stable ranks, and a marked contrast with the dimensional ones.     

Complex Stable Sums of Complex Stable Random Variables

A definition of complex stable random variables is presented which includes earlier definitions as special cases. The class of complex stable random variables is characterized and is shown to be a subclass of the operator stable random variables. The exact conditions under which a sum of independent complex stable random variables is again complex stable are also found.     

Canonical monotone decompositions of fractional stable matchings

This paper continues recent work that introduced algebraic methods for studying the stable marriage problem of Gale and Shapley [1962]. Vande Vate [1989] and Rothblum [1992] identified a set of linear inequalities which define a polytope whose extreme points correspond to the stable matchings. Points in this polytope are called fractional stable matchings. Here we identify a unique representation of fractional stable matchings as a convex combination of stable matchings that are arrangeable in a man-decreasing order. We refer to this representation and to a dual one, in terms of woman-decreasing order, as the canonical monotone representations. These representations can be interpreted as time-sharing stable matchings where particular stable matchings are used at each time-instance but the scheduled stable matchings are (occasionally) switched over time. The new representations allow us to extend, in a natural way, the lattice structure of the set of stable matchings to the set of all fractional stable matchings.     

迹稳定秩一的C~*-代数

本文引入了一类迹稳定秩一的C*-代数,证明了迹稳定秩一的C*-代数与AF-代数的张量积是迹稳定秩一的,得到了一个可分的单的有单位元的迹稳定秩一的,并且具有SP性质的C*-代数是稳定秩一的.同时,还讨论了迹稳定秩一的C*-代数的K-群的某些性质.     

Logical and algorithmic properties of stable conditional independence

The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated. We utilize recent results concerning a complete axiomatization of stable conditional independence relative to discrete probability measures to derive perfect model properties of stable conditional independence structures. We show that stable CI can be interpreted as a generalization of Markov networks and establish a connection between sets of stable CI statements and propositional formulas in conjunctive normal form. Consequently, we derive that the implication problem for stable CI is coNP-complete. Finally, we show that Boolean satisfiability (SAT) solvers can be employed to efficiently decide the implication problem and to compute concise, non-redundant representations of stable CI, even for instances involving hundreds of random variables.     

The stability of the equilibrium outcomes in the admission games induced by stable matching rules

A stable matching rule is used as the outcome function for the Admission game where colleges behave straightforwardly and the students’ strategies are given by their preferences over the colleges. We show that the college-optimal stable matching rule implements the set of stable matchings via the Nash equilibrium (NE) concept. For any other stable matching rule the strategic behavior of the students may lead to outcomes that are not stable under the true preferences. We then introduce uncertainty about the matching selected and prove that the natural solution concept is that of NE in the strong sense. A general result shows that the random stable matching rule, as well as any stable matching rule, implements the set of stable matchings via NE in the strong sense. Precise answers are given to the strategic questions raised.     

Median Stable Matching for College Admissions

We give a simple and concise proof that so-called generalized median stable matchings are well-defined for college admissions problems. Furthermore, we discuss the fairness properties of median stable matchings and conclude with two illustrative examples of college admissions markets, the lattices of stable matchings, and the corresponding generalized median stable matchings.     

线性不确定系统的稳定控制鲁棒界和多级稳定鲁棒控制

利用李雅普诺夫稳定性理论研究了线性不确定系统的稳定鲁棒控制问题,得到结果“任何一个稳定控制都是具有一定稳定鲁棒界的稳定控制”.进一步地,根据系统的不确定量的范围,设计了多级稳定鲁棒控制策略.最后给出一个例子说明设计步骤的可行性.