带摩擦节点约束一罚函数滑移线算法

在分析了一些动力有限元程序和有限差分程序接触碰撞算法的基础上,为解决大位移,强冲击或爆炸作用问题,提出了带摩擦节点约束－罚函数混合滑移线算法,克服计算中的数值噪声,简化计算量,提高计算速度。     

某型发射筒动力接管部位应力的有限元法分析

基于有限元理论，建立某型发射筒动力接管部位的弹性力学模型，计算不同工质内压作用下动力接管部位的应力分布情况，探讨分析动力接管部位产生局部应力集中的主要原因及分布规律。     

分段计算方法在模拟爆炸应力波传播中的运用

针对爆炸加载下岩石响应的不同特点以及动力有限元和传统地震波模拟方法的局限性,提出了一种分段计算的数值模拟方法.该方法在空间上将所模拟的区域划分为非弹性段和弹性段,非弹性段内采用动力有限元计算方法,弹性段内采用传统的地震波方法,不同段之间以节点位移为边界条件.不同算法的数值模拟结果验证了分段计算方法用于模拟爆炸荷载产生地震波的有效性和正确性.     

复合材料大展弦比亚声速机翼气动弹性研究

新一代航空结构广泛采用复合材料,对复合材料机翼的气动弹性工程化建模和分析是飞机设计的重要任务.应用气动弹性分析理论和方法,对复合材料大展弦比机翼进行了结构有限元建模、模型修正、固有振动特性计算、部件颤振工程分析.使用MSC/NASTRAN软件,在复合材料大展弦比机翼的初步静力分析模型基础上,依据结构图纸、相关试验结果反复修改得到合理的机翼结构动力学有限元模型,固有振动计算中采用动力减缩方法消除局部模态并提高计算精度,采用亚声速偶极子格网法求解非定常气动力,并对单独机翼进行了颤振计算分析,为工程设计提供了可靠的参考数据.     

落石冲击作用下环形网耗能性能数值分析

环形网作为被动柔性防护系统中主要的耗能构件,对其耗能性能的研究显得尤为重要。根据被动柔性防护系统中环形网受到的约束条件,对环形网的计算模型进行了简化处理。采用ANSYS/LS-DYNA软件对环形网进行了动力有限元分析,考察了落石尺寸、冲击速度等因素对环形网耗能性能的影响。分析结果表明：落石的下降距离、最大加速度均随落石直径的增大而减小;落石的直径越小,冲击速度越大,环形网越容易被破坏。动力有限元分析的结论可为环形网在防护工程中的应用提供参考。     

求解伪装网结构非线特征问题的迭代摄动法

尼尤伪装网的动力分析,依据离散模式建立非线性动力方程,求得初始的特征值和特征向量,然后考虑频率对位移的影响,对刚度矩阵和质量矩阵进行修正,建立动态有限元方程并采用迭代摄动法求解,得出尼龙伪装网的前三阶频率及振型,计算结果与试验值相吻合。     

基于有限元模型的机枪结构动态特性仿真

在对机枪进行结构设计时,了解机枪的固有频率和射击载荷作用下的动态响应特性对整个武器射击精度的影响十分必要。利用有限元分析软件对某机枪模型进行模态仿真分析,进而得出该武器对射击精度影响较大的部件。同时对机枪在射击载荷作用下的动力响应特性进行仿真计算,阐述了在机枪结构设计时频率匹配、射向一致的必要性,为机枪结构动力修改提供了理论依据。     

细长壳体水声辐射问题的有限元结合边界元解法

采用三角形面积元,提出了一种计算任意形状的细长壳体水声辐射问题的有限元结合边界元解法,推导了三角形面积坐标下的质量矩阵。在水动力方面,根据单层势的概念,提出了声场速度势的边界积分表示式,给出了三角形面积坐标下的附加质量矩阵和附加阻尼矩阵,从而得以建立流固耦合的有限元动力响应方程。本方法的进一步发展可用于计算具有加强肋骨的双层壳体结构的声辐射问题以及船体在随机激励下的远场声功率谱。     

瞬态响应的振型—加速度法及其在舰艇结构上的应用

本文讨论了线性结构系统瞬态动力响应的振型-加速度法,并对武器发射时激励力所产生的动力响应进行了具体分析。根据振型-加速度法已形成空间杆系结构的有限元分析程序,可用于线性激励的动力响应问题。计算结果表明振型-加速度法具有良好的收敛性。     

一种细长飞行器阵风响应计算方法

阵风响应是气动弹性动力响应问题之一。对较为细长的飞行器,结构采用有限元模型,利用准定常气动力理论计算阵风响应载荷,方法简单、实用。此种计算方法同样适用于非定常气动力理论。     

An explicit general solution in linear fractional programming

