各向异性网格下的双三次Hermite元的超逼近分析

研究了四阶重调和问题在各向异性网格下的双三次Hermite元的有限元方法.通过引入新的思路与技巧,得到了与传统的正则剖分下完全相同的收敛性和超逼近结果.并且给出了相应的数值算例,验证了理论分析的正确性.其结果说明传统有限元分析中的剖分正则性条件不是必要的,从而对进一步设计四阶问题的自适应算法和后验估计具有参考价值.     

四阶椭圆问题有限元导数恢复技术与超收敛性

1引言有限元导数恢复技术是近年来发展起来的计算有限元导数并获得导数逼近超收敛性的一种新的后处理技术.对于一维和二维区域上的二阶椭圆边值问题,文[1,2]提出了Z-Z小片插值技术,得到了有限元导数逼近在小片恢复区域上的一阶超收敛结果和剖分节点处二阶强超收敛性;文[3,4]则建立了更为实用的小片插值恢复技术并得到与文[1,2]相平行的超收敛结果;文[5]对两点边值问题构造了一种积分形式的导数恢复公式,利用这个公式可获得剖分节点处有限元导数逼近的O(h~(2k))阶超收敛估计.本文将对一维四阶椭圆     

具有自由边界的二维渗流问题

渗流的自由边界问题是工程上很受关注的问题．现有的数值分析方法需事先估计边界形态，逐次逼近．本文采用“变分不等式”的模式，结合有限元方法研究有自由边界的渗流问题，在整个结构区域内作有限元剖分，避免了传统的有限元分析中估计自由边界、反复修正计算区域的迭代过程．本文方法为简单而快速地分析渗流自由边界问题提供了一条有效的途径．     

张量积二次长方体有限元梯度最大模的超逼近

对于某种三维椭圆边值问题,本文给出了长方体剖分下张量积二次长方体有限元的第一型弱估计以及离散导数Green函数的W^1,1半范估计,利用这两个估计本文获得了张量积二次长方体有限元梯度最大模的超逼近．进而,由超逼近也可以得到这种有限元梯度最大模的超收敛．     

不可压混溶驱替问题的流线扩散──混合元数值模拟

采用标准元模拟不可压混溶流问题，当扩散系数矩阵小过剖分参数时，有限元格式仅能给出比最优精度低一阶的逼近解，格式稳定性差并伴有强烈的数值弥散现象．为了克服上述缺陷，本文对压力方程采用混合元，而对浓度方程采用流线扩散格式，在扩散矩阵为线性的假定下，证明了该格式具有较标准元更高的逼近精度（比最优阶低1／2）和更好的稳定性．     

三维二次有限元梯度最大模的超逼近

作者证明了在一致四面体剖分下三维二次有限元的第一型弱估计,并给出了三维导数离散Green函数的估计,由此得到了四面体二次元梯度最大模的超逼近．通过这个超逼近还可以获得四面体二次元梯度最大模的超收敛．     

特征值问题的Lagrange型各向异性有限元方法

在各向异性网格下首先研究了二阶椭圆特征值问题算子谱逼近的若干抽象结果.然后将这些结果具体应用于线性和双线性Lagrange型协调有限元,得到了与传统有限元网格剖分下相同的最优误差估计,从而拓宽了已有的成果.     

电报方程H~1-Galerkin非协调混合有限元分析

主要研究一类电报方程的H~1-Galerkin非协调混合有限元方法,在任意四边形网格剖分下,其逼近空间分别取为类Wilson元与双线性Q_1元,在不需要满足LBB相容性条件及不采用传统的Ritz投影的情况下,得到了与常规有限元方法相同的L~2-模和H~1-模的误差估计,进一步拓展了H~1-Galerkin混合有限元和类Wilson元的应用范围.     

数值模拟粘性不可压缩流的速度线性/压力常数(或线性)有限元

在定常粘性不可压缩流的有限元计算中,最简单的逼近方法是:速度用分片线性(或双线性)逼近;压力用分片常数逼近.但如此匹配产生的有限元空间对并不满足有限元格式的稳定性不等式,即经典的Babuska-Brezzi不等式.事实上,对于二维问题,若使用三角剖分,速度和压力的有限元空间用分片线性/常数匹配时并不满足B-B不等式,     

半导体瞬态问题的混合迎风有限体积格式

半导体器件的瞬时状态由包含3个拟线性偏微分方程所组成的方程组的初边值问题来描述.在三角剖分的基础上,对椭圆型的电子位势方程采用混合有限体积元法来逼近,对对流扩散型的电子浓度和空穴浓度方程采用迎风有限体积元方法来逼近,并进行了详细的理论分析,得到了最优阶的误差估计结果.最后,针对混合有限体积元法和迎风有限体积元法分别单独使用以及两种方法结合使用的情形给出了不同的数值算例.     

两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

Milnor方图中的w-凝聚性

