scholarly journals An r-h Adaptive Kinematic Approach for 3D Limit Analysis

2018 ◽  
Author(s):  
Zhenhao Shi ◽  
James Hambleton

This paper explores a pathway for increasing efficiency in numerical 3D limit analysis through r-h adaptivity, wherein nodal positions (r) and element lengths (h) are successively refined. The approach uses an iterative, nested optimization procedure involving three steps: (1) determination of velocities for a fixed mesh of rigid, translational elements (blocks) using second-order cone programming; (2) adaptation of nodal positions using non-linear optimization (r adaptivity); and (3) subdivision of elements based on the magnitude of the velocity jumps (h adaptivity). Examples show that the method can compute reasonably accurate limit loads at relatively low computational cost.

2020 ◽  
Vol 221 ◽  
pp. 111041
Author(s):  
Chadi El Boustani ◽  
Jeremy Bleyer ◽  
Mathieu Arquier ◽  
Mohammed-Khalil Ferradi ◽  
Karam Sab

2021 ◽  
Vol 35 (11) ◽  
pp. 1344-1345
Author(s):  
Anna Pietrenko-Dabrowska ◽  
Slawomir Koziel

A procedure for rapid EM-based multi-objective optimization of compact microwave components is presented. Our methodology employs a recently developed nested kriging modelling to identify the search space region containing the Pareto-optimal designs, and to construct a fast surrogate model. The latter permits determination of the initial Pareto set, further refined using a separate surrogate-assisted process. As an illustration, a three-section impedance transformer is designed for the best matching and minimum size. The set of trade-off designs is produced at the low computational cost of only a few hundred of high-fidelity EM simulations of the transformer circuit despite a large number of its geometry parameters.


Author(s):  
Samuel Hawksbee ◽  
Colin Smith ◽  
Matthew Gilbert

A new three-dimensional limit analysis formulation that uses the recently developed discontinuity layout optimization (DLO) procedure is described. With DLO, limit analysis problems are formulated purely in terms of discontinuities, which take the form of polygons when three-dimensional problems are involved. Efficient second-order cone programming techniques can be used to obtain solutions for problems involving Tresca and Mohr–Coulomb yield criteria. This allows traditional ‘upper bound’ translational collapse mechanisms to be identified automatically. A number of simple benchmark problems are considered, demonstrating that good results can be obtained even when coarse numerical discretizations are employed.


Sign in / Sign up

Export Citation Format

Share Document