Addressing concave boundaries in two-dimensional pointwise contact detection under the common-normal concept

IF 7.3 1区 工程技术 Q1 ENGINEERING, MULTIDISCIPLINARY Computer Methods in Applied Mechanics and Engineering Pub Date : 2025-03-03 DOI:10.1016/j.cma.2025.117865
Lucas da Silva, Marina Vendl Craveiro, Alfredo Gay Neto
{"title":"Addressing concave boundaries in two-dimensional pointwise contact detection under the common-normal concept","authors":"Lucas da Silva,&nbsp;Marina Vendl Craveiro,&nbsp;Alfredo Gay Neto","doi":"10.1016/j.cma.2025.117865","DOIUrl":null,"url":null,"abstract":"<div><div>Contact search, the step where pairs of interacting points are identified, is crucial in computer methods for contact mechanics. This work explores the properties of contact pairs in a specific approach known as master-master method, combined with a hybrid-barrier enforcement method. The scope is on two-dimensional non-conformal contact, modeled as pointwise. Line-to-line and other instances of flat contact, for which a distribution of pressure over a region of finite size better represents their physics, are avoided. The main goal is to overcome the non-uniqueness of solutions when considering concave geometries. The bodies are defined by parameterized plane curves composed of strictly convex segments that represent either convex or concave boundaries. In the master-master approach, contact pairs are characterized by the common normal concept. Within this framework, contact pairs are classified into four types: convex-convex, matchable convex-concave, non-matchable convex-concave, and concave-concave. The Hessian of the squared distance function is analyzed for each type to further characterize them. Characterization using the Hessian matrix reveals that convex-convex and matchable convex-concave pairs are local minimizers of the squared distance function, while the other two types are either saddle points or maximizers. This enables a demonstration of the uniqueness of solutions for convex bodies. In the convex-concave case, projecting the concave boundary onto the convex one results in a univariate restricted objective function that distinguishes matchable pairs as minimizers and non-matchable pairs as maximizers. This function is used to propose a robust search algorithm that includes subdividing the domain into intervals with at most one minimizer, enabling the practical use of iterative minimization techniques to find all desired contact solutions. An algorithm for contact search that accommodates concave geometries is especially valuable in multibody applications.</div></div>","PeriodicalId":55222,"journal":{"name":"Computer Methods in Applied Mechanics and Engineering","volume":"438 ","pages":"Article 117865"},"PeriodicalIF":7.3000,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Methods in Applied Mechanics and Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0045782525001379","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Contact search, the step where pairs of interacting points are identified, is crucial in computer methods for contact mechanics. This work explores the properties of contact pairs in a specific approach known as master-master method, combined with a hybrid-barrier enforcement method. The scope is on two-dimensional non-conformal contact, modeled as pointwise. Line-to-line and other instances of flat contact, for which a distribution of pressure over a region of finite size better represents their physics, are avoided. The main goal is to overcome the non-uniqueness of solutions when considering concave geometries. The bodies are defined by parameterized plane curves composed of strictly convex segments that represent either convex or concave boundaries. In the master-master approach, contact pairs are characterized by the common normal concept. Within this framework, contact pairs are classified into four types: convex-convex, matchable convex-concave, non-matchable convex-concave, and concave-concave. The Hessian of the squared distance function is analyzed for each type to further characterize them. Characterization using the Hessian matrix reveals that convex-convex and matchable convex-concave pairs are local minimizers of the squared distance function, while the other two types are either saddle points or maximizers. This enables a demonstration of the uniqueness of solutions for convex bodies. In the convex-concave case, projecting the concave boundary onto the convex one results in a univariate restricted objective function that distinguishes matchable pairs as minimizers and non-matchable pairs as maximizers. This function is used to propose a robust search algorithm that includes subdividing the domain into intervals with at most one minimizer, enabling the practical use of iterative minimization techniques to find all desired contact solutions. An algorithm for contact search that accommodates concave geometries is especially valuable in multibody applications.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在共同法线概念下解决二维点接触检测中的凹面边界问题
接触搜索是确定相互作用点对的步骤,在接触力学的计算机方法中至关重要。这项工作探讨了接触对的属性在一个特定的方法被称为主-主方法,结合混合屏障强制方法。该范围在二维非共形接触上,以点为模型。线对线和其他平面接触的例子,在有限尺寸的区域上的压力分布更好地代表了它们的物理性质,是避免的。主要目标是克服在考虑凹几何时解的非唯一性。物体由参数化的平面曲线定义,这些曲线由严格的凸段组成,代表凸或凹边界。在master-master方法中,接触对的特征是公法向概念。在此框架下,将接触对分为四种类型:凸凸、匹配凸凹、非匹配凸凹和凹凸凹。分析了每一种类型的距离平方函数的黑森函数,进一步对其进行表征。利用Hessian矩阵的表征表明,凸凸对和匹配凸凹对是距离平方函数的局部极小值,而其他两种类型要么是鞍点,要么是最大值。这就证明了凸体解的唯一性。在凹凸情况下,将凹边界投影到凸边界上,会得到一个单变量受限目标函数,该函数将可匹配的对区分为最小值,将不可匹配的对区分为最大值。该函数用于提出一种鲁棒搜索算法,该算法包括将域细分为具有最多一个最小化器的区间,从而能够实际使用迭代最小化技术来找到所有所需的接触解。一种适应凹几何的接触搜索算法在多体应用中特别有价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
12.70
自引率
15.30%
发文量
719
审稿时长
44 days
期刊介绍: Computer Methods in Applied Mechanics and Engineering stands as a cornerstone in the realm of computational science and engineering. With a history spanning over five decades, the journal has been a key platform for disseminating papers on advanced mathematical modeling and numerical solutions. Interdisciplinary in nature, these contributions encompass mechanics, mathematics, computer science, and various scientific disciplines. The journal welcomes a broad range of computational methods addressing the simulation, analysis, and design of complex physical problems, making it a vital resource for researchers in the field.
期刊最新文献
An inter-scale stiffness propagation method with nonintrusive modeling of stochastic porosity in unidirectional composites Error estimates and graded mesh refinement for isogeometric analysis in the vicinity of polar corners Bi-fidelity interpolative decomposition for multimodal data Multi-field decomposed hyper-reduced order modeling of damage-plasticity simulations Smoothed particle hydrodynamics of anisotropic diffusions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1