表面细分技术在二维声辐射和声散射中的应用

把表面细分技术应用于求解边界积分方程，既能把CAD模型直接用于边界元分析，又能精确描述复杂的边界几何形状，实现网格自动加密和形函数自动升阶，满足误差要求。把它应用于简单的二维声辐射和声散射，结果表明对提高边界元方法的计算精度是有效的。     

大型钢结构人行景观天桥的有限元分析

采用有限元方法对大型钢结构人行景观天桥进行了静力学、温度应力、动力学模态和初步的抗震能力分析,并就桥自重作用下的最大竖向位移和实际观测结果进行了比较,两者是一致的.计算结果表明:人行景观天桥在常规、温度极值改变和多遇地震荷载作用等多种工况下,现有的设计方案具有足够的强度、刚度和抗震能力.     

圆外区域求解Helmholtz方程

1引言许多科学和工程计算问题都可以归结为无界区域上的偏微分方程边值问题．而求解椭圆方程边值问题的常用技术是有限元方法,可是对于无界区域,在用有限元方法求解时,往往遇到困难．最简单的办法显然是直接略去区域的无界部分求解,但这样做或者导致过低的计算精度,或者要付出很高的计算代价．边界归化,即将求解偏微分方程边值问题转化为边界积分方程,是求解某些无界区域问题的强有力的手段．自70年代以来,有限元和     

三维守恒律有限元方法逼近光滑解的误差估计

我们对一个三维守恒律的显式有限元方法证明了H^1范数的二阶误差估计。     

差分流线扩散法的局域稳定性分析

本文讨论差分流线扩散法的局部稳定性分析，在理论上证明了该方法依旧保持着流线扩散法扰动局部影响的特性。     

标的股价服从混合过程的期权定价公式及有限元算法

本文将马尔科夫跳跃过程叠加于 Ito过程 ,形成混合过程 ,并用该过程来刻画股价走势情况。而后在标的股价服从混合过程的基础上 ,推导出了欧式看涨期权的定价公式 ,并对美式看跌期权定价给出了有限元算法。     

Assessment of thermal expansion coefficient of methylsilsesquioxane thin film

For the methylsilsesquioxane film whose optical birefringence is almost zero, it was recently reported that its vertical thermal expansion coefficient (CTE) was approximately one order of magnitude larger than the lateral CTE. Though the birefringence is not an absolute predictor of anisotropic behavior, the discrepancy in both the CTEs was so remarkable that it was essential to investigate whether the anisotropy was intrinsic property or not. If the effect of Poisson's ratio is considered in the calculation of the vertical CTE and when elastic modulus measured by surface acoustic wave spectroscopy is used in the assessment of the lateral CTE, both the CTEs are coincident with each other. Therefore, it can be concluded that the discrepancy in the CTEs can be attributed to a higher in‐plane polymer chain orientation but it can also arise from the misleadingly assumed modulus and Poisson's ratio. © 2006 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 44: 3109–3120, 2006     

水闸闸室结构三维样条边界元分析

用三维样边界元法分析水闸闸室结构。底板，闸墩和载水墙等为其子结构，交通桥，工作桥和胸墙等处理为内部支撑。地基和边载可以是任意的，只要能给定地表位移面力关系。在各种工况下，不论是设置平板门还是弧形门，是平底板是反拱底板，即使在稀疏剖分下也能给出高精度的位移场，应力场和地基反力场。     

Distributive lattices of numberings

We study into a semilattice of numberings generated by a given fixed numbering via operations of completion and taking least upper bounds. It is proved that, except for the trivial cases, this semilattice is an infinite distributive lattice every principal ideal in which is finite. The least upper and the greatest lower bounds in the semilattice are invariant under extensions in the semilattice of all numberings. Isomorphism types for the semilattices in question are in one-to-one correspondence with pairs of cardinals the first component of which is equal to the cardinality of a set of non-special elements, and the second — to the cardinality of a set of special elements, of the initial numbering. Supported by INTAS grant No. 00-429. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 83–102, January–February, 2007.