Search

Nonlinear energy sinks (NES) are a promising technique to achieve vibration mitigation. Through nonlinear stiffness properties, NES are able to passively and irreversibly absorb energy. Unlike the traditional Tuned Mass Damper (TMD), NES absorb energy from a wide range of frequencies. Many studies have focused on NES behavior and dynamics, but few have addressed the optimal design of NES. Design considerations of NES are of prime importance as it has been shown that NES dynamics exhibit an acute sensitivity to uncertainties. In fact, the sensitivity is so marked that NES efficiency is near-discontinuous and can switch from a high to a low value for a small perturbation in design parameters or loading conditions. This article presents an approach for the probabilistic design of NES which accounts for random design and aleatory variables as well as response discontinuities. In order to maximize the mean efficiency, the algorithm is based on the identification of regions of the design and aleatory space corresponding to markedly different NES efficiencies. This is done through a sequence of approximated sub-problems constructed from clustering, Kriging approximations, a support vector machine, and Monte-Carlo simulations. The refinement of the surrogates is performed locally using a generalized max-min sampling scheme which accounts for the distributions of random variables. The sampling scheme also makes use of the predicted variance of the Kriging surrogates for the selection of aleatory variables values. The proposed algorithm is applied to three example problems of varying dimensionality, all including an aleatory excitation applied to the main system. The stochastic optima are compared to NES optimized deterministically.

This brief note describes the generalization of the “max-min” sample that was originally used in the update of approximated feasible or failure domains. The generalization stems from the use of the random variables joint distribution in the sampling scheme. In addition, this note proposes a numerical improvement of the max-min optimization problem through the use of the Chebychev norm.

This paper presents a methodology for constrained efficient global optimization (EGO) using support vector machines (SVMs). While the objective function is approximated using Kriging, as in the original EGO formulation, the boundary of the feasible domain is approximated explicitly as a function of the design variables using an SVM. Because SVM is a classification approach and does not involve response approximations, this approach alleviates issues due to discontinuous or binary responses. More importantly, several constraints, even correlated, can be represented using one unique SVM, thus considerably simplifying constrained problems. In order to account for constraints, this paper introduces an SVM-based "probability of feasibility" using a new Probabilistic SVM model. The proposed optimization scheme is constituted of two levels. In a first stage, a global search for the optimal solution is performed based on the "expected improvement" of the objective function and the probability of feasibility. In a second stage, the SVM boundary is locally refined using an adaptive sampling scheme. An unconstrained and a constrained formulation of the optimization problem are presented and compared. Several analytical examples are used to test the formulations. In particular, a problem with 99 constraints and an aeroelasticity problem with binary output are presented. Overall, the results indicate that the constrained formulation is more robust and efficient.

This paper presents a multifidelity approach for the construction of explicit decision boundaries (constraints or limit-state functions) using support vector machines. A lower fidelity model is used to select specific samples to construct the decision boundary corresponding to a higher fidelity model. This selection is based on two schemes. The first scheme selects samples within an envelope constructed from the lower fidelity model. The second technique is based on the detection of regions of inconsistencies between the lower and the higher fidelity decision boundaries. The approach is applied to analytical examples as well as an aeroelasticity problem for the construction of a nonlinear flutter boundary.

This article presents an improved adaptive sampling scheme for the construction of explicit decision functions (constraints or limit state functions) using Support Vector Machines (SVMs). The proposed work presents substantial modifications to an earlier version of the scheme (Basudhar and Missoum, Comput Struct 86(19–20):1904–1917, 2008). The improvements consist of a different choice of samples, a more rigorous convergence criterion, and a new technique to select the SVM kernel parameters. Of particular interest is the choice of a new sample chosen to remove the “locking” of the SVM, a phenomenon that was not understood in the previous version of the algorithm. The new scheme is demonstrated on analytical problems of up to seven dimensions.

An aneurysm is a gradual and progressive ballooning of a blood vessel due to wall degeneration. Rupture of abdominal aortic aneurysm (AAA) constitutes a significant portion of deaths in the US. In this study, we describe a technique to reconstruct AAA geometry from CT images in an inexpensive and streamlined fashion. A 3D reconstruction technique was implemented with a GUI interface in MATLAB using the active contours technique. The lumen and the thrombus of the AAA were segmented individually in two separate protocols and were then joined together into a hybrid surface. This surface was then used to obtain the aortic wall. This method can deal with very poor contrast images where the aortic wall is indistinguishable from the surrounding features. Data obtained from the segmentation of image sets were smoothed in 3D using a Support Vector Machine technique. The segmentation method presented in this paper is inexpensive and has minimal user-dependency in reconstructing AAA geometry (lumen and wall) from patient image sets. The AAA model generated using this segmentation algorithm can be used to study a variety of biomechanical issues remaining in AAA biomechanics including stress estimation, endovascular stent-graft performance, and local drug delivery studies.

This article describes a methodology to incorporate a random field in a probabilistic optimization problem. The approach is based on the extraction of the features of a random field using a reduced number of experimental observations. This is achieved by proper orthogonal decomposition. Using Lagrange interpolation, a modified random field is obtained by changing the contribution of each feature. The contributions are controlled using scalar parameters, which can be considered as random variables. This allows one to perform a random-field-based probabilistic optimization with few random variables. The methodology is demonstrated on a tube impacting a rigid wall for which a random field modifies the planarity of the tube’s wall.

This paper investigates an improved local update scheme for cellular automata (CA) applied to structural design. Local analysis and design rules are derived for equilibrium and minimum compliance design. The new update scheme consists of repeating analysis and optimality-based design rules locally. The benefits of this approach are demonstrated through a series of systematic experiments. Truss topology design problems of various sizes are used based on the Gauss–Seidel and the Jacobi iteration modes. Experiments show the robust convergence of the approach as compared to an earlier CA implementation. The approach is also extended to a plate problem.

An extension of the displacement based optimization method to frames with geometrically nonlinear response is presented. This method, when applied to small-scale trusses with linear and nonlinear response, appeared to be efficient providing the same solutions as the classical optimization method. The efficiency of the method is due to the elimination of numerous finite element analyses that are required in using the traditional optimization approach. However, as opposed to trusses, frame problems have typically a larger number of degrees of freedom than cross sectional area design variables. This leads to difficulties in the implementation of the method compared to the truss implementation. A scheme that relaxes the nodal equilibrium equations is introduced, and the method is validated using test examples. The optimal designs obtained by using the displacement based optimization and the classical approaches are compared to validate the application to frame structures. The characteristics and limitations of the optimization in the displacement space for sizing problems, based on the current formulation, are discussed.

A displacement-based optimization strategy is extended to the design of truss structures with geometric and material nonlinear responses. Unlike the traditional optimization approach that uses iterative finite element analyses to determine the structural response as the sizing variables are varied by the optimizer, the proposed method searches for an optimal solution by using the displacement degrees of freedom as design variables. Hence, the method is composed of two levels: an outer level problem where the optimal displacement field is searched using general nonlinear programming algorithms, and an inner problem where a set of optimal cross-sectional dimensions are computed for a given displacement field. For truss structures, the inner problem is a linear programming problem in terms of the sizing variables regardless of the nature of the governing equilibrium equations, which can be linear or nonlinear in displacements. The method has been applied to three test examples, which include material and geometric nonlinearities, for which it appears to be efficient and robust.