Comparison of theories for stability of truss structures. Part 2: Computation of critical solution of stability

Critical solution of stability is the optimum solution of cross-sectional area with stability constraint. By applying the linear Eulerian theory of stability, the critical solution with discrete variables for general truss structures is computed in this paper. Then, in order to compare the results with the ones in previous publications and to reveal the applicability of various theories of stability, the critical solutions with continuous cross-sectional areas are computed for several examples by applying various theories of stability.     

Hybrid Systems and Hybrid Computation 1st Part: Hybrid Systems

In the first part of this paper we will give a short historical survey of the field of hybrid systems, a precise definition of a hybrid system and some comments on the definition. In a second paper (Hybrid systems and hybrid computation – 2nd part: Hybrid computation) we will concentrate on a particular aspect of the theory closely related to scientific computation, that we have called hybrid computation.     

A fast and robust method for damage detection of truss structures

Use of optimization search algorithms is recognized as an efficient method for solving structural damage identification problems. Although these algorithms demonstrated their robustness to identify the location and extent of multiple damages in structural systems, they impose so much computational efforts to the damage assessing process that it reduces their attraction. In this paper by utilizing the concept of residual force vector, an efficient approach based on a Truss Element Damage Index (TEDI) is defined to assist in a fast and reliable prediction of damaged elements. Based on the proposed technique, the first step focuses on location detection of most probable damaged members. The healthy members will then be eliminated from the total list of variables. This can reduce the computational effort significantly. In the second step to identify damaged locations and severities, the Genetic Algorithm is employed to search for the optimum solution in the new search space resulted from the first step. Three test examples are considered to investigate the efficiency of proposed method for damage identification.     

Comparison of classical Winter's bracing requirements of compressed truss chord with stability analysis of 3D truss-model

Most code requirements concerning bracing are based on principles developed by Winter. The present research is devoted to study a lateral buckling of truss with linear elastic side supports. The classical Winter's model of truss chord in the case of out of the truss plane buckling is compared with nonlinear analysis of 3D truss model. Full bracing condition, that permits the truss chord to support load level corresponding to an unbraced length equal to the distance between braces is calculated. Then an approximate buckling load with less than full bracing is developed and the model is modified to account for unequal normal force distribution in compressed chord. The coefficient of buckling length related to side support distance in function of bracing stiffness is also calculated. The results are compared to design code requirements. It is shown that buckling length of truss chord with side supports considered as elastic elements is larger than assumed in design codes. (© 2009 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Computation of bounds for eigenvalues of structures with interval parameters

In this paper, the computation of eigenvalue bounds for generalized interval eigenvalue problem is considered. Two algorithms based on the properties of continuous functions are developed for evaluating upper and lower eigenvalue bounds of structures with interval parameters. The method can provide the tightest bounds within a given precision. Numerical examples illustrate the effectiveness of the proposed method.     

Splitting up value: A critical review of residual income theories

This paper deals with the notion of residual income, which may be defined as the surplus profit that residues after a capital charge (opportunity cost) has been covered. While the origins of the notion trace back to the 19th century, in-depth theoretical investigations and widespread real-life applications are relatively recent and concern an interdisciplinary field connecting management accounting, corporate finance and financial mathematics (Peasnell, 1981, 1982; Peccati, 1987, 1989, 1991; Stewart, 1991; Ohlson, 1995; Arnold and Davies, 2000; Young and O’Byrne, 2001; Martin, Petty and Rich, 2003). This paper presents both a historical outline of its birth and development and an overview of the main recent contributions regarding capital budgeting decisions, production and sales decisions, implementation of optimal portfolios, forecasts of asset prices and calculation of intrinsic values. A most recent theory, the systemic-value-added approach (also named lost-capital paradigm), provides a different definition of residual income, consistent with arbitrage theory. Enfolded in Keynes’s (1936) notion of user cost and forerun by Pressacco and Stucchi (1997), the theory has been formally introduced in Magni (2000a,b,c; 2001a,b; 2003), where its properties are thoroughly investigated as well as its relations with the standard theory; two different lost-capital metrics have been considered, for value-based management purposes, by Drukarczyk and Schueler (2000) and Young and O’Byrne (2001). This work illustrates the main properties of the two theories and their relations, and provides a minimal guide to construction of performance metrics in the two approaches.     

