Multilevel Parallelization Concepts for Structural Optimization Using Transputer Systems

Author(s):  
Dietrich Hartmann ◽  
Karl R. Leimbach

Abstract Multilevel parallelization concepts for structural optimization provide potential to significantly improve the productivity in CAE. In particular, if large scale structural systems are to be designed with respect to a specified optimization criterion subject to a large set of constraints substantial speedup factors are achievable. This contribution is discussing generic as well as specific parallelization concepts of large structural optimization problems. Based upon these concepts transputer systems are applied as a platform for the transition from concepts to actual computer implementation.

Acta Numerica ◽  
1995 ◽  
Vol 4 ◽  
pp. 1-51 ◽  
Author(s):  
Paul T. Boggs ◽  
Jon W. Tolle

Since its popularization in the late 1970s, Sequential Quadratic Programming (SQP) has arguably become the most successful method for solving nonlinearly constrained optimization problems. As with most optimization methods, SQP is not a single algorithm, but rather a conceptual method from which numerous specific algorithms have evolved. Backed by a solid theoretical and computational foundation, both commercial and public-domain SQP algorithms have been developed and used to solve a remarkably large set of important practical problems. Recently large-scale versions have been devised and tested with promising results.


Author(s):  
Shigang Wang ◽  
Xindu Cheng ◽  
Ji Zhou ◽  
Jun Yu

Abstract In this paper, a new zigzag method for plate structures and a genetic algorithm (GA) of dynamic source seed spaces are developed and a combination of them is used to deal with large scale built-up structural optimization. The new GA combined with the zigzag method can work efficiently to cope with large scale structural optimization with displacement and stress constraints. Examples show that this GA is robust and can be used for many complex structural optimization problems.


2021 ◽  
Vol 40 (5) ◽  
pp. 1-14
Author(s):  
Michael Mara ◽  
Felix Heide ◽  
Michael Zollhöfer ◽  
Matthias Nießner ◽  
Pat Hanrahan

Large-scale optimization problems at the core of many graphics, vision, and imaging applications are often implemented by hand in tedious and error-prone processes in order to achieve high performance (in particular on GPUs), despite recent developments in libraries and DSLs. At the same time, these hand-crafted solver implementations reveal that the key for high performance is a problem-specific schedule that enables efficient usage of the underlying hardware. In this work, we incorporate this insight into Thallo, a domain-specific language for large-scale non-linear least squares optimization problems. We observe various code reorganizations performed by implementers of high-performance solvers in the literature, and then define a set of basic operations that span these scheduling choices, thereby defining a large scheduling space. Users can either specify code transformations in a scheduling language or use an autoscheduler. Thallo takes as input a compact, shader-like representation of an energy function and a (potentially auto-generated) schedule, translating the combination into high-performance GPU solvers. Since Thallo can generate solvers from a large scheduling space, it can handle a large set of large-scale non-linear and non-smooth problems with various degrees of non-locality and compute-to-memory ratios, including diverse applications such as bundle adjustment, face blendshape fitting, and spatially-varying Poisson deconvolution, as seen in Figure 1. Abstracting schedules from the optimization, we outperform state-of-the-art GPU-based optimization DSLs by an average of 16× across all applications introduced in this work, and even some published hand-written GPU solvers by 30%+.


Author(s):  
Seifedine N. Kadry ◽  
Abdelkhalak El Hami

The present paper focus on the improvement of the efficiency of structural optimization, in typical structural optimization problems there may be many locally minimum configurations. For that reason, the application of a global method, which may escape from the locally minimum points, remain essential. In this paper, a new hybrid simulated annealing algorithm for large scale global optimization problems with constraints is proposed. The authors have developed a stochastic algorithm called SAPSPSA that uses Simulated Annealing algorithm (SA). In addition, the Simultaneous Perturbation Stochastic Approximation method (SPSA) is used to refine the solution. Commonly, structural analysis problems are constrained. For the reason that SPSA method involves penalizing constraints a penalty method is used to design a new method, called Penalty SPSA (PSPSA) method. The combination of both methods (Simulated Annealing algorithm and Penalty Simultaneous Perturbation Stochastic Approximation algorithm) provides a powerful hybrid stochastic optimization method (SAPSPSA), the proposed method is applicable for any problem where the topology of the structure is not fixed. It is simple and capable of handling problems subject to any number of constraints which may not be necessarily linear. Numerical results demonstrate the applicability, accuracy and efficiency of the suggested method for structural optimization. It is found that the best results are obtained by SAPSPSA compared to the results provided by the commercial software ANSYS.


