Computational annealing of simulated unimodal and bimodal networks

P.R. von Lockette , E.M. Arruda
{"title":"Computational annealing of simulated unimodal and bimodal networks","authors":"P.R. von Lockette ,&nbsp;E.M. Arruda","doi":"10.1016/S1089-3156(01)00019-8","DOIUrl":null,"url":null,"abstract":"<div><p><span>A conjugate gradient Monte Carlo algorithm was used to simulate the annealing of two and three dimensional end-linked unimodal and bimodal polydimethylsiloxane networks. Equilibrium is satisfied at every crosslink during network energy minimization resulting in distinct differences in network characteristics from classical assumptions. Annealed unimodal networks were found to retain the uniformly dispersed arrangement of crosslinks generated during the crosslinking algorithm. </span>Radial distribution functions of chain vector lengths for various unimodal systems show a shift in the mean chain length from the rms length prior to annealing to shorter lengths upon annealing. Short chains in bimodal networks cluster during the annealing process in agreement with experimental investigations of short chain agglomeration in the literature. This work provides the first predictions of bimodal chain network clustering via simulated network formation and demonstrates the critical role of network annealing in determining the initial configurations of deformable elastomeric networks. This information is extremely useful in the development of accurate constitutive models of bimodal networks.</p></div>","PeriodicalId":100309,"journal":{"name":"Computational and Theoretical Polymer Science","volume":"11 6","pages":"Pages 415-428"},"PeriodicalIF":0.0000,"publicationDate":"2001-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1089-3156(01)00019-8","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational and Theoretical Polymer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1089315601000198","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

A conjugate gradient Monte Carlo algorithm was used to simulate the annealing of two and three dimensional end-linked unimodal and bimodal polydimethylsiloxane networks. Equilibrium is satisfied at every crosslink during network energy minimization resulting in distinct differences in network characteristics from classical assumptions. Annealed unimodal networks were found to retain the uniformly dispersed arrangement of crosslinks generated during the crosslinking algorithm. Radial distribution functions of chain vector lengths for various unimodal systems show a shift in the mean chain length from the rms length prior to annealing to shorter lengths upon annealing. Short chains in bimodal networks cluster during the annealing process in agreement with experimental investigations of short chain agglomeration in the literature. This work provides the first predictions of bimodal chain network clustering via simulated network formation and demonstrates the critical role of network annealing in determining the initial configurations of deformable elastomeric networks. This information is extremely useful in the development of accurate constitutive models of bimodal networks.

模拟单峰和双峰网络的计算退火
采用共轭梯度蒙特卡罗算法模拟了二维和三维端链单峰和双峰聚二甲基硅氧烷网络的退火过程。在网络能量最小化过程中,每个交联都满足平衡,导致网络特性与经典假设有明显差异。发现退火单峰网络保留了交联算法中产生的均匀分散的交联排列。各种单峰系统的链矢量长度的径向分布函数表明,平均链长度从退火前的均方根长度向退火后的较短长度转变。双峰网络中的短链在退火过程中聚集,与文献中短链聚集的实验研究一致。这项工作通过模拟网络形成提供了双峰链网络聚类的第一个预测,并证明了网络退火在确定可变形弹性体网络的初始构型中的关键作用。这些信息对于双峰网络的精确本构模型的发展是非常有用的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
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学术官方微信