首页> 外文OA文献 >Newton iterations in implicit time-stepping scheme for differential linear complementarity systems
【2h】

Newton iterations in implicit time-stepping scheme for differential linear complementarity systems

机译:差分线性互补系统隐式时间步方法的牛顿迭代

摘要

We propose a generalized Newton method for solving the system of nonlinear equations with linear complementarity constraints in the implicit or semi-implicit time-stepping scheme for differential linear complementarity systems (DLCS). We choose a specific solution from the solution set of the linear complementarity constraints to define a locally Lipschitz continuous right-hand-side function in the differential equation. Moreover, we present a simple formula to compute an element in the Clarke generalized Jacobian of the solution function. We show that the implicit or semi-implicit time-stepping scheme using the generalized Newton method can be applied to a class of DLCS including the nondegenerate matrix DLCS and hidden Z-matrix DLCS, and has a superlinear convergence rate. To illustrate our approach, we show that choosing the least-element solution from the solution set of the Z-matrix linear complementarity constraints can define a Lipschitz continuous right-hand-side function with a computable Lipschitz constant. The Lipschitz constant helps us to choose the step size of the time-stepping scheme and guarantee the convergence.
机译:我们提出了一种广义牛顿法,用于求解差分线性互补系统(DLCS)的隐式或半隐式时间步长方案中具有线性互补约束的非线性方程组。我们从线性互补约束的解集中选择一个特定解,以在微分方程中定义局部Lipschitz连续右手函数。此外,我们提供了一个简单的公式来计算求解函数的Clarke广义Jacobian元素。我们表明,使用广义牛顿法的隐式或半隐式时间步长方案可以应用于一类包括非退化矩阵DLCS和隐藏Z矩阵DLCS的DLCS,并且具有超线性收敛速度。为了说明我们的方法,我们表明从Z矩阵线性互补约束的解集中选择最小元素的解可以定义具有可计算Lipschitz常数的Lipschitz连续右手边函数。 Lipschitz常数可帮助我们选择时间步进方案的步长并确保收敛。

著录项

  • 作者

    Chen X; Xiang S;

  • 作者单位
  • 年度 2013
  • 总页数
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号