Author(s):  
Mohamed E. M. El-Sayed ◽  
T. S. Jang

Abstract This paper presents a method for solving large scale structural optimization problems using linear goal programming techniques. The method can be used as a multicriteria optimization tool since goal programming removes the difficulty of having to define an objective function and constraints. It also has the capacity of handling rank ordered design objectives or goals. The method uses finite element analysis, linear goal programming techniques and successive linearization to obtain the solution for the nonlinear goal optimization problems. The general formulation of the structural optimization problem into a nonlinear goal programming form is presented. The successive linearization method for the nonlinear goal optimization problem is discussed. To demonstrate the validity of the method, as a design tool, the solution of the minimum weight structural optimization problem with stress constraints for 10, 25 and 200 truss problems are included.


AIAA Journal ◽  
2007 ◽  
Vol 45 (11) ◽  
pp. 2729-2736
Author(s):  
F. Hüttner ◽  
M. Grosspietsch

2001 ◽  
Vol 01 (01) ◽  
pp. 105-123 ◽  
Author(s):  
MANOLIS PAPADRAKAKIS ◽  
NIKOS D. LAGAROS ◽  
VAGELIS PLEVRIS

The objective of this paper is to perform structural optimization under seismic loading. Combinatorial optimization methods and in particular algorithms based on Evolution Strategies are implemented for the solution of large-scale structural optimization problems under seismic loading. In this work the efficiency of a rigorous approach in treating dynamic loading is investigated and compared with a simplified dynamic analysis in the framework of finding the optimum design of structures with minimum weight. In this context a number of accelerograms are produced from the elastic design response spectrum of the region. These accelerograms constitute the multiple loading conditions under which the structures are optimally designed. This approach is compared with an approximate design approach based on simplifications adopted by the seismic codes. The results obtained for a characteristic test problem indicate a substantial improvement in the final design when the proposed optimization procedure is implemented.


Author(s):  
Paul Cronin ◽  
Harry Woerde ◽  
Rob Vasbinder

2019 ◽  
Author(s):  
Ryther Anderson ◽  
Achay Biong ◽  
Diego Gómez-Gualdrón

<div>Tailoring the structure and chemistry of metal-organic frameworks (MOFs) enables the manipulation of their adsorption properties to suit specific energy and environmental applications. As there are millions of possible MOFs (with tens of thousands already synthesized), molecular simulation, such as grand canonical Monte Carlo (GCMC), has frequently been used to rapidly evaluate the adsorption performance of a large set of MOFs. This allows subsequent experiments to focus only on a small subset of the most promising MOFs. In many instances, however, even molecular simulation becomes prohibitively time consuming, underscoring the need for alternative screening methods, such as machine learning, to precede molecular simulation efforts. In this study, as a proof of concept, we trained a neural network as the first example of a machine learning model capable of predicting full adsorption isotherms of different molecules not included in the training of the model. To achieve this, we trained our neural network only on alchemical species, represented only by their geometry and force field parameters, and used this neural network to predict the loadings of real adsorbates. We focused on predicting room temperature adsorption of small (one- and two-atom) molecules relevant to chemical separations. Namely, argon, krypton, xenon, methane, ethane, and nitrogen. However, we also observed surprisingly promising predictions for more complex molecules, whose properties are outside the range spanned by the alchemical adsorbates. Prediction accuracies suitable for large-scale screening were achieved using simple MOF (e.g. geometric properties and chemical moieties), and adsorbate (e.g. forcefield parameters and geometry) descriptors. Our results illustrate a new philosophy of training that opens the path towards development of machine learning models that can predict the adsorption loading of any new adsorbate at any new operating conditions in any new MOF.</div>


Sign in / Sign up

Export Citation Format

Share Document