首页> 外文期刊>Computing. Archives for Informatics and Numerical Computation >Scalable Total BETI based algorithm for 3D coercive contact problems of linear elastostatics
【24h】

Scalable Total BETI based algorithm for 3D coercive contact problems of linear elastostatics

机译:基于可伸缩的基于总BETI的线性弹性静力3D强制接触问题算法

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

摘要

A Total BETI (TBETI) based domain decomposition algorithm with the preconditioning by a natural coarse grid of the rigid body motions is adapted for the solution of contact problems of linear elastostatics and proved to be scalable for the coercive problems, i.e., the cost of the solution is asymptotically proportional to the number of variables. The analysis is based on the original results by Langer and Steinbach on the scalability of BETI for linear problems and our development of optimal quadratic programming algorithms for bound and equality constrained problems. Both theoretical results and numerical experiments indicate a high efficiency of the algorithms presented. [PUBLICATION ABSTRACT]
机译:一种基于Total BETI(TBETI)的域分解算法,通过自然运动的自然粗网格进行预处理,适用于线性弹性静力学接触问题的解决方案,并被证明可解决强制性问题,即强制成本解与变量数量渐近成正比。该分析基于Langer和Steinbach关于BETI对线性问题的可伸缩性的原始结果以及我们对有界和等式约束问题的最佳二次规划算法的开发。理论结果和数值实验都表明所提出算法的高效率。 [出版物摘要]

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号