Voronoi discretization to improve the meshless local Petrov–Galerkin method in 3D-computational fracture mechanics

IF 1.5 4区 工程技术 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Behrooz Ariannezhad, Shahram Shahrooi, Mohammad Shishesaz
{"title":"Voronoi discretization to improve the meshless local Petrov–Galerkin method in 3D-computational fracture mechanics","authors":"Behrooz Ariannezhad, Shahram Shahrooi, Mohammad Shishesaz","doi":"10.1108/ec-07-2022-0492","DOIUrl":null,"url":null,"abstract":"Purpose 1) The OE-MLPG penalty meshfree method is developed to solve cracked structure.(2) Smartening the numerical meshfree method by combining the particle swarm optimization (PSO) optimization algorithms and Voronoi computational geometric algorithm. (3). Selection of base functions, finding optimal penalty factor and distribution of appropriate nodal points to the accuracy of calculation in the meshless local Petrov–Galekrin (MLPG) meshless method. Design/methodology/approach Using appropriate shape functions and distribution of nodal points in local domains and sub-domains and choosing an approximation or interpolation method has an effective role in the application of meshless methods for the analysis of computational fracture mechanics problems, especially problems with geometric discontinuity and cracks. In this research, computational geometry technique, based on the Voronoi diagram (VD) and Delaunay triangulation and PSO algorithm, are used to distribute nodal points in the sub-domain of analysis (crack line and around it on the crack plane). Findings By doing this process, the problems caused by too closeness of nodal points in computationally sensitive areas that exist in general methods of nodal point distribution are also solved. Comparing the effect of the number of sentences of basic functions and their order in the definition of shape functions, performing the mono-objective PSO algorithm to find the penalty factor, the coefficient, convergence, arrangement of nodal points during the three stages of VD implementation and the accuracy of the answers found indicates, the efficiency of V-E-MLPG method with Ns = 7 and ß = 0.0037–0.0075 to estimation of 3D-stress intensity factors (3D-SIFs) in computational fracture mechanics. Originality/value The present manuscript is a continuation of the studies (Ref. [33]) carried out by the authors, about; feasibility assessment, improvement and solution of challenges, introduction of more capacities and capabilities of the numerical MLPG method have been used. In order to validate the modeling and accuracy of calculations, the results have been compared with the findings of reference article [34] and [35].","PeriodicalId":50522,"journal":{"name":"Engineering Computations","volume":"1 2","pages":"0"},"PeriodicalIF":1.5000,"publicationDate":"2023-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Computations","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/ec-07-2022-0492","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Purpose 1) The OE-MLPG penalty meshfree method is developed to solve cracked structure.(2) Smartening the numerical meshfree method by combining the particle swarm optimization (PSO) optimization algorithms and Voronoi computational geometric algorithm. (3). Selection of base functions, finding optimal penalty factor and distribution of appropriate nodal points to the accuracy of calculation in the meshless local Petrov–Galekrin (MLPG) meshless method. Design/methodology/approach Using appropriate shape functions and distribution of nodal points in local domains and sub-domains and choosing an approximation or interpolation method has an effective role in the application of meshless methods for the analysis of computational fracture mechanics problems, especially problems with geometric discontinuity and cracks. In this research, computational geometry technique, based on the Voronoi diagram (VD) and Delaunay triangulation and PSO algorithm, are used to distribute nodal points in the sub-domain of analysis (crack line and around it on the crack plane). Findings By doing this process, the problems caused by too closeness of nodal points in computationally sensitive areas that exist in general methods of nodal point distribution are also solved. Comparing the effect of the number of sentences of basic functions and their order in the definition of shape functions, performing the mono-objective PSO algorithm to find the penalty factor, the coefficient, convergence, arrangement of nodal points during the three stages of VD implementation and the accuracy of the answers found indicates, the efficiency of V-E-MLPG method with Ns = 7 and ß = 0.0037–0.0075 to estimation of 3D-stress intensity factors (3D-SIFs) in computational fracture mechanics. Originality/value The present manuscript is a continuation of the studies (Ref. [33]) carried out by the authors, about; feasibility assessment, improvement and solution of challenges, introduction of more capacities and capabilities of the numerical MLPG method have been used. In order to validate the modeling and accuracy of calculations, the results have been compared with the findings of reference article [34] and [35].
Voronoi离散化改进三维断裂力学计算中的无网格局部Petrov-Galerkin方法
(2)将粒子群优化(PSO)算法与Voronoi计算几何算法相结合,对数值无网格方法进行智能化。(3)无网格局部Petrov-Galekrin (MLPG)无网格法中基函数的选择、最优惩罚因子的寻找和适当节点的分布对计算精度的影响。设计/方法/方法利用局部域和子域中适当的形状函数和节点分布,选择近似或插值方法,可以有效地应用无网格方法分析计算断裂力学问题,特别是具有几何不连续和裂纹的问题。在本研究中,基于Voronoi图(VD)和Delaunay三角剖分以及粒子群算法的计算几何技术,在分析子域(裂纹线及其周围)上分布节点。通过这一过程,也解决了一般节点分布方法中存在的计算敏感区域节点过于接近的问题。通过比较基本函数的句数和句序对形状函数定义的影响,利用单目标粒子群算法求出VD实施三个阶段的惩罚因子、系数、收敛性、节点排列以及答案的准确性表明:采用Ns = 7、ß = 0.0037 ~ 0.0075的V-E-MLPG方法估算断裂力学计算中的三维应力强度因子(3D-SIFs)的效率。原创性/价值本手稿是作者进行的研究(参考文献[33])的延续,大约;应用了数值MLPG方法的可行性评估、改进和解决挑战、引入更多的能力和能力。为了验证建模和计算的准确性,将结果与文献[34]和[35]的研究结果进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Engineering Computations
Engineering Computations 工程技术-工程:综合
CiteScore
3.40
自引率
6.20%
发文量
61
审稿时长
5 months
期刊介绍: The journal presents its readers with broad coverage across all branches of engineering and science of the latest development and application of new solution algorithms, innovative numerical methods and/or solution techniques directed at the utilization of computational methods in engineering analysis, engineering design and practice. For more information visit: http://www.emeraldgrouppublishing.com/ec.htm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信