非连续边界元——有限元耦合方法分析

对边界元－有限元耦合方法进行了分析，采用非连续元离散边界积分方程，解决了耦合分析中自由度约束问题，给出了非连续边界元同有限元耦合的具体实施步骤，通过对二维弹性力学和流＝固耦合问题分析，表明了该文方法的有效性。     

Effects of boundary conditions and anisotropy on elastically bent silicon

In four-point bending, the rollers that are used for load application impose additional constraints on the specimen that affect the anticlastic specimen curvature and cause the specimen displacement and stress profiles to deviate from the pure beam bending case. In this study, x-ray microdiffraction is used to map both the principal and anticlastic curvatures of elastically bent, rectangular (100)-type Si strips possessing width:thickness ratios of 40:1. We quantify the amount of roller constraint and show that the region over which the anticlastic specimen curvature is affected away from the roller is approximately five times the roller diameter. Consequently, for bending tests used to determine Poisson's ratio, if a region on the sample that is free from roller effects is not chosen, measurement errors as high as 46% can occur. Furthermore, we show that, due to the anisotropy of single crystal Si, this roller-constraining effect depends on crystallographic orientation and is more pronounced when the principal bending axis lies along the <100> direction as compared with the <100> direction.     

滤池大阻力配水系统改造的理论与实践

提出了一种对传统滤池支母管穿孔大阻力配水系统改造的理论和方法，并在工程应用中得到了确认     

有限空间中经典场的正则量子化

从离散的角度研究带边界的1+1维经典标量场和Dirac场的正则量子化问题. 与以往不同的是, 这里将时间和空间两个变量同时进行变步长的离散, 应用变步长离散的变分原理, 得到离散形式的运动方程、边界条件和能量守恒的表达式. 然后, 根据Dirac理论, 将边界条件当作初级约束, 将边界条件和内在约束统一处理. 研究表明, 采用此方法, 不仅在每个离散的时空格点上能够建立起Dirac括号, 从而可以完成该模型的正则量子化;而且, 该方法还保持了离散情况下的能量守恒.     

Constraints on the fundamental topological parameters of spatial tessellations

Tessellations of that use convex polyhedral cells to fill the space can be extremely complicated, especially if they are not “facet‐to‐facet”, that is, if the facets of a cell do not necessarily coincide with the facets of that cell's neighbours. In a recent paper 15 , we have developed a theory which covers these complicated cases, at least with respect to their combinatorial topology. The theory required seven parameters, three of which suffice for facet‐to‐facet cases; the remaining four parameters are needed for the awkward adjacency concepts that arise in the general case. This current paper establishes constraints that apply to these seven parameters and so defines a permissible region within their seven‐dimensional space, a region which we discover is not bounded. Our constraints in the relatively simple facet‐to‐facet case are also new.     

Solving quadratic convex bilevel programming problems using a smoothing method

In this paper, we present a smoothing sequential quadratic programming to compute a solution of a quadratic convex bilevel programming problem. We use the Karush-Kuhn-Tucker optimality conditions of the lower level problem to obtain a nonsmooth optimization problem known to be a mathematical program with equilibrium constraints; the complementary conditions of the lower level problem are then appended to the upper level objective function with a classical penalty. These complementarity conditions are not relaxed from the constraints and they are reformulated as a system of smooth equations by mean of semismooth equations using Fisher-Burmeister functional. Then, using a quadratic sequential programming method, we solve a series of smooth, regular problems that progressively approximate the nonsmooth problem. Some preliminary computational results are reported, showing that our approach is efficient.     

A new method of moving asymptotes for large-scale linearly equality-constrained minimization

A new method of moving asymptotes for large-scale minimization subject to linear equality constraints is discussed.In this method,linear equality constraints are deleted with null space technique and the descending direction is obtained by solving a convex separable subproblem of moving asymptotes in each iteration. New rules for controlling the asymptotes parameters are designed and the global convergence of the method under some reasonable conditions is established and proved.The numerical results show that the new method may be capable of processing some large scale problems.