Applications of the discrete element method in mechanical engineering

Compared to other fields of engineering, in mechanical engineering, the Discrete Element Method (DEM) is not yet a well known method. Nevertheless, there is a variety of simulation problems where the method has obvious advantages due to its meshless nature. For problems where several free bodies can collide and break after having been largely deformed, the DEM is the method of choice. Neighborhood search and collision detection between bodies as well as the separation of large solids into smaller particles are naturally incorporated in the method. The main DEM algorithm consists of a relatively simple loop that basically contains the three substeps contact detection, force computation and integration. However, there exists a large variety of different algorithms to choose the substeps to compose the optimal method for a given problem. In this contribution, we describe the dynamics of particle systems together with appropriate numerical integration schemes and give an overview over different types of particle interactions that can be composed to adapt the method to fit to a given simulation problem. Surface triangulations are used to model complicated, non-convex bodies in contact with particle systems. The capabilities of the method are finally demonstrated by means of application examples. Commemorative Contribution.     

Analysis of brushless three-phase synchronous generator without exciter

Recently, a demand for small-capacity generators has been increasing as electric sources in small ships and automobiles or as portable electric sources driven by engines. It is desired that the structure of small-capacity generators be simple and robust, and that the generators be highly reliable, easily maintained and controlled. This paper describes an analysis of the original brushless synchronous generator without exciter. The output voltage can be adjusted in the wide range by controlling the stator dc current. To analyze the characteristics of this generator, the finite element method is applied. It is found that the results of theoretical analysis agree well with the experimental results.     

滑移线场近似作图法的原理

给出了滑移线场近似作图法的原理、证明以及近似滑移线场的特点，为进一步利用计算机求解应力分布和变形规律，尤其是为近似滑移线的计算机绘制奠定了基础．     

在酸性介质中N-H伪酸Mannich反应机理的量子化学研究

用量子化学中的ＳＣＦ－ＭＯＡＭ１方法，全优化计算了以苯并唑酮为伪酸组分的（Ｎ－Ｈ酸）Ｍａｎｎｉｃｈ反应的反应物、过渡态和产物络合物的分子几何构型、电子结构和生成热。根据计算所得各反应的活化能，提出了该反应在酸性介质中的机理，即甲醛首先与苯并唑酮作用，其产物再与二甲胺作用生成Ｍａｎｎｉｃｈ碱，并就其缘由进行了讨论。     

迭代回归法计算T型电位滴定中试液含量

本文将迭代回归法计算Ｔ型电位滴定中，叙述了其原理及数学推导，并运算了一批实验数据，结果表明，该法准确度较高，且不需空白溶液校正。     

基于非线性规划的指数自回归模型的辨识

讨论了指数自回归模型的辨识问题，证明了该模型最小二乘估计的目标函数的非凸性，并给出了使该函数为凸的条件，最后给出了辨识该模型的算法及该算法的收敛性，并以数值例子加以说明。     

A Primal-dual Steepest-edge Method for Even-flow Harvest Scheduling Problems

The even-flow harvest scheduling problem arises when the forestry agency has evolved into a rigid non-declining even-flow policy. In this paper, we investigate model formulation and solution strategies for the even-flow harvest scheduling problem. A multiple-objective linear programming problem is formulated for even-flow harvest scheduling problems with multiple-site classes and multiple periods. The aim of this problem is to simultaneously maximize a desired harvest-volume per hectare for each period of planning horizon and the total economic return. A block diagonal constraint structure, with many sets of network sub-problems and a set of coupling constraints, is identified in this linear programming problem. A longest path method for each of network sub-problems and a primal-dual steepest-edge algorithm for the entire problem are developed. The developed algorithm has been coded in Borland C++ and implemented on a personal computer. An illustrative example is used to display the detailed procedure for the developed algorithm and a real-world case study is used to show the trade-off between desired even-flow harvest volume policy and total economic return. Results show the potential benefits of this approach.     

Spectral multidomain approximation of elliptic problems with mixed conditions on the interfaces

The multidomain technique for elliptic problems, that allows the fulfillment of the interface conditions by means of a suitable combination of the continuity of the solution and of its normal derivative, is considered. Some choices of this combination are investigated and, in particular, a choice that allows the solution of the multidomain problem through two solutions for each subproblem, is proposed. The scheme has been discretized with a collocation method and some numerical tests are reported. Moreover the method is compared with the more classical Dirichlet/Neumann one as well as with the capacitance matrix method.This research has been supported by a grant from M.P.I. (40%).     

热流法计算高温炉内辐射传热

高温炉内的辐射传热是工业生产中常遇到的问题。过去，人们在应用热流法计算辐射传热时遇到了一定的困难，使计算结果与实际有一定的偏差。本文运用文献［１］中给出的新热流数学模型，开发出由新热流方程与能量方程相耦合的计算机程序，其中的比热流参数由线加热热源情况下计算得到。用该程序计算了实验室用马弗炉内的温度场，并且用热电偶实测了炉内的一些温度值，理论计算与实测值符合很好。     

A feasibility study of a direct-mapping parallel processing method to solve linear equations in load-flow calculation

With the growing size and complexity of power systems, system analysis—such as transients calculation—takes much time. Hence, fast calculation methods are required. Although parallel processing is a hopeful method, there have been difficulties in the parallel solution of linear equations which appear in power-flow calculations by the Newton-Raphson method. This paper aims at the fast calculation of the power-flow problem by means of parallel processing. In order to improve the suitability to the parallel solution of the differential equation in transients calculation, we assume the use of a direct-mapping parallel processing machine to map directly the network of a power system onto a network of processors. Under this assumption, we propose a new parallel-processing-oriented method in which the linear equation is solved by linear iterations between nodes with Aitken acceleration. We simulate the method on three model power systems and compare this Parallel Iterative Method (PIN) with a Parallel Direct Method (PDM) which uses the banded matrix according to the number of operations required. As a result, we can expect that PIM may solve linear equations faster than PDM with m processors, although the PIM might be inferior to the PDM with m × m processors, where m denotes the half-band width of the banded matrix.