基于网格变动的油水驱动半正定问题迎风混合元方法

在网格随时间变动的有限元空间上研究了不可压缩的两相渗流驱动问题.分别对饱和度方程扩散矩阵正定和半正定的情形,提出了基于网格变动的迎风混合元方法混合元逼进压力方程,饱和度方程的对流项采用迎风格式来处理,扩散项则采用推广的混合元来逼进.在网格任意变动的情形下得到几乎最优的误差估计;对正定问题的格式进行改进,即在两个网格之间投影变化时采取近似解的线性构造,可以得到与固定网格时相同的最优收敛阶.     

带有超线性项的混合单调算子的不动点定理及其应用

该文讨论了带有齐次超线性项μC和线性项D的混合单调算子A=B+μC+D的不动点的存在性.在不假设耦合下上解存在的条件下,得到了算子A的一个不动点定理,并且将所获结果应用到常微分方程两点边值问题、积分方程和椭圆型方程边值问题中,得到了新的结论.因而本质上推广和改进了已有的混合单调算子和相应的增算子的不动点定理.     

考虑不同融资金额需求的授权再制造融资策略研究

考虑授权再制造企业融资金额无法满足资金短缺需求的情况,构建资金约束下再制造企业的决策模型,研究初始资金及融资策略对再制造企业生产决策的影响。研究表明:资金约束下初始资金成为影响再制造企业生产决策的关键,同时授权费的增加会增大资金压力,限制其利润的增长;不论融资金额是否能满足资金短缺需求,再制造企业融资策略的选择都受初始资金限制,当其融资偏好为风险厌恶型时,可选择混合融资策略;在一定条件下再制造企业选择股权融资可提升再制造产品的社会效益。     

具有弱对称应力的线弹性方程的稳定化格式

利用稳定化方法讨论拉格朗日乘子法得到的具有弱对称应力的线弹性问题. 用线性元和分片常数分别逼近变分问题的应力和位移. 并通过添加稳定项$G_1(\cdot,\cdot)$, $G_2(\cdot,\cdot)$和$G_3(\cdot,\cdot)$ 使相应混合离散变分问题满足弱BB条件. 接着详细研究了变分问题的解与稳定混合有限元解之间的误差估计,最后用两个数值算例验证理论分析的有效性.     

Stereoelectronic structure of MCl4-benzoyl chloride (M=Si,Ge, Sn) systems resulting from ab initio calculations and NQR 35Cl

Results of quantum-chemical calculations of MCl₄–C₆H₅COCl (M=Si, Ge, Sn) systems of 1?:?1 composition using RHF/3-21?G* and MP2/3-21?G* levels as well as those of 1?:?2 composition using the RHF/3-21?G* level have been represented. MCl₄?←?C₆H₅COCl complexes of 1?:?1 composition are energetically more advantageous. They are formed in solid state provided that the M···O distance in individual systems is considerably less than the sum of van der Waals radii of M and O and their total energies are appreciably less than the sum of total energies of components. These conditions are realized only for M=Sn. In systems of 1?:?2 compositions, calculated M···O distances are practically equal to the sum of covalent radii of M and O. Nonetheless, complexes with such composition are not formed in solid state. Total energy of the system which is lower than the sum of its components’ energies is not an indispensable condition for complex formation. The ³⁵Cl nuclear quadrupole resonance (NQR) frequencies and asymmetry parameters of the electric field gradient at the ³⁵Cl nuclei have been evaluated using the results of ab initio calculations.     

A branch-and-cut method for 0-1 mixed convex programming

We generalize the disjunctive approach of Balas, Ceria, and Cornuéjols [2] and devevlop a branch-and-cut method for solving 0-1 convex programming problems. We show that cuts can be generated by solving a single convex program. We show how to construct regions similar to those of Sherali and Adams [20] and Lovász and Schrijver [12] for the convex case. Finally, we give some preliminary computational results for our method. Received January 16, 1996 / Revised version received April 23, 1999?Published online June 28, 1999