首页> 外文会议>International workshop on computer algebra in scientific computing >Certifying Simple Zeros of Over-Determined Polynomial Systems
【24h】

Certifying Simple Zeros of Over-Determined Polynomial Systems

机译:证明超多项式系统的简单零

获取原文

摘要

We construct a real square system related to a given over-determined real system. We prove that the simple real zeros of the over-determined system are the simple real zeros of the related square system and the real zeros of the two systems are one-to-one correspondence with the constraint that the value of the sum of squares of the polynomials in the over-determined system at the real zeros is identically zero. After certifying the simple real zeros of the related square system with the interval methods, we assert that the certified zero is a local minimum of the sum of squares of the input polynomials. If the value of the sum of the squares of the input polynomials at the certified zero is equal to zero, then it is a zero of the input system. Notice that a complex system with complex zeros can be transformed into a real system with real zeros.
机译:我们构造与给定超确定实系统相关的实平方系统。我们证明了超定系统的简单实零是相关平方系统的简单实零,并且两个系统的实零是一一对应的,其约束是在超确定系统中,实零点处的多项式等于零。在使用区间方法验证了相关平方系统的简单实零之后,我们断言所证明的零是输入多项式平方和的局部最小值。如果输入多项式的平方和的总和等于零,那么它就是输入系统的零。请注意,具有复杂零的复杂系统可以转换为具有真实零的实际系统。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号