Drilling couples and refined constitutive equations in the resultant geometrically non-linear theory of elastic shells

It is well known that distribution of displacements through the shell thickness is non-linear, in general. We introduce a modified polar decomposition of shell deformation gradient and a vector of deviation from the linear displacement distribution. When strains are assumed to be small, this allows one to propose an explicit definition of the drilling couples which is proportional to tangential components of the deviation vector. The consistent second approximation to the complementary energy density of the geometrically non-linear theory of isotropic elastic shells is constructed. From differentiation of the density we obtain the consistently refined constitutive equations for 2D surface stretch and bending measures. These equations are then inverted for 2D stress resultants and stress couples. The second-order terms in these constitutive equations take consistent account of influence of undeformed midsurface curvatures. The drilling couples are explicitly expressed by the stress couples, undeformed midsurface curvatures, and amplitudes of quadratic part of displacement distribution through the thickness. The drilling couples are shown to be much smaller than the stress couples, and their influence on the stress and strain state of the shell is negligible. However, such very small drilling couples have to be admitted in non-linear analyses of irregular multi-shell structures, e.g. shells with branches, intersections, or technological junctions. In such shell problems six 2D couple resultants are required to preserve the structure of the resultant shell theory at the junctions during entire deformation process.     

Computer modelling and geometric construction for four-point synthesis of 4R spherical linkages

In this paper, computer modelling and geometric construction of Burmester curve for synthesis of spherical mechanisms is presented. Rigid shell guidance in four specified positions on a sphere is performed by a 4R spherical linkage. The synthesis of such a linkage requires obtaining the associated Burmester curves on the reference sphere. Based on the Burmester theory and beside the computational and modelling abilities of the symbolic mathematical software namely Maple, an accurate as well as fast procedure for geometric construction of Burmester curve is developed. In the first part, the concepts of orientation and position on the sphere, pole of the motion and the related parameters are extended for modelling by the Maple. In the second part, the concepts of complementary axis quadrilateral and its imaginary motion, the center and circle axis cones and Burmester curve are derived. In the final part, using the prepared procedure and through a numerical example, a 4R spherical linkage for guiding an antenna to meet four specified postures in a three-dimensional working space is synthesized.     

A multi-dimensional approach to the construction and enumeration of Golay complementary sequences

We argue that a Golay complementary sequence is naturally viewed as a projection of a multi-dimensional Golay array. We present a three-stage process for constructing and enumerating Golay array and sequence pairs:

1.

construct suitable Golay array pairs from lower-dimensional Golay array pairs;

2.

apply transformations to these Golay array pairs to generate a larger set of Golay array pairs; and

3.

take projections of the resulting Golay array pairs to lower dimensions.

This process greatly simplifies previous approaches, by separating the construction of Golay arrays from the enumeration of all possible projections of these arrays to lower dimensions.We use this process to construct and enumerate all h²-phase Golay sequences of length m² obtainable under any known method, including all 4-phase Golay sequences obtainable from the length 16 examples given in 2005 by Li and Chu [Y. Li, W.B. Chu, More Golay sequences, IEEE Trans. Inform. Theory 51 (2005) 1141-1145].     

Some generalizations of the criss-cross method for quadratic programming

Three generalizations of the criss-cross method for quadratic programming are presented here. Tucker’s, Cottle’s and Dantzig’s principal pivoting methods are specialized as diagonal and exchange pivots for the linear complementarity problem obtained from a convex quadratic program

A finite criss-cross method, based on least-index resolution, is constructed for solving the LCP. In proving finiteness, orthogonality properties of pivot tableaus and positive semidefiniteness of quadratic matrices are used

In the last section some special cases and two further variants of the quadratic criss-cross method are discussed. If the matrix of the LCP has full rank, then a surprisingly simple algorithm follows, which coincides with Murty’s ‘Bard type schema’ in the P matrix case     

Generalizing pairs of complementary sequences and a construction of combinatorial structures

