利用无网格法进行几何非线性热固耦合柔性机构拓扑优化设计

将无网格伽辽金法引入到拓扑优化中,利用其进行了几何非线性热固耦合柔性机构的优化设计研究.利用无网格法离散和求解了热固耦合场的控制方程.基于SIMP模型和无网格法,建立了柔性机构的优化模型,利用MMA方法求解.研究了基于无网格法的伴随敏度分析方法,并提出了解决拓扑结构出现不连续散乱点同题的敏度过滤方法.求解经典算例,表明本文方法的正确性和有效性.     

力电耦合扩展无网格伽辽金法在压电柔性臂断裂分析中的研究

为提高含裂纹压电柔性臂在断裂分析中的求解精度,基于压电材料断裂力学理论,建立了压电柔性臂的力学分析模型。将描述裂纹尖端奇异性的位移场函数和电场函数引入到传统无网格伽辽金法中,提出了力电耦合扩展无网格伽辽金法。与传统无网格伽辽金法相比,本方法只需要较小的影响域来描述裂尖奇异场,并且节点影响域不会被裂纹线影响,不要可视准则和衍射准则,提高了计算精度。由虚拟裂纹闭合法推导了压电材料能量释放率,讨论了不同高斯点密度对强计算结果的影响。与解析解、有限元法的计算结果进行了比较,在高斯点个数为6×6时,扩展无网格伽辽金法的计算误差为1.88%,明显好于有限元的计算误差2.5%。数值算例结果表明本方法具有较高的计算精度。     

连续体结构的拓扑优化设计

对基于有限元数值求解技术的连续体结构的拓扑优化设计技术进行了综述. 利用密度-刚度插值格式和优化准则方法, 以结构的柔度最小化作为优化的目标函数, 论述并建立线弹性结构的静力学拓扑优化设计的数学模型和设计变量显示的迭代格式; 基于数学规划方法中的一种凸规划方法----移动渐近线方法和密度方法, 以结构的频率最大化作为优化的目标函数, 论述并建立了特征值问题拓扑优化设计的数学模型和设计变量隐式的更新方法. 对多目标拓扑优化问题、柔性机构的拓扑优化问题以及多物理场拓扑优化设计问题进行了讨论. 对优化结构中出现的棋盘格式和网格依赖性等数值计算问题进行剖析和讨论, 介绍和分析了目前解决数值计算问题常见的方法, 在此基础上对边界扩散现象进行了讨论. 给出了连续体结构拓扑优化设计的程序流程, 并用Matlab程序实现了算法, 通过几个典型的算例证明所综述方法的有效性.      

基于节点密度的柔性机构的拓扑优化设计

针对连续体结构拓扑优化中出现的棋盘格式问题提出了一种新的以节点密度作为设计变量的优化方法,从而使设计区域内的密度场函数具有C0连续性。建立了以互能和应变能比值为目标函数的柔性机构拓扑优化数学模型,推导了基于节点密度的柔性机构敏度计算的解析表达式。应用节点密度法对典型算例进行了拓扑优化计算,计算结果表明不需要借助滤波处理,节点密度法就能够得到具有清晰拓扑结构的优化结果,真实地反映了机构的结构细节。     

基于无单元Galerkin方法的受迫振动下的连续体结构拓扑优化

基于无单元Galerkin法(EFG)对受迫振动下的连续体结构进行拓扑优化设计。选取节点的相对密度作为设计变量,以动柔度最小化为目标函数,基于带惩罚的各向同性固体材料模型（SIMP）建立了受迫振动下的连续体结构拓扑优化模型,采用伴随法求解得到目标函数的敏度分析公式,利用优化准则法对优化模型进行求解。通过经典的二维连续体结构拓扑优化算例证明了该方法的可行性和有效性。     

基于区间因子法的随机-区间模型的拓扑优化设计

利用3σ准则将随机变量近似的转换为区间变量,构建了区间栽荷作用下的区问参数平面连续体结构的拓扑优化设计数学模型.以结构的形状拓扑信息为设计变量,结构总质量均值极小化为目标函数,满足单元应力非概率可靠性和结构总体积为约束条件,研究随机-区间模型的拓扑优化设计问题.基于区间因子法,导出了单元应力响应的均值和离差的数学计算表达式,并采用双方向渐进结构优化方法进行求解.通过假设确定性模型最优结构拓扑设计方案中的各个参数与随机-区间模型中参数具有相同分散性,对不同模型进行优化.计算结果表明:在相同载荷作用下,确定性模型下的最优解很可能是随机-区间模型下的不可行解.     

惯性载荷作用下火箭橇结构拓扑优化设计

