时变线性系统的稳定性

本文把文[1]、[2]的变换技巧推广到变系数线性系统(i=1,…,n),用函数方法,研究了n=2、3时零解的稳定性,得到了零解稳定的若干判据.有关系数a_(ij)(t)不必都限制为有界.     

Stability and convergence of modified Ishikawa iterative sequences with errors in Banach spaces

Summary Some stability and convergence theorems of the modified Ishikawa iterative sequences with errors for asymptotically nonexpansive mapping in the intermediate sense and asymptotically pseudo contractive and uniformly Lipschitzian mappings in Banach spaces are obtained.     

置换环上的稳定矩阵

本文证明了置换环上的正则稳定矩阵是幂等矩阵和可逆矩阵的积,进一步证明了置换环上的正则稳定矩阵可以对角化。     

基于三维矩阵重构争论有向图的域间路由振荡检测算法

边界网关协议(Border G atew ay P rotoco l,BGP)是当前In ternet域间路由协议的事实标准,基于策略的路由选择过程使它不再是严格意义上的距离矢量协议,也不再具有距离矢量协议的收敛性.V aradhan指出,自治系统各自为政的策略配置方式会导致全局策略冲突,引起永久性的路由振荡.针对该问题,G riffin利用稳定路径问题(S tab le Path P rob lem,SPP)模型形式化的抽象出BGP协议行为,并以此为基础提出了一种分布式的策略冲突检测算法,尽管该算法完全避免了传统方法的缺陷,但仍然存在泄漏策略信息和对BGP协议改动太大以及浪费网络资源的问题.本文提出了一种基于安全多方计算的检测路由策略冲突的方法,用于在怀疑BGP路由发生振荡时,动态的检测系统中是否存在策略冲突.该方法采纳了G riffin的理论基础,同时由于巧妙的运用了安全多方计算协议,可以完全解决G riffin算法的问题,具有很好的实用性.     

广义生灭最小Q过程的可配称性

研究全稳定广义生灭最小Q过程的可配称性,获得广义生灭最小Q过程是可配称的充分必要条件,以及最小Q过程是唯一的可配称Q过程的充分必要条件．     

对流扩散方程带罚函数项的有限体积格式及其分析

1引言 有限体积方法[l]一l’]作为守恒型的离散技术，被广泛应用于工程计算领域.文【2，3} 基于分片常数和分片常向量函数空间，对二维驻定对流扩散方程提出了一类非协调混合 有限体积(Covolume)格式，证明了格式具有。(hl/2)收敛精度.但该格式要求对偶剖分 比较规则，即采用重     

球面稳定同伦中的复合元素α1β1γs的非平凡性

本文证明:当p≥7任意奇素数,3≤s相似文献   

The measure of a translated ball in uniformly convex spaces

Let (E, ¦·¦) be a uniformly convex Banach space with the modulus of uniform convexity of power type. Let be the convolution of the distribution of a random series inE with independent one-dimensional components and an arbitrary probability measure onE. Under some assumptions about the components and the smoothness of the norm we show that there exists a constant such that |{·<t}–{·+r<t}|r ^q , whereq depends on the properties of the norm. We specify it in the case ofL spaces, >1.     

An extended continuous Newton method

This paper describes a numerical realization of an extended continuous Newton method defined by Diener. It traces a connected set of locally one-dimensional trajectories which contains all critical points of a smooth functionf: ⁿ . The results show that the method is effectively applicable.The authors would like to thank L. C. W. Dixon for pointing out some errors in the original version of this paper and for several suggestions of improvements.     

On consistency of bounding operations in deterministic global optimization

This technical comment refers to the discussion of strong consistency of several bounding procedures in Lemma 2.1 and Proposition 2.1 of Ref. 1. A necessary clarification is given of the notion of convergence _q in Lemma 2.1, and a derivation of Proposition 2.1 is presented that includes a new and simple consistency proof of the classical bounding by convex envelopes used in many branch-and-bound procedures.