Robust Fast Fracture Plane Orientation Angle Search Algorithm for Puck 3D Inter-Fibre Failure Criterion

IF 1.5 Q3 MECHANICS
N. Wirawan, I. Abuzayed, M. Akbar, J. L. Curiel-Sosa
{"title":"Robust Fast Fracture Plane Orientation Angle Search Algorithm for Puck 3D Inter-Fibre Failure Criterion","authors":"N. Wirawan, I. Abuzayed, M. Akbar, J. L. Curiel-Sosa","doi":"10.13052/ejcm2642-2085.3332","DOIUrl":null,"url":null,"abstract":"In the present work, a novel fast fracture plane orientation angle (FPOA) search algorithm for the 3D Puck failure criterion is proposed. In the 3D Puck failure criterion, a linear search algorithm is employed to calculate the maximum inter-fibre failure (IFF) value by iterating and comparing the IFF value for each FPOA. This process itself requires a substantial amount of computational resources. The proposed fast FPOA search algorithm is implemented to substitute the linear search algorithm in order to reduce the computational time. A total of 1×105 randomised stress cases are used to analyse the accuracy of the algorithm. The result was then compared with the Puck Stepwise Seach Method (SSM) and other fast FPOA search algorithms. The results show that the proposed fast FPOA search algorithm has better accuracy compared to the other fast FPOA search algorithms and is almost 5 times faster compared to the SSM algorithm by Puck. In addition, a subroutine contains the Puck failure criterion and the proposed fast FPOA search algorithm is embedded into a Finite Element Analysis (FEA) software to simulate the open-hole test (OHT) experiment on the composite material.","PeriodicalId":45463,"journal":{"name":"European Journal of Computational Mechanics","volume":null,"pages":null},"PeriodicalIF":1.5000,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Computational Mechanics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.13052/ejcm2642-2085.3332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MECHANICS","Score":null,"Total":0}
引用次数: 0

Abstract

In the present work, a novel fast fracture plane orientation angle (FPOA) search algorithm for the 3D Puck failure criterion is proposed. In the 3D Puck failure criterion, a linear search algorithm is employed to calculate the maximum inter-fibre failure (IFF) value by iterating and comparing the IFF value for each FPOA. This process itself requires a substantial amount of computational resources. The proposed fast FPOA search algorithm is implemented to substitute the linear search algorithm in order to reduce the computational time. A total of 1×105 randomised stress cases are used to analyse the accuracy of the algorithm. The result was then compared with the Puck Stepwise Seach Method (SSM) and other fast FPOA search algorithms. The results show that the proposed fast FPOA search algorithm has better accuracy compared to the other fast FPOA search algorithms and is almost 5 times faster compared to the SSM algorithm by Puck. In addition, a subroutine contains the Puck failure criterion and the proposed fast FPOA search algorithm is embedded into a Finite Element Analysis (FEA) software to simulate the open-hole test (OHT) experiment on the composite material.
用于帕克三维纤维间断裂标准的稳健快速断裂面方向角搜索算法
本研究针对三维帕克失效准则提出了一种新型快速断裂面取向角(FPOA)搜索算法。在三维 Puck 失效准则中,采用了线性搜索算法,通过迭代和比较每个 FPOA 的 IFF 值来计算最大纤维间失效(IFF)值。这一过程本身需要大量的计算资源。为了减少计算时间,提出了快速 FPOA 搜索算法来替代线性搜索算法。共使用了 1×105 个随机应力案例来分析算法的准确性。然后将结果与帕克逐步搜索法(SSM)和其他快速 FPOA 搜索算法进行比较。结果表明,与其他快速 FPOA 搜索算法相比,所提出的快速 FPOA 搜索算法具有更高的精确度,与 Puck 的 SSM 算法相比,速度几乎快了 5 倍。此外,在有限元分析(FEA)软件中嵌入了包含 Puck 失效准则和所提出的快速 FPOA 搜索算法的子程序,以模拟复合材料的开孔试验(OHT)实验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.70
自引率
8.30%
发文量
0
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
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学术官方微信