二维热传导型半导体器件的特征有限体积元方法和H1模分析

将特征线方法与有限体积元方法相结合,采用分片线性函数和分片常数函数分别作为有限体积元方法的试探函数和检验函数空间,构造了热传导型半导体器件的全离散特征有限体积元格式.并进行收敛性分析,在一般的条件下得到了最优阶H1模误差估计结果.     

热传导型半导体器件的二次元特征有限体积元方法及分析：H^1模估计

该文构造了热传导型半导体器件的全离散特征有限体积元格式,将特征线方法与有限体积元方法相结合,采用Lagrange型分片二次多项式空间和分片常数函数空间分别作为试探函数和检验函数空间,并进行误差分析,得到了最优阶 H1模误差估计结果.     

二维热传导型半导体瞬态问题的二次元特征有限体积元方法

将特征线方法与有限体积元方法相结合,采用Lagrange型分片二次多项式空间和分片常数函数空间分别作为试探函数和检验函数空间构造了二维热传导型半导体瞬态问题的全离散二次元特征有限体积元格式,并进行误差分析,得到了次优阶L^2模误差估计结果．     

抛物方程的一种广义差分法(有限体积法)

广义差分法自1982年被提出,至今已获得很大发展（见[1]或[10],这种方法在国际上被称为有限体积（元）法（见[8],[9]）,它的主要优点是保持物理量的局部守恒性.文[3],[5]分别将三角形网格上的椭圆型方程的广义差分法（有限体积法）（见[2],[4]）推广到抛物型方程.我们知道三角形网格与四边形网格是两种基本的分割空间区域的方法,实践上使用哪一种网格,要根据空间区域的几何形状而定.文[7],[6]讨论了一般四边形网上椭圆型方程的广义差分法.本文以抛物方程为模型,取试探函数空间为一般四边形剖分上的等参双线性元,检验函数空间为对偶剖分上的分片常数,导出了一种新的有效的广义差分算法（有限体积算法）,证明了半离散与全离散格式的最佳H1误差估计.遇到的主要困难是双线性形式a（uh,Πh＊uh）     

热传导型半导体器件的二次元特征有限体积元方法及分析:H1模估计

该文构造了热传导型半导体器件的全离散特征有限体积元格式,将特征线方法与有限体积元方法相结合, 采用Lagrange型分片二次多项式空间和分片常数函数空间分别作为试探函数和检验函数空间,并进行误差分析,得到了最优阶H¹模误差估计结果.     

Darcy-Stokes问题的统一稳定化有限体积法分析

本文对Darcy-Stokes问题提出了一种统一的稳定化有限体积法.在离散问题中,采用两种剖分,一种为三角形剖分,一种为其对偶四边形剖分.速度及压力分别采用非协调线性元及分片常数元来做逼近.经证明,文中的统一格式,具有稳定性及最优误差估计.最后用数值算例验证了本文的理论结果.     

解Stokes方程的一种无散稳定二次有限体积法格式

在三角形网格上构造了一种求解Stokes方程的Lagrange二次有限体积法格式.取连续的二次有限元空间与间断的线性有限元空间分别作为Stokes方程的速度项与压力项的试探空间,从而保证了离散方程的速度解在宏元三角形单元上满足局部质量守恒性,且有限元空间对自然满足所谓的inf-sup条件.采用特殊的有限体积法映射与对偶剖分,求解Stokes方程的Lagrange二次有限体积法格式等价于相对应的有限元法格式,因此确保了有限体积法格式的无条件(无需约束三角形网格的几何形状)稳定性和关于速度项的最优阶H1范数的误差估计.最后,数值实验展示了理论结果的正确性以及有限体积法的数值模拟在计算流体力学中的有效性.     

有限体积法定价美式期权

讨论美式期权定价的有限体积法.采用投影超松弛迭代法求解隐式欧拉和CrankNicolson有限体积格式离散Black-Scholes偏微分方程得到的线性互补问题.数值实验结果表明,两种有限体积格式都是有效的,而Crank-Nicolson格式的数值效果要优于隐式欧拉格式.     

非线性抛物型方程组的二次有限体积元方法及其误差估计

讨论基于三角形网格的二维非线性抛物型方程组的有限体积元方法,其中试探函数空间为二次Lagrange元,检验函数空间为分片常数函数空间,对问题的全离散格式证明了最优的能量模误差估计。最后给出一个相关数值算例以验证格式的有效性。     

二维土壤溶质输运方程的有限体积元格式

本文导出二维的土壤溶质输运方程的有限体积元格式, 并分析其误差.通过数值例子说明, 有限体积元格式比有限元格式稳定.     

两类带有确定潜伏期的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.     

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

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