首页> 外文会议>International workshop on computer algebra in scientific computing >Penalty Function Based Critical Point Approach to Compute Real Witness Solution Points of Polynomial Systems
【24h】

Penalty Function Based Critical Point Approach to Compute Real Witness Solution Points of Polynomial Systems

机译:基于罚函数的临界点法计算多项式系统的真实见证解点

获取原文

摘要

We present a critical point method based on a penalty function for finding certain solution (witness) points on real solutions components of general real polynomial systems. Unlike other existing numerical methods, the new method does not require the input polynomial system to have pure dimension or satisfy certain regularity conditions. This method has two stages. In the first stage it finds approximate solution points of the input system such that there is at least one real point on each connected solution component. In the second stage it refines the points by a homotopy continuation or traditional Newton iteration. The singularities of the original system are removed by embedding it in a higher dimensional space. In this paper we also analyze the convergence rate and give an error analysis of the method. Experimental results are also given and shown to be in close agreement with the theory.
机译:我们提出了一种基于惩罚函数的临界点方法,用于在一般实多项式系统的实解组件上找到某些解(见证)点。与其他现有的数值方法不同,该新方法不需要输入多项式系统具有纯维或满足某些正则条件。此方法有两个阶段。在第一阶段,它找到输入系统的近似解点,以使每个连接的解分量上至少有一个实点。在第二阶段,它通过同伦连续或传统的牛顿迭代来精炼点。通过将原始系统嵌入到更高维度的空间中,可以消除其奇异之处。在本文中,我们还分析了收敛速度,并对该方法进行了误差分析。实验结果也与理论相吻合。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号