Evolutionary structural optimisation using an additive algorithm

The evolutionary structural optimisation (ESO) method has been under continuous development since 1992. Traditionally, the method was conceived from the engineering perspective that the topology and shape of structures were naturally conservative for safety reasons and therefore contained an excess of material. To move from the conservative design to a more optimum design would therefore involve the removal of material. Thus the ESO method started from a design space much bigger than the optimum and the final topology or shape emerged by a process of removal of unwanted/inefficient/lowly stresses material. The original algorithms allowed for two forms of evolution. One was there the understressed material could be removed from anywhere in the allowable design space, and with compensation for checker-boarding this produces an optimum topology under the prescribed environments. The second form only allows removal from the surface or parts of the surface (called nibbling in the ESO lexicon); this produces a Min–Max situation where the maximum surface stress is reduced to a minimum. It has been demonstrated that the ESO process produces a surface that is an iso-stress contour thus satisfying the Min–Max optimality criterion. The present paper addresses the opposite evolutionary process whereby the structure evolves from a base which is the minimum structural form required to carry the load regardless of the magnitude of the stress levels. Material is added in the proximity of high stress to ameliorate its effect and hence the final structural form emerges. Only singly connected regions are formed in the present analysis and thus the additive ESO process is the opposite of the nibbling SO, mentioned above, that produces optimum surface shapes. The paper presents a brief background to the current state of structural optimisation research. This is followed by a discussion of the strategies for the additive ESO (AESO) algorithm and two examples are presented.     

Statistical energy analysis by finite elements for middle frequency vibration

Statistical energy analysis (SEA) is commonly used in industry to predict high-frequency vibrational response of structures. Since only local modes are used in SEA, only high-frequency responses can be predicted. This study extends SEA to the middle-frequency region by additionally using global modes. Methods using impedance matrices that can be found by NASTRAN are developed. Then the results are post processed to determine coupling loss factors.     

Uniform perfectness of the limit sets of Kleinian groups

In this note, we show, in a quantitative fashion, that the limit set of a non-elementary Kleinian group is uniformly perfect if the quotient orbifold is of Lehner type, i.e., if the space of integrable holomorphic quadratic differentials on it is continuously contained in the space of (hyperbolically) bounded ones. This result covers the known case when the group is analytically finite. As applications, we present estimates of the Hausdorff dimension of the limit set and the translation lengths in the region of discontinuity for such a Kleinian group. Several examples will also be given.

     

The ranks of primitive parabolic permutation representations of the simple groups B l (q), C l (q), and D l (q)

We determine the ranks of the permutation representations of the simple groups B _l (q), C _l (q), and D _l (q) on the cosets of the parabolic maximal subgroups.     

Sign-changing solutions on a kind of fourth-order Neumann boundary value problem

In this paper, we consider the fourth-order Neumann boundary value problem u(4)(t)−2u^″(t)+u(t)=f(t,u(t)) for all t∈[0,1] and subject to u^′(0)=u^′(1)=u^?(0)=u^?(1)=0. Using the fixed point index and the critical group, we establish the existence theorem of solutions that guarantees the problem has at least one positive solution and two sign-changing solutions under certain conditions.     

二十面体群C-G系数计算

本文简要介绍了计算Ｃ Ｇ系数的生群元矩阵方程法，给出计算二十面体群Ｃ Ｇ系数时采用的简化计算方法，并给出了Ⅰ群Ｃ Ｇ系数的计算结果。     

Adaptive finite element methods for the identification of distributed parameters in elliptic equation

In this paper, adaptive finite element method is developed for the estimation of distributed parameter in elliptic equation. Both upper and lower error bound are derived and used to improve the accuracy by appropriate mesh refinement. An efficient preconditioned project gradient algorithm is employed to solve the nonlinear least-squares problem arising in the context of parameter identification problem. The efficiency of our error estimators is demonstrated by some numerical experiments.      

Construct irreducible representations of quantum groups U q (ƒ m (K))

In this paper, we construct families of irreducible representations for a class of quantum groups U _q (ƒ _m (K)). First, we give a natural construction of irreducible weight representations for U _q (ƒ _m (K)) using methods in spectral theory developed by Rosenberg. Second, we study the Whittaker model for the center of U _q (ƒ _m (K)). As a result, the structure of Whittaker representations is determined, and all irreducible Whittaker representations are explicitly constructed. Finally, we prove that the annihilator of a Whittaker representation is centrally generated.      

Characterization of simple K 4-groups

In this paper, we prove that a group G is isomorphic to M, where M is a simple K ₄-group, if and only if the following hold: (1) |G| = |M|, (2) nse(G) = nse(M).      

Local Theory of Primitive Theta Functions

We study primitive theta functions, which were first introduced by Shintani, in a purely local setting. We investigate a metaplectic representation of U(1) acting on the space of local primitive theta functions and give its explicit irreducible decomposition. As a by-product, we give a new proof of epsilon dichotomy for (U(1),U(1)).