Efficient Filtering in Topology Optimization via B-Splines1

2015 ◽  
Vol 137 (3) ◽  
Author(s):  
Mingming Wang ◽  
Xiaoping Qian

This paper presents a B-spline based approach for topology optimization of three-dimensional (3D) problems where the density representation is based on B-splines. Compared with the usual density filter in topology optimization, the new B-spline based density representation approach is advantageous in both memory usage and central processing unit (CPU) time. This is achieved through the use of tensor-product form of B-splines. As such, the storage of the filtered density variables is linear with respect to the effective filter size instead of the cubic order as in the usual density filter. Numerical examples of 3D topology optimization of minimal compliance and heat conduction problems are demonstrated. We further reveal that our B-spline based density representation resolves the bottleneck challenge in multiple density per element optimization scheme where the storage of filtering weights had been prohibitively expensive.

Author(s):  
Mingming Wang ◽  
Xiaoping Qian

This paper presents a B-spline based approach for topology optimization of three-dimensional (3D) problems where the density representation is based on B-splines. Compared with the usual density filter in topology optimization, the new B-spline based density representation approach is advantageous in both memory usage and CPU time. This is achieved through the use of tensor-product form of B-splines. As such, the storage of the filtered density variables is linear with respect to the effective filter size instead of the cubic order as in the usual density filter. Numerical examples of 3D topology optimization of minimal compliance and heat conduction problems are demonstrated. We further reveal that our B-spline based density representation resolves the bottleneck challenge in multiple density per element optimization scheme where the storage of filtering weights had been prohibitively expensive.


Author(s):  
Baptiste Ristagno ◽  
Dominique Giraud ◽  
Julien Fontchastagner ◽  
Denis Netter ◽  
Noureddine Takorabet ◽  
...  

Purpose Optimization processes and movement modeling usually require a high number of simulations. The purpose of this paper is to reduce global central processing unit (CPU) time by decreasing each evaluation time. Design Methodology Approach Remeshing the geometry at each iteration is avoided in the proposed method. The idea consists in using a fixed mesh on which functions are projected to represent geometry and supply. Findings Results are very promising. CPU time is reduced for three dimensional problems by almost a factor two, keeping a low relative deviation from usual methods. CPU time saving is performed by avoiding meshing step and also by a better initialization of iterative resolution. Optimization, movement modeling and transient-state simulation are very efficient and give same results as usual finite element method. Research Limitations Implications The method is restricted to simple geometry owing to the difficulty of finding spatial mathematical function describing the geometry. Moreover, a compromise between imprecision, caused by the boundary evaluation, and time saving must be found. Originality Value The method can be applied to optimize rotating machines design. Moreover, movement modeling is performed by shifting functions corresponding to moving parts.


2010 ◽  
Vol 133 (2) ◽  
Author(s):  
Tobias Brandvik ◽  
Graham Pullan

A new three-dimensional Navier–Stokes solver for flows in turbomachines has been developed. The new solver is based on the latest version of the Denton codes but has been implemented to run on graphics processing units (GPUs) instead of the traditional central processing unit. The change in processor enables an order-of-magnitude reduction in run-time due to the higher performance of the GPU. The scaling results for a 16 node GPU cluster are also presented, showing almost linear scaling for typical turbomachinery cases. For validation purposes, a test case consisting of a three-stage turbine with complete hub and casing leakage paths is described. Good agreement is obtained with previously published experimental results. The simulation runs in less than 10 min on a cluster with four GPUs.


2014 ◽  
Vol 6 (06) ◽  
pp. 732-763 ◽  
Author(s):  
Zhiqiang Xin ◽  
Chuijie Wu

AbstractBased on the boundary vorticity-flux theory, topology optimization of the caudal fin of the three-dimensional self-propelled swimming fish is investigated by combining unsteady computational fluid dynamics with moving boundary and topology optimization algorithms in this study. The objective functional of topology optimization is the function of swimming efficiency, swimming speed and motion direction control. The optimal caudal fin, whose topology is different from that of the natural fish caudal fin, make the 3D bionic fish achieve higher swimming efficiency, faster swimming speed and better maneuverability. The boundary vorticity-flux on the body surface of the 3D fish before and after optimization reveals the mechanism of high performance swimming of the topology optimization bionic fish. The comparative analysis between the swimming performance of the 3D topology optimization bionic fish and the 3D lunate tail bionic fish is also carried out, and the wake structures of two types of bionic fish show the physical nature that the swimming performance of the 3D topology optimization bionic fish is significantly better than the 3D lunate tail bionic fish.


Author(s):  
Tobias Brandvik ◽  
Graham Pullan

A new three-dimensional Navier-Stokes solver for flows in turbomachines has been developed. The new solver is based on the latest version of the Denton codes, but has been implemented to run on Graphics Processing Units (GPUs) instead of the traditional Central Processing Unit (CPU). The change in processor enables an order-of-magnitude reduction in run-time due to the higher performance of the GPU. Scaling results for a 16 node GPU cluster are also presented, showing almost linear scaling for typical turbomachinery cases. For validation purposes, a test case consisting of a three-stage turbine with complete hub and casing leakage paths is described. Good agreement is obtained with previously published experimental results. The simulation runs in less than 10 minutes on a cluster with four GPUs.


Author(s):  
Yu Gu ◽  
Xiaoping Qian