A complete analysis and explicit solution is presented for the problem of linear fractional programming with interval programming constraints whose matrix is of full row rank. The analysis proceeds by simple transformation to canonical form, exploitation of the Farkas-Minkowki lemma and the duality relationships which emerge from the Charnes-Cooper linear programming equivalent for general linear fractional programming. The formulations as well as the proofs and the transformations provided by our general linear fractional programming theory are here employed to provide a substantial simplification for this class of cases. The augmentation developing the explicit solution is presented, for clarity, in an algorithmic format.     

The fixed charge problem

A fundamental unsolved problem in the programming area is one in which various activities have fixed charges (e.g., set-up time charges) if operating at a positive level. Properties of a general solution to this type problem are discussed in this paper. Under special circumstances it is shown that a fixed charge problem can be reduced to an ordinary linear programming problem.     

Optimal selection from a random sequence with observation errors

A form of sequential decision problem is introduced in which options are presented in sequence. with no recall of rejected options (as in the secretary problem), but in which the value of each option may only he inferred from experiments. Decisions have thus to be made concerning both the acceptance and rejection of each option and the degree of experimentation. General properties of the optimal policy are derived, and an algorithm is obtained for the solution in a special case. This special case suggests a heuristic rule for more general situations. the performance of which rule has been investigated by a Monte Carlo study.     

The use of dynamic programming methodology for the solution of a class of nonlinear programming problems

This paper presents an application of a method for finding the global solution to a problem in integers with a separable objective function of a very general form. This report shows that there is a relationship between an integer problem with a separable nonlinear objective function and many constraints and a series of nonlinear problems with only a single constraint, each of which can be solved sequentially using dynamic programming. The first solution to any of the individual smaller problems that satisfies the original constraints in addition, will be the optimal solution to the multiply-constrained problem.     

正交异性矩形板结构弯曲问题的解析解法

板结构为由若干板组成的结构。用解析法求解正交异性板结构的弯曲问题,必须建立一个正交异性矩形板弯曲的横向位移函数为变量的偏微分方程的一般解。这种解能求解任意边界和任意载荷的弯曲问题。对于结构中的每块板,有些边为单独的,可由边界条件来计算,而有些边与其它板边相连接,由连续性条件来计算。由这些条件组成的方程式可以求解一般解中的全部积分常数。以顶边简支底边固定承受静水压力的板结构水池为例,进行了分析计算。     

简支扁壳弯曲问题的一般解

本文建立了四边简支的矩形扁壳弹性弯曲问题的一般解析解。以面内四边位移为零的简支矩形扁壳为例求解了匀布荷载作用下的对称变形解。     

二次规划的分解问题

二次规划在规划论研究中起着重要的作用。能够对更多更广的一类二次规划给出一个可行的算法是人们长期一直探求的工作。本文在很一般的假设下证明了一个二次规划总可以使之成为凸的超平面上进行分解,并且分解后的每个子规划也是二次的。     

A general treatment of upper unbounded and bounded hitchcock problems

This paper is designed to treat (a) the problem of the determination of the absolute minimum cost, with the associated assignments, when there is no limit, N, on the number of parcels available for shipment in a modified Hitchcock problem. This is accomplished with the use of a transformed cost matrix. C*, to which the so-called transportation paradox does not apply. The general Hitchcock solution using C* gives the cost T*, which is the absolute minimum cost of the original problem, as well as sets of assignments which are readily transformed to give the general assignments of the original problem. The sum of these latter assignments gives the value of N_u, the unbounded N for minimum cost. In addition, this paper is designed to show (b) how the method of reduced matrices may be used, (c) how a particular Hitchcock solution can be used to determine a general solution so that one solution using C* can provide the general answer, (d) how the results may be modified to apply to problems with fixed N, and hence (e) to determine the function of the decreasing T as N approaches N_u, and finally (f) to provide a treatment when the supplies at origin i and/or the demands at destination j, are bounded.     

Sensitivity analysis as a means of reducing the dimensionality of a certain class of transportation problems

Sensitivity analysis of the transportation problem is developed in a way which enables reducing the dimensionality of the associated tableau. This technique is used to reduce the dimensionality of a transportation problem whose origin requirements are relatively small at the majority of origins. A long transportation problem, for which efficient solution procedures exist, results. A second application relates to the location-allocation problem. Reducing the dimensionality of such a problem, accompanied by the partial determination of the optimal solution, should prove helpful in the quest for an analytic solution to the aforementioned problem. In the meantime, reducing dimensionality greatly decreases the effort involved in solution by trial and error. Examples of the two applications are provided.     

A heuristic routine for solving large loading problems

The loading problem involves the optimal allocation of n objects, each having a specified weight and value, to m boxes, each of specified capacity. While special cases of these problems can be solved with relative ease, the general problem having variable item weights and box sizes can become very difficult to solve. This paper presents a heuristic procedure for solving large loading problems of the more general type. The procedure uses a surrogate procedure for reducing the original problem to a simpler knapsack problem, the solution of which is then employed in searching for feasible solutions to the original problem. The procedure is easy to apply, and is capable of identifying optimal solutions if they are found.