Pairs of complementary sequences such as Golay pairs have zero sum autocorrelation at all non-trivial phases. Several generalizations are known where conditions on either the autocorrelation function, or the entries of the sequences are altered. We aim to unify most of these ideas by introducing autocorrelation functions that apply to any sequences with entries in a set equipped with a ring-like structure which is closed under multiplication and contains multiplicative inverses. Depending on the elements of the chosen set, the resulting complementary pairs may be used to construct a variety of combinatorial structures such as Hadamard matrices, complex generalized weighing matrices, and signed group weighing matrices. We may also construct quasi-cyclic and quasi-constacyclic linear codes which over finite fields of order less than 5 are also Hermitian self-orthogonal. As the literature on binary and ternary Golay sequences is already quite deep, one intention of this paper is to survey and assimilate work on more general pairs of complementary sequences and related constructions of combinatorial objects, and to combine the ideas into a single theoretical framework.     

The Complex Interior-Boundary method for linear and nonlinear programming with linear constraints

In this paper we develop the Complex method; an algorithm for solving linear programming (LP) problems with interior search directions. The Complex Interior-Boundary method (as the name suggests) moves in the interior of the feasible region from one boundary point to another of the feasible region bypassing several extreme points at a time. These directions of movement are guaranteed to improve the objective function. As a result, the Complex method aims to reach the optimal point faster than the Simplex method on large LP programs. The method also extends to nonlinear programming (NLP) with linear constraints as compared to the generalized-reduced gradient.The Complex method is based on a pivoting operation which is computationally efficient operation compared to some interior-point methods. In addition, our algorithm offers more flexibility in choosing the search direction than other pivoting methods (such as reduced gradient methods). The interior direction of movement aims at reducing the number of iterations and running time to obtain the optimal solution of the LP problem compared to the Simplex method. Furthermore, this method is advantageous to Simplex and other convex programs in regard to starting at a Basic Feasible Solution (BFS); i.e. the method has the ability to start at any given feasible solution.Preliminary testing shows that the reduction in the computational effort is promising compared to the Simplex method.     

Bounds for the generalized Marcum Q-function

In this paper we consider the generalized Marcum Q-function of order ν > 0 real, defined by

     

A note on Schrage's generalised variable upper bounds

An improved procedure for implementing pivoting, based upon ideas from generalised upper bounds, is suggested for Schrage's generalised variable upper bounds.     

Comparative computer results of a new complementary pivot algorithm for solving equality and inequality constrained optimization problems

This paper reports the development of a new algorithm for solving the general constrained optimization problem (that of optimizing an objective function subject to both equality and inequality constraints). The approach is based on the complementary pivoting algorithms which have been developed to solve certain classes of fixed point problems. The specific approach is to use the equality constraints to solve for some variables in terms of the remaining ones thus enabling one to eliminate the equality constraints altogether. The result, under certain circumstances, is an optimization problem which may be transformed into a fixed point problem in such a way that a complementary pivoting code may be used to search for a solution.Seventeen test problems have been solved by this method and the results are compared against those obtained from GRG (Generalized Reduced Gradient method). The results of the tests indicate that the fixed point approach is robust (all 17 problems were solved by this method where as GRG solved 16). As to the computer times, the fixed point code proved to be as fast or faster than GRG on the lower dimensional problems; however, as the dimension increased, the trend reversed and on a 40 dimensional problem GRG was approximately 11 times faster. The conclusion from these tests is that when the dimension of the original problem can be reduced sufficiently by the equality constraints, the fixed point approach appears to be more effective than GRG.     

Side chain-directed complementary cis-coordination of two pyridines on Pd(II): Selective multicomponent assembly of square-, rectangular-, and trigonal prism-shaped molecules

This paper describes a new strategy to regulate multicomponent assembly from two kinds of pyridine-based ligands and cis-protected Pd(II) ions. The introduction of sterically hindered substituents to only one of the two ligands directs the complementary cis-coordination of the two lingads on the Pd(II) center, leading to the selective multicomponent assembly of two- and three-dimensional polynuclear Pd(II) complexes (e.g., square-, rectangular-, and trigonal prism-shaped molecules).