Stress-Constrained Topology Optimization Using Approximate Reanalysis with on-the-Fly Reduced Order Modeling

2021 ◽  
Author(s):  
Manyu Xiao ◽  
Jun Ma ◽  
Dongcheng Lu ◽  
Balaji Raghavan ◽  
Weihong Zhang
Keyword(s):  
Topology Optimization ◽  
Large Scale ◽  
Optimization Problems ◽  
Computational Cost ◽  
Coagulation Factor ◽  
Stress Constraints ◽  
Adjoint Equations ◽  
Stress Constraint ◽  
Reduced Order ◽  
Penalty Factor

Abstract Most of the methods used today for handling local stress constraints in topology optimization, fail to directly address the non-self-adjointness of the stress-constrained topology optimization problem. This in turn could drastically raise the computational cost for an already large-scale problem. These problems involve both the equilibrium equations resulting from finite element analysis (FEA) in each iteration, as well as the adjoint equations from the sensitivity analysis of the stress constraints. In this work, we present a paradigm for large-scale stress-constrained topology optimization problems, where we build a multi-grid approach using an on-the-fly Reduced Order Model (ROM) and the p-norm aggregation function, in which the discrete reduced-order basis functions (modes) are adaptively constructed for both the primal and dual problems. In addition to reducing the computational savings due to the ROM, we also address the computational cost of the ROM learning and updating phases. Both reduced-order bases are enriched according to the residual threshold of the corresponding linear systems, and the grid resolution is adaptively selected based on the relative error in approximating the objective function and constraint values during the iteration. The tests on 2D and 3D benchmark problems demonstrate improved performance with acceptable objective and constraint violation errors. Finally, we thoroughly investigate the influence of relevant stress constraint parameters such as the coagulation factor, stress penalty factor, and the allowable stress value.

scholarly journals Deep Learning-Based Accuracy Upgrade of Reduced Order Models in Topology Optimization

2021 ◽  
Vol 11 (24) ◽  
pp. 12005
Author(s):  
Nikos Ath. Kallioras ◽  
Alexandros N. Nordas ◽  
Nikos D. Lagaros
Keyword(s):  
Deep Learning ◽  
Topology Optimization ◽  
Large Scale ◽  
Optimization Problems ◽  
Computational Effort ◽  
Reduced Order Models ◽  
Reduced Order ◽  
Learning Techniques ◽  
Complex Models ◽  
Scale Design

Topology optimization problems pose substantial requirements in computing resources, which become prohibitive in cases of large-scale design domains discretized with fine finite element meshes. A Deep Learning-assisted Topology OPtimization (DLTOP) methodology was previously developed by the authors, which employs deep learning techniques to predict the optimized system configuration, thus substantially reducing the required computational effort of the optimization algorithm and overcoming potential bottlenecks. Building upon DLTOP, this study presents a novel Deep Learning-based Model Upgrading (DLMU) scheme. The scheme utilizes reduced order (surrogate) modeling techniques, which downscale complex models while preserving their original behavioral characteristics, thereby reducing the computational demand with limited impact on accuracy. The novelty of DLMU lies in the employment of deep learning for extrapolating the results of optimized reduced order models to an optimized fully refined model of the design domain, thus achieving a remarkable reduction of the computational demand in comparison with DLTOP and other existing techniques. The effectiveness, accuracy and versatility of the novel DLMU scheme are demonstrated via its application to a series of benchmark topology optimization problems from the literature.

scholarly journals An efficient computational framework for naval shape design and optimization problems by means of data-driven reduced order modeling techniques

2020 ◽  
Author(s):  
Nicola Demo ◽  
Giulio Ortali ◽  
Gianluca Gustin ◽  
Gianluigi Rozza ◽  
Gianpiero Lavini
Keyword(s):  
Optimization Problems ◽  
Computational Cost ◽  
Gaussian Process Regression ◽  
Dynamic Mode Decomposition ◽  
Data Driven ◽  
Free Form ◽  
Dynamic Mode ◽  
Two Phase ◽  
Initial Shape ◽  
Reduced Order

Abstract This contribution describes the implementation of a data-driven shape optimization pipeline in a naval architecture application. We adopt reduced order models in order to improve the efficiency of the overall optimization, keeping a modular and equation-free nature to target the industrial demand. We applied the above mentioned pipeline to a realistic cruise ship in order to reduce the total drag. We begin by defining the design space, generated by deforming an initial shape in a parametric way using free form deformation. The evaluation of the performance of each new hull is determined by simulating the flux via finite volume discretization of a two-phase (water and air) fluid. Since the fluid dynamics model can result very expensive—especially dealing with complex industrial geometries—we propose also a dynamic mode decomposition enhancement to reduce the computational cost of a single numerical simulation. The real-time computation is finally achieved by means of proper orthogonal decomposition with Gaussian process regression technique. Thanks to the quick approximation, a genetic optimization algorithm becomes feasible to converge towards the optimal shape.

scholarly journals A reduced order approach for probabilistic inversions of 3-D magnetotelluric data I: general formulation

