首页> 外文期刊>Computing >Solving the Signorini Problem on the Basis of Domain Decomposition Techniques
【24h】

Solving the Signorini Problem on the Basis of Domain Decomposition Techniques

机译:基于域分解技术解决Signorini问题

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

摘要

The finite element discretization of the Signorini Problem leads to a large scale constrained minimization problem. To improve the convergence rate of the projection method preconditioning must be developed. To be effective, the relative condition number of the system matrix with respect to the preconditioning matrix has to be small and the applications of the preconditioner as well as the projection onto the set of feasible elements have to be fast computable. In this paper, we show how to construct and analyze such preconditioners on the basis of domain decomposition tech- niques. The numerical results obtained for the Signorini problem as well as for contact problems in plane elasticity confirm the theoretical analysis quite well.
机译:Signorini问题的有限元离散化导致大规模的约束最小化问题。为了提高投影方法的收敛速度,必须开发预处理。为了有效,系统矩阵相对于预处理矩阵的相对条件数必须小,并且预处理器的应用以及对可行元素集的投影必须是可快速计算的。在本文中,我们展示了如何基于域分解技术来构造和分析此类前置条件。 Signorini问题以及平面弹性接触问题的数值结果很好地证实了理论分析。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号