In this paper, we present an extension of the B-spline based density representation to a robust formulation of topology optimization. In our B-spline based topology optimization approach, we use separate representations for material density distribution and analysis. B-splines are used as a representation of density and the usual finite elements are used for analysis. The density undergoes a Heaviside projection to reduce the grayness in the optimized structures. To ensure minimal length control so the resulting designs are robust with respect to manufacturing imprecision, we adopt a three-structure formulation during the optimization. That is, dilated, intermediate and eroded designs are used in the optimization formulation. We give an analytical description of minimal length of features in optimized designs. Numerical examples have been implemented on three common topology optimization problems: minimal compliance, heat conduction and compliant mechanism. They demonstrate that the proposed approach is effective in generating designs with crisp black/white transition and is accurate in minimal length control.


2021 ◽  
Vol 7 (2) ◽  
pp. 35
Author(s):  
Boris Shirokikh ◽  
Alexey Shevtsov ◽  
Alexandra Dalechina ◽  
Egor Krivov ◽  
Valery Kostjuchenko ◽  
...  

The prevailing approach for three-dimensional (3D) medical image segmentation is to use convolutional networks. Recently, deep learning methods have achieved human-level performance in several important applied problems, such as volumetry for lung-cancer diagnosis or delineation for radiation therapy planning. However, state-of-the-art architectures, such as U-Net and DeepMedic, are computationally heavy and require workstations accelerated with graphics processing units for fast inference. However, scarce research has been conducted concerning enabling fast central processing unit computations for such networks. Our paper fills this gap. We propose a new segmentation method with a human-like technique to segment a 3D study. First, we analyze the image at a small scale to identify areas of interest and then process only relevant feature-map patches. Our method not only reduces the inference time from 10 min to 15 s but also preserves state-of-the-art segmentation quality, as we illustrate in the set of experiments with two large datasets.


Polymers ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 694
Author(s):  
Wondu Lee ◽  
Jooheon Kim

In this study, a new fabrication technique for three-dimensional (3D) filler networks was employed for the first time to prepare thermally conductive composites. A silver nanowire (AgNW)– aluminum nitride (AlN) (AA) filler was produced by a polyol method and hot-pressed in mold to connect the adjacent fillers by sintering AgNWs on the AlN surface. The sintered AA filler formed a 3D network, which was subsequently impregnated with epoxy (EP) resin. The fabricated EP/AA 3D network composite exhibited a perpendicular direction thermal conductivity of 4.49 W m−1 K−1 at a filler content of 400 mg (49.86 vol.%) representing an enhancement of 1973% with respect to the thermal conductivity of neat EP (0.22 W m−1 K−1). Moreover, the EP/AA decreased the operating temperature of the central processing unit (CPU) from 86.2 to 64.6 °C as a thermal interface material (TIM). The thermal stability was enhanced by 27.28% (99 °C) and the composites showed insulating after EP infiltration owing to the good insulation properties of AlN and EP. Therefore, these fascinating thermal and insulating performances have a great potential for next generation heat management application.


2013 ◽  
Vol 275-277 ◽  
pp. 2589-2594 ◽  
Author(s):  
Yu Xuan Zhang ◽  
Song Ping Wu

Using compute Unified device architecture (CUDA), a traditional computational fluid dynamics (CFD) program is paralleled and optimized based on graphic processing unit (GPU). The calculation process is divided into two parts as serial and parallel. Their main characteristics are analyzed and different optimization schemes are given. CPU (central processing unit) and GPU work respectively as flow control and high-speed parallel computation. Bandwidth between devices is applied effectively. Data transfer between devices is moderately improved to simplify algorithm. Finally, the method is verified by simulating a three-dimensional isotropic homogeneous turbulence flow field. The calculation uses large eddy simulation (LES) method with secondary filter and solves the three-dimensional N-S equations. The maximum grid number achieves 8,000,000 and takes 33 seconds each step. All calculations are using ordinary single desktop computer, optimized acceleration ratio can reach 9.


Author(s):  
Ashraf M. Hamed ◽  
Paramsothy Jayakumar ◽  
Michael D. Letherwood ◽  
David J. Gorsich ◽  
Antonio M. Recuero ◽  
...  

This paper discusses fundamental issues related to the integration of computer aided design and analysis (I-CAD-A) by introducing a new class of ideal compliant joints that account for the distributed inertia and elasticity. The absolute nodal coordinate formulation (ANCF) degrees of freedom are used in order to capture modes of deformation that cannot be captured using existing formulations. The ideal compliant joints developed can be formulated, for the most part, using linear algebraic equations, allowing for the elimination of the dependent variables at a preprocessing stage, thereby significantly reducing the problem dimension and array storage needed. Furthermore, the constraint equations are automatically satisfied at the position, velocity, and acceleration levels. When using the proposed approach to model large scale chain systems, differences in computational efficiency between the augmented formulation and the recursive methods are eliminated, and the central processing unit (CPU) times resulting from the use of the two formulations become similar regardless of the complexity of the system. The elimination of the joint constraint equations and the associated dependent variables also contribute to the solution of a fundamental singularity problem encountered in the analysis of closed loop chains and mechanisms by eliminating the need to repeatedly change the chain or mechanism independent coordinates. It is shown that the concept of the knot multiplicity used in computational geometry methods, such as B-spline and NURBS (nonuniform rational B-spline), to control the degree of continuity at the breakpoints is not suited for the formulation of many ideal compliant joints. As explained in this paper, this issue is closely related to the inability of B-spline and NURBS to model structural discontinuities. Another contribution of this paper is demonstrating that large deformation ANCF finite elements can be effective, in some multibody systems (MBS) applications, in solving small deformation problems. This is demonstrated using a heavily constrained tracked vehicle with flexible-link chains. Without using the proposed approach, modeling such a complex system with flexible links can be very challenging. The analysis presented in this paper also demonstrates that adding significant model details does not necessarily imply increasing the complexity of the MBS algorithm.


Sign in / Sign up

Export Citation Format

Share Document