...
首页> 外文期刊>Mechanics of Advanced Materials and Structures >Implicit Time Integration in the Generalized Interpolation Material Point Method for Finite Deformation Hyperelasticity
【24h】

Implicit Time Integration in the Generalized Interpolation Material Point Method for Finite Deformation Hyperelasticity

机译:有限变形超弹性广义插值材料点法中的隐式时间积分

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

In this article, a novel implicit time-integration scheme for the generalized interpolation material point method (GIMP) is discussed. The implicit algorithm discussed in this article is an extension of the algorithm introduced for the material point method (MPM) by Sulsky and Kaul [1]. In this article, the numerical solution employs the Newton-Krylov technique coupled with the conjugate gradient (CG) method to solve the governing equations in a robust, matrix-free fashion. In implicit MPM, the solution procedure needs to be re-ordered in terms of momentum if the algorithm has to solve large deformation problems [1]. This is a direct consequence of the cell-crossing issues in MPM. The solution procedure in this case uses the generalized minimum residual method to solve the resulting non-symmetric equations. However, GIMP is specifically formulated to overcome these particle cell-crossing issues in MPM; hence, a specialized procedure for large deformation is not required. The proposed implicit algorithm for GIMP is benchmarked for hyperelasticity problems by comparison with finite element analysis (FEA) and exact solution.View full textDownload full textKeywordsmaterial point method, implicit, hyperelastic, polymers, large-deformationRelated var addthis_config = { ui_cobrand: "Taylor & Francis Online", services_compact: "citeulike,netvibes,twitter,technorati,delicious,linkedin,facebook,stumbleupon,digg,google,more", pubid: "ra-4dff56cd6bb1830b" }; Add to shortlist Link Permalink http://dx.doi.org/10.1080/15376494.2010.550082
机译:在本文中,讨论了一种新的隐式时间积分方案,用于广义插值物质点方法(GIMP)。本文讨论的隐式算法是对Sulsky和Kaul [1]的材料点方法(MPM)引入的算法的扩展。在本文中,数值解采用了牛顿-克里洛夫技术和共轭梯度(CG)方法,以鲁棒,无矩阵的方式求解控制方程。在隐式MPM中,如果算法必须解决较大的变形问题,则需要根据动量对求解过程进行重新排序[1]。这是MPM中单元交叉问题的直接结果。在这种情况下,求解过程使用广义最小残差法来求解所得的非对称方程。但是,GIMP是专门为克服MPM中的这些颗粒细胞交叉问题而配制的;因此,不需要大变形的专门程序。拟议的GIMP隐式算法通过与有限元分析(FEA)和精确解决方案进行比较,对超弹性问题进行了基准测试。弗朗西斯在线”,services_compact:“ citeulike,netvibes,twitter,technorati,美味,linkedin,facebook,stumbleupon,digg,google,更多”,发布号:“ ra-4dff56cd6bb1830b”};添加到候选列表链接永久链接http://dx.doi.org/10.1080/15376494.2010.550082

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号