基于均匀化优化方法,以结构的刚度最大化为目标、材料用量为约束,推导了考虑惯性载荷的准则法公式.由于目标函数具有非单调特性,拓扑优化迭代不易收敛到最优解,因此提出了对准则法迭代中涉及惯性载荷敏度计算部分的修正.通过实例研究表明:本文提出的修正准则法可以保证迭代过程平稳且获得最佳拓扑构型,该拓扑构型与SIMP和BESO方法的基本一致,说明了本文方法的可行性.最后利用本文方法对火箭橇结构进行了拓扑优化设计,所得结果对工程设计应用可提供有益的参考.     

基于无网格数值求解技术的二维连续体结构拓扑优化设计

将无网格径向点插值法(RPIM)引入到连续体结构拓扑优化设计中。在优化问题中,选取节点的相对密度作为设计变量,以结构的柔度最小化作为目标函数,基于带惩罚的各向同性固体材料模型(SIMP)建立了结构拓扑优化的数学模型,推导了目标函数和体积约束的灵敏度,利用优化准则法进行求解。算例表明了应用无网格径向点插值法进行结构拓扑优化设计的可行性和有效性,同时表明选取节点的相对密度作为设计变量可以有效地克服拓扑优化中的棋盘格现象。     

桁架拓扑优化的多点逼近遗传算法

提出一种基于多点逼近函数和遗传算法的桁架拓扑优化方法。该方法建立了包含连续尺寸和离散拓扑两类变量的优化模型，并通过构造多点逼近函数建立了结构优化问题的第一级序列显式近似，然后采用分层优化方法：在外层对拓扑变量采用遗传算法进行优化；在内层对尺寸变量通过可由对偶法求解的第二级序列近似问题进行优化。几个经典的桁架拓扑优化算例表明该方法能以较少的结构分析次数获得比较理想的概率意义上的最优解。     

柔性伸缩蒙皮支撑结构的多目标拓扑优化

针对柔性伸缩蒙皮支撑结构的多目标拓扑优化问题,分析了其实际应用中的优化对象及目标函数,提出使用六边形对设计域进行离散的方法,并建立离散模型与位矩阵的映射关系。采用基于位矩阵的NSGA-Ⅱ（Non-dominated Sorting Genetic Algorithm Ⅱ）进行求解。优化过程中引入个体连通性分析以提高计算效率。通过对可行个体进行有限元分析,获得其目标值;使用罚函数法对不可行个体加以惩罚,最终得到一组互不支配的支撑结构。结果表明,本方法可为柔性伸缩蒙皮支撑结构的多目标拓扑优化问题提供可行、有效的解,也可用于求解其它二维多目标拓扑优化问题。     

TOPOLOGY SYNTHESIS OF GEOMETRICALLY NONLINEAR COMPLIANT MECHANISMS USING MESHLESS METHODS

This paper presents a new method for topology optimization of geometrical nonlinear compliant mechanisms using the element-free Galerkin method （EFGM）. The EFGM is employed as an alternative scheme to numerically solve the state equations by fully taking advantage of its capability in dealing with large displacement problems. In the meshless method, the imposition of essential boundary conditions is also addressed. The popularly studied solid isotropic material with the penalization （SIMP） scheme is used to represent the nonlinear dependence between material properties and regularized discrete densities. The output displacement is regarded as the objective function and the adjoint method is applied to finding the sensitivity of the design functions. As a result, the optimization of compliant mechanisms is mathematically established as a nonlinear programming problem, to which the method of moving asymptotes （MMA） belonging to the sequential convex programming can be applied. The availability of the present method is finally demonstrated with several widely investigated numerical examples.     

Taylor-Galerkin-based spectral element methods for convection-diffusion problems

Several explicit Taylor-Galerkin-based time integration schemes are proposed for the solution of both linear and non-linear convection problems with divergence-free velocity. These schemes are based on second-order Taylor series of the time derivative. The spatial discretization is performed by a high-order Galerkin spectral element method. For convection-diffusion problems an operator-splitting technique is given that decouples the treatment of the convective and diffusive terms. Both problems are then solved using a suitable time scheme. The Taylor-Galerkin methods and the operator-splitting scheme are tested numerically for both convection and convection-diffusion problems.     

基于水平集方法的均布式柔性机构的拓扑优化设计

提出一种利用水平集方法进行均布武柔性机构设计的新方法.根据水平集边界表达方法中具有几何信息的特点,将图像分析中的二次能量函数引入到水平集模型中,以控制柔性机构拓扑优化设计结果的几何尺寸,得到等宽带状均布的柔性机构,较好地解决了传统柔性机构拓扑优化中容易出现单点铰链问题.应用半隐式的加性分裂算子(AOS)算法求解水平集方程,松弛了逆风格式中CFL(Courant-Frie drichs-Lewy)条件对时间步长的限制,提高了求解效率.通过一个典型的二维算例来验证方法的有效性.     

Low-rank solution of an optimal control problem constrained by random Navier-Stokes equations

