检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵子龙 荣毅 燕翌 冯西桥 谢亿民 Zi-Long Zhao;Yi Rong;Yi Yan;Xi-Qiao Feng;Yi Min Xie(Institute of Solid Mechanics,School of Aeronautic Science and Engineering,Beihang University,Beijing 100191,China;Centre for Innovative Structures and Materials,School of Engineering,RMIT University,Melbourne 300l,Australia;Department of Engineering Mechanics,MIIT Key Laboratory of Dynamics and Control of Complex Systems,Northwestern Polytechnical University,Xi'an710072,China;Institute of Biomechanics and Medical Engineering,Department of Engineering Mechanics,Tsinghua University,Bejing 100084,China)
机构地区:[1]Institute of Solid Mechanics,School of Aeronautic Science and Engineering,Beihang University,Beijing 100191,China [2]Centre for Innovative Structures and Materials,School of Engineering,RMIT University,Melbourne 300l,Australia [3]Department of Engineering Mechanics,MIIT Key Laboratory of Dynamics and Control of Complex Systems,Northwestern Polytechnical University,Xi'an710072,China [4]Institute of Biomechanics and Medical Engineering,Department of Engineering Mechanics,Tsinghua University,Bejing 100084,China
出 处:《Acta Mechanica Sinica》2023年第9期114-125,共12页力学学报(英文版)
基 金:supported by the National Natural Science Foundation of China(Grant Nos.12272034,11921002,12002184);the Fundamental Research Funds for the Central Universities(Grant No.501LKQB2022105038);the Australian Research Council(Grant Nos.DE200100887,FL190100014).
摘 要:结构拓扑优化在过去的三十年里经历了巨大的发展,充分利用高性能计算资源有助于拓宽拓扑优化在大规模设计问题中的应用。本文提出了一种针对一般三维拓扑优化的基于子区域的并行策略。通过子区域划分、矩阵运算、引入单元硬杀算法,优化过程得以显著提速.将该策略整合进高效、简洁的Python代码;该代码可适用于任意形状的设计域.附录一中给出的完整代码,易于扩展,扩展后可解决多类优化问题.通过求解四个柔度最小化问题展示了该策略的高效性.本研究在机械工程、先进制造,以及建筑设计等领域有潜在的应用价值.Structural topology optimization has undergone tremendous developments in the past three decades.Making the most of highperformance computing resources contributes to broadening the application of topology optimization in large-scale design problems.In this paper,a subdomain-based parallel strategy is proposed for general three-dimensional topology optimization.The optimization process is significantly accelerated through subdomain division,matrix calculation,and hard-kill algorithm.This strategy is integrated into an efficient and compact Python code,which is valid for design space with an arbitrary shape.The complete code,given in Appendix l,can be easily extended to tackle different kinds of optimization problems.Four compliance minimization problems are taken as examples to demonstrate the efficiency of the proposed strategy.This work has potential applications in areas such as mechanical engineering,advanced manufacturing,and architectural design.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38