论文部分内容阅读
In this talk,I will present a method to certify and compute numerically the simple zeros of an over-determined polynomial system.
Certifying and Computing the Simple Zeros of Over-determined Polynomial Systems
【摘 要】
：
In this talk,I will present a method to certify and compute numerically the simple zeros of an over-determined polynomial system.
【机 构】
：
Chinese Acad.of Sci.
【出 处】
：
第八届工业与应用数学国际大会
【发表日期】
：
2015年期
其他文献
In this paper,we propose a novel solution to the structural optimization problem that provides minimal deformation of the frame structure under various dist
会议
Nanometer-level synchronized movement accuracy is the key factor to guarantee the pattern transfer with high fidelity for wafer stage of lithographic tool.
会议
Manufacturing process planning frequently requires complex geometric computations to be performed.
会议
We propose a so-called "co-prime condition",which can be used as one of the integrability criteria for discrete equations.
会议
In the literature,there have been considerable interests in the study of nonsingular rational solutions for nonlinear models.
会议
In this talk,we discuss about two integrability detectors,namely,singularity confinement approach and algebraic entropy method.for discrete systems.
会议
We set up an algebraic theory of multivariable integration,based on a hierarchy of Rota-Baxter operators and an action of the matrix monoid as linear substi
会议
A long standing problem of Rota asks for the classification of all algebraic identities that can be satisfied by linear operators on algebras.
会议
In recent years,there have been major developments in applications of integrable systems.Originally,integrability has been recognized through solitons,which
会议
In this talk,we will provide some relations between Rota-Baxter algebras and quantum algebras.
会议