首页| English| 中国科学院

Deterministically Certifying an Isolated Simple Zero of an Over-determined Polynomial System with Interval Arithmetic and Its Applications

副标题:

时间:2018-08-24  来源:KLMM

题目:           Deterministically Certifying an Isolated Simple Zero of an Over-determined Polynomial System with Interval Arithmetic and Its Applications

报告人:      窦孝杰 中国民航大学

时间地点:   2018.08.27  16:00pm  N402

摘要:           We realize a Maple implementation of interval verification method of a simple zero of a square system. Compared to Matlab implementation, it can reach a much higher accuracy. We can evaluate a polynomial on a point to get a number whose absolute value is very small, which can reach the bound computed by the formula for not very big systems. Thus we can deterministically certify isolated simple zeros of an over-determined polynomial systems. As an application, we use it to deterministically certify isolated multiple zeros of small systems.

相关附件
相关文档