We develop a low-rank tensor decomposition algorithm for the numerical solution of a distributed optimal control problem constrained by two-dimensional time-dependent Navier-Stokes equations with a stochastic inflow. The goal of optimization is to minimize the flow vorticity. The inflow boundary condition is assumed to be an infinite-dimensional random field, which is parametrized using a finite- (but high-) dimensional Fourier expansion and discretized using the stochastic Galerkin finite element method. This leads to a prohibitively large number of degrees of freedom in the discrete solution. Moreover, the optimality conditions in a time-dependent problem require solving a coupled saddle-point system of nonlinear equations on all time steps at once. For the resulting discrete problem, we approximate the solution by the tensor-train (TT) decomposition and propose a numerically efficient algorithm to solve the optimality equations directly in the TT representation. This algorithm is based on the alternating linear scheme (ALS), but in contrast to the basic ALS method, the new algorithm exploits and preserves the block structure of the optimality equations. We prove that this structure preservation renders the proposed block ALS method well posed, in the sense that each step requires the solution of a nonsingular reduced linear system, which might not be the case for the basic ALS. Finally, we present numerical experiments based on two benchmark problems of simulation of a flow around a von Kármán vortex and a backward step, each of which has uncertain inflow. The experiments demonstrate a significant complexity reduction achieved using the TT representation and the block ALS algorithm. Specifically, we observe that the high-dimensional stochastic time-dependent problem can be solved with the asymptotic complexity of the corresponding deterministic problem.     

积分背景网格对自适应EFG法拓扑优化的影响研究

采用应力能量范数作为误差指标,探讨了EFG法中积分背景网格对计算精度的影响,得到了合理划分背景网格的建议;建立了以节点密度为设计变量、以最小化柔度为优化日标的拓扑优化模型。采用以节点密度值为加点判据的自适应规则加点方案,开展了连续体结构的拓扑优化研究,该加点方案能有效地减少设计变量的个数,探讨了背景网格对拓扑优化结果的影响。算例结果表明,采用合适的背景网格不仅能进一步减少设计变量的个数,而且能够改善拓扑优化结果的光滑性,使计算效率和精度得到提高。     

An inverse problem formulation of the immersed-boundary method

We formulate the immersed-boundary method (IBM) as an inverse problem. A control variable is introduced on the boundary of a larger domain that encompasses the target domain. The optimal control is the one that minimizes the mismatch between the state and the desired boundary value along the immersed target-domain boundary. We begin by investigating a naïve problem formulation that we show is ill-posed: in the case of the Laplace equation, we prove that the solution is unique, but it fails to depend continuously on the data; for the linear advection equation, even solution uniqueness fails to hold. These issues are addressed by two complimentary strategies. The first strategy is to ensure that the enclosing domain tends to the true domain, as the mesh is refined. The second strategy is to include a specialized parameter-free regularization that is based on penalizing the difference between the control and the state on the boundary. The proposed inverse IBM is applied to the diffusion, advection, and advection-diffusion equations using a high-order discontinuous Galerkin discretization. The numerical experiments demonstrate that the regularized scheme achieves optimal rates of convergence and that the reduced Hessian of the optimization problem has a bounded condition number, as the mesh is refined.     

基于网格退化和重组技术的类桁架拓扑优化方法

发展了一种基于有限元网格退化和重组技术的类桁架拓扑优化方法,可在不改变设计域包络的情况下(如维持流型、艺术外观和附加功能等)对结构进行减重。首先,分别对二维问题和三维问题发展相应的有限元网格退化算法,并在刚度等效的意义上对网格进行重组,建立了具有杆元拓扑特征的有限元模型。其次,以全局种子网格的长度尺寸和杆元横截面积为优化变量,构造了域内双层驱动拓扑优化问题,得到具有最优体分比的杆元拓扑结构。数值算例表明,所提方法可获得新型式的结构拓扑优化方案,并可将结构拓扑优化理论推向工程化应用。     

A simultaneous space-time wavelet method for nonlinear initial boundary value problems

A high-precision and space-time fully decoupled numerical method is developed for a class of nonlinear initial boundary value problems. It is established based on a proposed Coiflet-based approximation scheme with an adjustable high order for the functions over a bounded interval, which allows the expansion coefficients to be explicitly expressed by the function values at a series of single points. When the solution method is used, the nonlinear initial boundary value problems are first spatially discretized into a series of nonlinear initial value problems by combining the proposed wavelet approximation and the conventional Galerkin method, and a novel high-order step-by-step time integrating approach is then developed for the resulting nonlinear initial value problems with the same function approximation scheme based on the wavelet theory. The solution method is shown to have the N th-order accuracy, as long as the Coiflet with [0, 3 N-1]compact support is adopted, where N can be any positive even number. Typical examples in mechanics are considered to justify the accuracy and efficiency of the method.