2020 ◽  
Vol 223 (3) ◽  
pp. 1837-1863
Author(s):  
M C Manassero ◽  
J C Afonso ◽  
F Zyserman ◽  
S Zlotnik ◽  
I Fomin
Keyword(s):  
Large Scale ◽  
Computational Cost ◽  
Forward Problem ◽  
Parallel Structure ◽  
Data Sets ◽  
Magnetotelluric Data ◽  
Reduced Order ◽  
Mcmc Algorithms ◽  
Simulation Based ◽  
And Performance

SUMMARY Simulation-based probabilistic inversions of 3-D magnetotelluric (MT) data are arguably the best option to deal with the nonlinearity and non-uniqueness of the MT problem. However, the computational cost associated with the modelling of 3-D MT data has so far precluded the community from adopting and/or pursuing full probabilistic inversions of large MT data sets. In this contribution, we present a novel and general inversion framework, driven by Markov Chain Monte Carlo (MCMC) algorithms, which combines (i) an efficient parallel-in-parallel structure to solve the 3-D forward problem, (ii) a reduced order technique to create fast and accurate surrogate models of the forward problem and (iii) adaptive strategies for both the MCMC algorithm and the surrogate model. In particular, and contrary to traditional implementations, the adaptation of the surrogate is integrated into the MCMC inversion. This circumvents the need of costly offline stages to build the surrogate and further increases the overall efficiency of the method. We demonstrate the feasibility and performance of our approach to invert for large-scale conductivity structures with two numerical examples using different parametrizations and dimensionalities. In both cases, we report staggering gains in computational efficiency compared to traditional MCMC implementations. Our method finally removes the main bottleneck of probabilistic inversions of 3-D MT data and opens up new opportunities for both stand-alone MT inversions and multi-observable joint inversions for the physical state of the Earth’s interior.

Design of flexure hinges based on stress-constrained topology optimization

2016 ◽  
Vol 231 (24) ◽  
pp. 4635-4645 ◽  
Author(s):  
Min Liu ◽  
Xianmin Zhang ◽  
Sergej Fatikow
Keyword(s):  
Topology Optimization ◽  
Stress Concentration ◽  
Stress Constraints ◽  
Stress Constraint ◽  
Flexure Hinges ◽  
Weighted Sum Method ◽  
Stress Measure ◽  
Von Mises ◽  
Von Mises Stresses ◽  
Sharp Corners

Stress concentration is one of the disadvantages of flexure hinges. It limits the range of motion and reduces the fatigue life of mechanisms. This article designs flexure hinges by using stress-constrained topology optimization. A weighted-sum method is used for converting the multi-objective topology optimization of flexure hinges into a single-objective problem. The objective function is presented by considering the compliance factors of flexure hinges in the desired and other directions. The stress constraint and other constraint conditions are developed. An adaptive normalization of the P-norm of the effective von Mises stresses is adopted to approximate the maximum stress, and a global stress measure is used to control the stress level of flexure hinges. Several numerical examples are performed to indicate the validity of the method. The stress levels of flexure hinges without and with stress constraints are compared. In addition, the effects of mesh refinement and output spring stiffness on the topology results are investigated. The stress constraint effectively eliminates the sharp corners and reduces the stress concentration.

scholarly journals An Efficient and High-Resolution Topology Optimization Method Based on Convolutional Neural Networks

2019 ◽  
Author(s):  
Liang Xue ◽  
Jie Liu ◽  
Guilin Wen ◽  
Hongxin Wang
Keyword(s):  
Topology Optimization ◽  
High Resolution ◽  
High Efficiency ◽  
Optimization Problems ◽  
Combined Treatment ◽  
Computational Cost ◽  
Optimization Method ◽  
Element Analysis ◽  
Arbitrary Boundary ◽  
Topology Optimization Method

Topology optimization is a pioneering design method that can provide various candidates with high mechanical properties. However, the high-resolution for the optimum structures is highly desired, normally in turn leading to computationally intractable puzzle, especially for the famous Solid Isotropic Material with Penalization (SIMP) method. In this paper, an efficient and high-resolution topology optimization method is proposed based on the Super-Resolution Convolutional Neural Network (SRCNN) technique in the framework of SIMP. The SRCNN includes four processes, i.e. refining, path extraction & representation, non-linear mapping, and reconstruction. The high computational efficiency is achieved by a pooling strategy, which can balance the number of finite element analysis (FEA) and the output mesh in optimization process. To further reduce the high computational cost of 3D topology optimization problems, a combined treatment method using 2D SRCNN is built as another speeding-up strategy. A number of typical examples justify that the high-resolution topology optimization method adopting SRCNN has excellent applicability and high efficiency for 2D and 3D problems with arbitrary boundary conditions, any design domain shape, and varied load.

Topology optimization of structures subject to self-weight loading under stress constraints

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Renatha Batista dos Santos ◽  
Cinthia Gomes Lopes
Keyword(s):  
Topology Optimization ◽  
Stress Constraints ◽  
Topological Derivative ◽  
The Self ◽  
Von Mises Stress ◽  
Stress Constraint ◽  
Content Type ◽  
Derivative Method ◽  
Von Mises ◽  
Weight Loading