Computation of the normal forms for general M-DOF systems using multiple time scales. Part I: autonomous systems

This paper is concerned with the symbolic computation of the normal forms of general multiple-degree-of-freedom oscillating systems. A perturbation technique based on the method of multiple time scales, without the application of center manifold theory, is generalized to develop efficient algorithms for systematically computing normal forms up to any high order. The equivalence between the perturbation technique and Poincaré normal form theory is proved, and general solution forms are established for solving ordered perturbation equations. A number of cases are considered, including the non-resonance, general resonance, resonant case containing 1:1 primary resonance, and combination of resonance with non-resonance. “Automatic” Maple programs have been developed which can be executed by a user without knowing computer algebra and Maple. Examples are presented to show the efficiency of the perturbation technique and the convenience of symbolic computation. This paper is focused on autonomous systems, and non-autonomous systems are considered in a companion paper.     

Computation of the normal forms for general M-DOF systems using multiple time scales. Part II: non-autonomous systems

A perturbation technique has been developed in Part I to consider the computation of the normal forms for general multiple-degree-of-freedom autonomous systems. In this paper, the perturbation approach is extended to study general non-autonomous systems and is focused on systems with external forcing. With the aid of multiple time scales, efficient recursive algorithms are developed for systematically computing the normal forms. General solutions are obtained for solving ordered perturbation equations. In particular, the following cases are considered in detail: the non-resonance, internal resonances (including general resonance, resonant case involving 1:1 primary resonance, and combination of resonant case with non-resonance), and external resonances (including general resonance, and combination of internal resonance and external resonance). User-friendly Maple programs have been coded which can be “automatically” executed on various computer systems. Examples are given to demonstrate the computational efficiency of the method and the convenience of using computer algebra systems.     

Comparison of Methods for the Computation of Multivariate t Probabilities

This article compares methods for the numerical computation of multivariate t probabilities for hyper-rectangular integration regions. Methods based on acceptance-rejection, spherical-radial transformations, and separation-of-variables transformations are considered. Tests using randomly chosen problems show that the most efficient numerical methods use a transformation developed by Genz for multivariate normal probabilities. These methods allow moderately accurate multivariate t probabilities to be quickly computed for problems with as many as 20 variables. Methods for the noncentral multivariate t distribution are also described.     

Solutions with peaks for a coagulation–fragmentation equation. Part I: stability of the tails

Abstract

The aim of this two-part paper is to investigate the stability properties of a special class of solutions to a coagulation–fragmentation equation. We assume that the coagulation kernel is close to the diagonal kernel, and that the fragmentation kernel is diagonal. We construct a two-parameter family of stationary solutions concentrated in Dirac masses. We carefully study the asymptotic decay of the tails of these solutions, showing that this behavior is stable. In a companion paper, we prove that for initial data which are sufficiently concentrated, the corresponding solutions approach one of these stationary solutions for large times.     

Binding of atoms and stability of molecules in hartree and thomas-fermi type theories.

This paper is the fourth of a series devoted to the study of the stability of general molecular systems in Thomas-Fermi or Hartree type models. In the preceding part, we proved the bindingof arbitrary neutral systems for Thomas-Fermi type theories and of planar neutral systems forthe Hartree model. In this part, we manage to get rid of this restriction and thus, prove thebinding and the stability of arbitrary neutral systems for the Hartree model.     

Binding of atoms and stability of molecules in hartree and thomas-fermi type theories.

This paper is the third of a series devoted to the study of the binding of atoms, molecules and ions and of the stability of general molecular systems including molecular ions, in the context of Hartree and Thomas-Fermi type theories. For Thomas-Fermi-von WeizsÖcker or Thomas-Fermi-Dirac-von Weizsäcker models, we prove here that neutral systems can be bound and in view of the results shown in the preceding parts this yields the stability of arbitrary molecules (general neutral molecular systems). For the Hartree and Hartree-Fock models, we prove that neutral planar systems can be bound and this yields the stability of arbitrary tetraatomic molecules for instance. Various variants and extensions are also considered.     

An iterative elastic SBFE approach for collapse load analysis of inelastic structures

