Sobolev方程的一类各向异性非协调有限元逼近

在各向异性网格下,分别讨论了Sobolev方程在半离散和全离散格式下的一类非协调有限元逼近,得到了与传统有限元方法相同的误差估计和一些超逼近性质.同时在半离散格式下,通过构造具有各向异性特征的插值后处理算子得到了整体超收敛结果.     

拟线性粘弹性方程混合有限元分析

主要讨论拟线性粘弹性方程的Bernadi-Raugel混合有限元方法,给出了逼近解和精确解的收敛性分析.同时,基于积分恒等式技巧导出了超逼近性质,并进一步利用插值后处理技术得到了整体超收敛结果.     

粘弹性方程混合有限元超收敛分析

运用Bernadi-Raugel混合元对粘弹性方程进行了有限元分析,基于积分恒等式技巧得到了相应的超逼近性质,并进一步利用插值后处理技术给出了整体超收敛结果.     

各向异性网格下Wilson元的超收敛性分析

在各向异性网格下研究了二阶椭圆边值问题的Wilson有限元方法,利用单元构造的特殊性和一些新的技巧得到相应的超逼近和超收敛结果.数值算例的结果与理论分析是相吻合的.     

Stokes问题非协调混合有限元超收敛分析

本文通过引入全新的技巧,研究了Stokes问题的非协调混合有限元方法,得到了关于速度与压力的超逼近性质.进一步地通过构造一个恰当的插值后处理算子,还得到了关于速度的整体超收敛结果.     

双曲型方程的一类各向异性非协调有限元逼近

在各向异性条件下,讨论了双曲型方程的一类非协调有限元逼近,给出了半离散格式下的最优误差估计.同时通过新的技巧和精细估计得到了一些超逼近性质和超收敛结果.     

Sobolev方程的一类低阶非协调元高精度全离散格式分析

本文针对Sobolev方程提出一类低阶非协调有限元全离散格式,对时间变量具有二阶精度,对空间变量得到能量模意义下的超逼近和全局超收敛结果.最后给出的数值算例验证了理论分析的正确性.     

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

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

多项时间分数阶扩散方程各向异性线性三角元的高精度分析

在各向异性网格下,针对具有Caputo导数的二维多项时间分数阶扩散方程,给出了线性三角形元的高精度分析.首先,基于线性三角形元和改进的L1格式,建立了一个全离散逼近格式,并证明了其无条件稳定性;其次,利用有限元插值算子与Riesz投影算子之间的关系及相关的高精度结果,导出了超逼近性质.进而,借助于插值后处理技术得到了超收敛估计.值得指出的是,单独利用插值算子或Riesz投影都无法得到上述超逼近和超收敛结果.最后,利用数值算例验证了理论分析的正确性.此外,对一些常见的有限单元在该方程的数值逼近方面,作了进一步探讨.     

一个新高次Wilson元及其收敛性分析

给出一个新的高次Wilson元,证明了它的收敛性,获得了解的超逼近性质,并且利用插值后处理技术得到了有限元解的整体超收敛.在此基础上还得到了解的后验误差估计.     

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

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

沪深股市收益的相关性

以概率作为相关度量指标,分整体相关性和尾部相关性对沪深两市收益进行考察。整体相关性采用概率方法中的变化协调形成的相关性作为度量,结果表明沪深两市收益在整体上具有一定的正相关性。对于尾部相关性,先用t分布分别拟事两市收益底分布,然后用蒙特卡洛模拟确定尾部的最优门限,进而求得尾部相关性,结果显示当市场剧烈波动时两市收益具有正的相关性,且比整体相关性强,尤其在暴跌的时候,两市具有很强的正相关性。     

Milnor方图中的w-凝聚性

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

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.     

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.     

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.     

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.     

油田注水系统拓扑布局优化的混合遗传算法

以投资最小为目标函数,建立了注水系统拓扑布局优化数学模型.根据模型特点,将优化问题分为两层,分别采用遗传算法和非线性优化方法进行求解.并对遗传算法的操作过程进行了改进,调整了适应函数,改进了交叉和变异操作,结合了模拟退火算法,在操作过程中使约束条件得到满足,减少了不可行解的产生,使遗传算法的优化性能得到了提高.优化算例说明了该方法的有效性.     

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.     

���������˻�����������ͽ�ģ������Ӧ��

At present, in degradation tests, product failure is generally defined as degradation of performance below or above a specified critical value (that is called single point degradation). Although this definition is simple and practical, it is not reasonable enough and degradation failure of the product can not be completely described. In this paper, a single point degradation model is improved, and an interval degeneration model is proposed. We discuss the interval degradation model when the degradation path is liner, and obtain life distribution functions for all kinds of linear interval degradation model. Numerical integration and Monte Carlo simulation methods are used to analyze and compare the life distribution of the interval degradation model and the single point degradation model, and the relationship between the interval degradation and the single point degradation is revealed. Finally, an real data example is analysis to show that interval egradation is more reasonable and effective in practice.