PurposeThe purpose of this paper is to present an approach for structural weight minimization under von Mises stress constraints and self-weight loading based on the topological derivative method. Although self-weight loading topology has been the subject of intense research, mainly compliance minimization has been addressed.Design/methodology/approachThe resulting minimization problem is solved with the help of the topological derivative method, which allows the development of efficient and robust topology optimization algorithms. Then, the derived result is used together with a level-set domain representation method to devise a topology design algorithm.FindingsNumerical examples are presented, showing the effectiveness of the proposed approach in solving a structural topology optimization problem under self-weight loading and stress constraint. When the self-weight loading is dominant, the presence of the regularizing term in the formulation is crucial for the design process.Originality/valueThe novelty of this research work lies in the use of a regularized formulation to deal with the presence of the self-weight loading combined with a penalization function to treat the von Mises stress constraint.

An Efficient Genetic Algorithm for Large Scale Built-Up Structural Optimization

1993 ◽  
Author(s):  
Shigang Wang ◽  
Xindu Cheng ◽  
Ji Zhou ◽  
Jun Yu
Keyword(s):  
Genetic Algorithm ◽  
Structural Optimization ◽  
Large Scale ◽  
Optimization Problems ◽  
Stress Constraints ◽  
Plate Structures ◽  
Dynamic Source ◽  
Complex Structural

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.

A novel approach of reliability-based topology optimization for continuum structures under interval uncertainties

2019 ◽  
Vol 25 (9) ◽  
pp. 1455-1474 ◽  
Author(s):  
Lei Wang ◽  
Haijun Xia ◽  
Yaowen Yang ◽  
Yiru Cai ◽  
Zhiping Qiu
Keyword(s):  
Topology Optimization ◽  
Reliability Index ◽  
Large Scale ◽  
Optimization Problems ◽  
Uncertainty Propagation ◽  
Content Type ◽  
Continuum Structures ◽  
Novel Approach ◽  
Design Variables ◽  
Interval Uncertainties

Purpose The purpose of this paper is to propose a novel non-probabilistic reliability-based topology optimization (NRBTO) method for continuum structural design under interval uncertainties of load and material parameters based on the technology of 3D printing or additive manufacturing. Design/methodology/approach First, the uncertainty quantification analysis is accomplished by interval Taylor extension to determine boundary rules of concerned displacement responses. Based on the interval interference theory, a novel reliability index, named as the optimization feature distance, is then introduced to construct non-probabilistic reliability constraints. To circumvent convergence difficulties in solving large-scale variable optimization problems, the gradient-based method of moving asymptotes is also used, in which the sensitivity expressions of the present reliability measurements with respect to design variables are deduced by combination of the adjoint vector scheme and interval mathematics. Findings The main findings of this paper should lie in that new non-probabilistic reliability index, i.e. the optimization feature distance which is defined and further incorporated in continuum topology optimization issues. Besides, a novel concurrent design strategy under consideration of macro-micro integration is presented by using the developed RBTO methodology. Originality/value Uncertainty propagation analysis based on the interval Taylor extension method is conducted. Novel reliability index of the optimization feature distance is defined. Expressions of the adjoint vectors between interval bounds of displacement responses and the relative density are deduced. New NRBTO method subjected to continuum structures is developed and further solved by MMA algorithms.

scholarly journals Efficient, high-resolution topology optimization method based on convolutional neural networks

2021 ◽  
Author(s):  
Liang Xue ◽  
Jie Liu ◽  
Guilin Wen ◽  
Hongxin Wang
Keyword(s):  
Topology Optimization ◽  
High Resolution ◽  
High Efficiency ◽  
Optimization Problems ◽  
Combined Treatment ◽  
Computational Cost ◽  
Treatment Method ◽  
Optimization Method ◽  
Arbitrary Boundary ◽  
Topology Optimization Method

AbstractTopology optimization is a pioneer design method that can provide various candidates with high mechanical properties. However, high resolution is desired for optimum structures, but it normally leads to a computationally intractable puzzle, especially for the solid isotropic material with penalization (SIMP) method. In this study, an efficient, high-resolution topology optimization method is developed based on the superresolution convolutional neural network (SRCNN) technique in the framework of SIMP. SRCNN involves four processes, namely, refinement, path extraction and representation, nonlinear mapping, and image reconstruction. High computational efficiency is achieved with a pooling strategy that can balance the number of finite element analyses and the output mesh in the optimization process. A combined treatment method that uses 2D SRCNN is built as another speed-up strategy to reduce the high computational cost and memory requirements for 3D topology optimization problems. Typical examples show that the high-resolution topology optimization method using SRCNN demonstrates excellent applicability and high efficiency when used for 2D and 3D problems with arbitrary boundary conditions, any design domain shape, and varied load.

Sign in / Sign up

Export Citation Format

Share Document