The paper proposes a novel numerical approach that incorporates the use of a modified elastic compensation method, within a polygon scaled boundary finite element framework, to determine the maximum load capacity of structures at plastic collapse. The distinctive feature of the proposed scheme is its effective computational ability in performing a series of successive elastic analyses by systematically adjusting elastic material properties of structures up to failure. The quadtree structural discretization within a polygon scaled boundary finite element platform enables model construction of sophisticated geometries at modest computing effort and thus the effective analysis of large-scale structures. The approach overcomes the challenges associated with stress singularity and locking phenomena under incompressibility conditions, even in the presence of high-order nonlinear yield loci. The robustness and accuracy of the proposed scheme are validated through a number of benchmarks and available practical engineering applications in 2D and 3D spaces. These illustrate the influences of some key algorithmic parameters, and the satisfaction of a lower-bound limit given by the present analysis method for a sufficiently fine discretization.     

Global optimization of truss topology with discrete bar areas—Part I: theory of relaxed problems

This two part paper considers the classical problem of finding a truss design with minimal compliance subject to a given external force and a volume bound. The design variables describe the cross-section areas of the bars. While this problem is well-studied for continuous bar areas, we treat here the case of discrete areas. This problem is of major practical relevance if the truss must be built from pre-produced bars with given areas. As a special case, we consider the design problem for a single bar area, i.e., a 0/1-problem. In contrast to heuristic methods considered in other approaches, Part I of the paper together with Part II present an algorithmic framework for the calculation of a global optimizer of the underlying large-scaled mixed integer design problem. This framework is given by a convergent branch-and-bound algorithm which is based on solving a sequence of nonconvex continuous relaxations. The main issue of the paper and of the approach lies in the fact that the relaxed nonlinear optimization problem can be formulated as a quadratic program (QP). Here the paper generalizes and extends the available theory from the literature. Although the Hessian of this QP is indefinite, it is possible to circumvent the non-convexity and to calculate global optimizers. Moreover, the QPs to be treated in the branch-and-bound search tree differ from each other just in the objective function. In Part I we give an introduction to the problem and collect all theory and related proofs for the treatment of the original problem formulation and the continuous relaxed problems. The implementation details and convergence proof of the branch-and-bound methodology and the large-scale numerical examples are presented in Part II.     

Sequential conjugate-gradient-restoration algorithm for optimal control problems. Part 1. Theory

This paper considers the problem of minimizing a functionalI which depends on the statex(t), the controlu(t), and the parameter π. Here,I is a scalar,x ann-vector,u anm-vector, and π ap-vector. At the initial point, the state is prescribed. At the final point, the state and the parameter are required to satisfyq scalar relations. Along the interval of integration, the state, the control, and the parameter are required to satisfyn scalar differential equations. First, the case of a quadratic functional subject to linear constraints is considered, and a conjugate-gradient algorithm is derived. Nominal functionsx(t),u(t), π satisfying all the differential equations and boundary conditions are assumed. Variations Δx(t), δu(t), Δπ are determined so that the value of the functional is decreased. These variations are obtained by minimizing the first-order change of the functional subject to the differential equations, the boundary conditions, and a quadratic constraint on the variations of the control and the parameter. Next, the more general case of a nonquadratic functional subject to nonlinear constraints is considered. The algorithm derived for the linear-quadratic case is employed with one modification: a restoration phase is inserted between any two successive conjugate-gradient phases. In the restoration phase, variations Δx(t), Δu(t), Δπ are determined by requiring the least-square change of the control and the parameter subject to the linearized differential equations and the linearized boundary conditions. Thus, a sequential conjugate-gradient-restoration algorithm is constructed in such a way that the differential equations and the boundary conditions are satisfied at the end of each complete conjugate-gradient-restoration cycle. Several numerical examples illustrating the theory of this paper are given in Part 2 (see Ref. 1). These examples demonstrate the feasibility as well as the rapidity of convergence of the technique developed in this paper. This research was supported by the Office of Scientific Research, Office of Aerospace Research, United States Air Force, Grant No. AF-AFOSR-72-2185. The authors are indebted to Professor A. Miele for stimulating discussions. Formerly, Graduate Studient in Aero-Astronautics, Department of Mechanical and Aerospace Engineering and Materials Science, Rice University, Houston, Texas.