一种新的全拉格朗日物质点法接触算法

IF 2.9 3区 工程技术 Q1 ENGINEERING, MULTIDISCIPLINARY
Quang Hieu Bui, Vinh Phu Nguyen, Alban de Vaucorbeil
{"title":"一种新的全拉格朗日物质点法接触算法","authors":"Quang Hieu Bui,&nbsp;Vinh Phu Nguyen,&nbsp;Alban de Vaucorbeil","doi":"10.1002/nme.70105","DOIUrl":null,"url":null,"abstract":"<p>The Total Lagrangian Material Point Method (TLMPM) is a relatively new variant of the now popular MPM, a method to solve partial differential equations appearing in solid and fluid mechanics problems. In TLMPM, each solid has its own grid, and all calculations are carried out in a configuration of reference, often the original configuration. Because of this, TLMPM is free of numerical fracture, cell crossing instability and is efficient. An unfortunate result of having individual grids is that TLMPM does not have a built-in contact algorithm. Recently, a contact algorithm based on particle-to-particle contact was published for TLMPM. However, it scales quadratically with the number of particles and is therefore slow for a large number of particles. This paper introduces a new contact algorithm for TLMPM using a flexible contact grid. The advantages of this algorithm are: (1) all the advantages of TLMPM are kept, such as the absence of numerical fracture and good convergence rates; (2) the core principle of using a background grid in the material point method for contacts is preserved; (3) different basis functions can be used for each grid, and (4) boundary conditions can be enforced with more flexibility. The performance of the new algorithm is demonstrated through several two and three-dimensional numerical examples exhibiting large elastic and plastic deformation.</p>","PeriodicalId":13699,"journal":{"name":"International Journal for Numerical Methods in Engineering","volume":"126 17","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2025-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nme.70105","citationCount":"0","resultStr":"{\"title\":\"A New Contact Algorithm for the Total-Lagrangian Material Point Method\",\"authors\":\"Quang Hieu Bui,&nbsp;Vinh Phu Nguyen,&nbsp;Alban de Vaucorbeil\",\"doi\":\"10.1002/nme.70105\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The Total Lagrangian Material Point Method (TLMPM) is a relatively new variant of the now popular MPM, a method to solve partial differential equations appearing in solid and fluid mechanics problems. In TLMPM, each solid has its own grid, and all calculations are carried out in a configuration of reference, often the original configuration. Because of this, TLMPM is free of numerical fracture, cell crossing instability and is efficient. An unfortunate result of having individual grids is that TLMPM does not have a built-in contact algorithm. Recently, a contact algorithm based on particle-to-particle contact was published for TLMPM. However, it scales quadratically with the number of particles and is therefore slow for a large number of particles. This paper introduces a new contact algorithm for TLMPM using a flexible contact grid. The advantages of this algorithm are: (1) all the advantages of TLMPM are kept, such as the absence of numerical fracture and good convergence rates; (2) the core principle of using a background grid in the material point method for contacts is preserved; (3) different basis functions can be used for each grid, and (4) boundary conditions can be enforced with more flexibility. The performance of the new algorithm is demonstrated through several two and three-dimensional numerical examples exhibiting large elastic and plastic deformation.</p>\",\"PeriodicalId\":13699,\"journal\":{\"name\":\"International Journal for Numerical Methods in Engineering\",\"volume\":\"126 17\",\"pages\":\"\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2025-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nme.70105\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal for Numerical Methods in Engineering\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/nme.70105\",\"RegionNum\":3,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal for Numerical Methods in Engineering","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/nme.70105","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

全拉格朗日物质点法(TLMPM)是目前流行的全拉格朗日物质点法的一个较新的变体,是一种求解固体和流体力学问题中出现的偏微分方程的方法。在TLMPM中,每个实体都有自己的网格,所有的计算都是在参考配置中进行的,通常是原始配置。因此,TLMPM没有数值断裂,细胞交叉不稳定,效率高。拥有单独网格的一个不幸的结果是TLMPM没有内置的接触算法。最近发表了一种基于粒子间接触的TLMPM接触算法。然而,它与粒子的数量成二次比例,因此对于大量的粒子来说是缓慢的。本文介绍了一种基于柔性接触网格的TLMPM接触算法。该算法的优点是:(1)保留了TLMPM的所有优点,如无数值断裂和良好的收敛速度;(2)保留了接触物质点法中使用背景网格的核心原则;(3)每个网格可以使用不同的基函数;(4)边界条件可以更灵活地强制执行。通过几个大弹塑性变形的二维和三维数值算例,验证了新算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A New Contact Algorithm for the Total-Lagrangian Material Point Method

A New Contact Algorithm for the Total-Lagrangian Material Point Method

The Total Lagrangian Material Point Method (TLMPM) is a relatively new variant of the now popular MPM, a method to solve partial differential equations appearing in solid and fluid mechanics problems. In TLMPM, each solid has its own grid, and all calculations are carried out in a configuration of reference, often the original configuration. Because of this, TLMPM is free of numerical fracture, cell crossing instability and is efficient. An unfortunate result of having individual grids is that TLMPM does not have a built-in contact algorithm. Recently, a contact algorithm based on particle-to-particle contact was published for TLMPM. However, it scales quadratically with the number of particles and is therefore slow for a large number of particles. This paper introduces a new contact algorithm for TLMPM using a flexible contact grid. The advantages of this algorithm are: (1) all the advantages of TLMPM are kept, such as the absence of numerical fracture and good convergence rates; (2) the core principle of using a background grid in the material point method for contacts is preserved; (3) different basis functions can be used for each grid, and (4) boundary conditions can be enforced with more flexibility. The performance of the new algorithm is demonstrated through several two and three-dimensional numerical examples exhibiting large elastic and plastic deformation.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
5.70
自引率
6.90%
发文量
276
审稿时长
5.3 months
期刊介绍: The International Journal for Numerical Methods in Engineering publishes original papers describing significant, novel developments in numerical methods that are applicable to engineering problems. The Journal is known for welcoming contributions in a wide range of areas in computational engineering, including computational issues in model reduction, uncertainty quantification, verification and validation, inverse analysis and stochastic methods, optimisation, element technology, solution techniques and parallel computing, damage and fracture, mechanics at micro and nano-scales, low-speed fluid dynamics, fluid-structure interaction, electromagnetics, coupled diffusion phenomena, and error estimation and mesh generation. It is emphasized that this is by no means an exhaustive list, and particularly papers on multi-scale, multi-physics or multi-disciplinary problems, and on new, emerging topics are welcome.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信