整环R称为ω-凝聚整环,是指R的每个有限型理想是有限表现型的.本文证明了ω-凝聚整环是v-凝聚整环,且若(RDTF,M)是Milnor方图,则在Ⅰ型情形,R是ω-凝聚整环当且仅当D和T都是ω-整环,且T_M是赋值环;对于Ⅱ-型情形,R是ω-凝聚整环当且仅当D是域,[F:D]<∞,M是R的有限型理想,T是ω-凝聚整环,且R_M是凝聚整环.     

Polynomial-time algorithms for regular set-covering and threshold synthesis

A set-covering problem is called regular if a cover always remains a cover when any column in it is replaced by an earlier column. From the input of the problem - the coefficient matrix of the set-covering inequalities - it is possible to check in polynomial time whether the problem is regular or can be made regular by permuting the columns. If it is, then all the minimal covers are generated in polynomial time, and one of them is an optimal solution. The algorithm also yields an explicit bound for the number of minimal covers. These results can be used to check in polynomial time whether a given set-covering problem is equivalent to some knapsack problem without additional variables, or equivalently to recognize positive threshold functions in polynomial time. However, the problem of recognizing when an arbitrary Boolean function is threshold is NP-complete. It is also shown that the list of maximal non-covers is essentially the most compact input possible, even if it is known in advance that the problem is regular.     

Compromise solutions and estimation of the noninferior set

A general framework is presented in which the relation of the set of noninferior points and the set of compromise solutions is studied. It is shown that the set of compromise solutions is dense in the set of noninferior points and that each compromise solution is properly noninferior. Also, under convexity of the criteria space, a characterization of the properly noninferior points in terms of the compromise solutions is presented. In this characterization, the compromise solutions depend continuously on the weights. Use of the maximum norm is studied also. It is shown that a subset of these max-norm solutions, obtained by taking certain limits of compromise solutions, is dense and contained in the closure of the set of noninferior points.     

弱空间式Locale

空间式locale范畴SLoc是locale范畴Loc的余反射满子范畴,但对locale乘积不封闭．本文引入弱空间式locale,证明弱空间式locale范畴WSloc为范畴Loc的余反射满子范畴,且对locale秉积封闭．还证明了一个locale A是空间式的当且仅当它的枝映射localeN(A)是弱空间式的;一个空问式locale的每一个子locale都是空间式的当且仅当它的每一个子locale是弱空间式的．最后,证明了弱空间式性在定向函子下保持不变．     

递推阻尼最小二乘法的收敛性与稳定性

递推最小二乘法是参数辨识中最常用的方法,但容易产生参数爆发现象.因此对一种更稳定的辨识方法——递推阻尼最小二乘法进行了收敛特性的分析.在使用算法之前先归一化测量向量,结果表明,参数化距离收敛于一个零均值随机变量,并且在持续激励条件下,适应增益矩阵的条件数有界.参数化距离的方差有界.     

An Improved Branch & Bound Method for the Uncapacitated Competitive Location Problem

In this paper, the problem of locating new facilities in a competitive environment is considered. The problem is formulated as the firm expected profit maximization and a set of nodes is selected in a graph representing the geographical zone. Profit depends on fixed and deterministic location costs and, since customers are independent decision-makers, on the expected market share. The problem is an instance of nonlinear integer programming, because the objective function is concave and submodular. Due to this complexity a branch & bound method is developed for solving small size problems (that is, when the number of nodes is less than 50), while a heuristic is necessary for larger problems. The branch & bound is called data-correcting method, while the approximate solutions are obtained using the heuristic-concentration method.     

On the density of the minimal subspaces generated by discrete linear Hamiltonian systems

This paper focuses on the density of the minimal subspaces generated by a class of discrete linear Hamiltonian systems. It is shown that the minimal subspace is densely defined if and only if the maximal subspace is an operator; that is, it is single valued. In addition, it is shown that, if the interval on which the systems are defined is bounded from below or above, then the minimal subspace is non-densely defined in any non-trivial case.     

Chaotic synchronization with filter based on wavelet transformation

A kind of chaotic synchronization method is presented in the paper. In the transmitter, part signals are transformed by wavelet and the detail information is removed. In the receiver, the component with low frequency is reconstructed and discrete feedback is used, we show that synchronization of two identical structure chaotic systems is attained. The effect of feedback on chaotic synchronization is discussed. Using the synchronous method, the transmitting signal is transported in compressible way, system resource is saved, the component with high frequency is filtered and the effect of disturbance on synchronization is reduced. The synchronization method is illustrated by numerical simulation experiment.     

Detection of multivariate outliers with location slippage or scale inflation in left orthogonally invariant or elliptically contoured distributions

This paper is concerned with two kinds of multiple outlier problems in multivariate regression. One is a multiple location-slippage problem and the other is a multiple scale-inflation problem. A multi-decision rule is proposed. Its optimality is shown for the first problem in a class of left orthogonally invariant distributions and is also shown for the second problem in a class of elliptically contoured distributions. Thus the decision rule is robust against departures from normality. Further the null robustness of the decision statistic which the rule is based on is pointed out in each problem.