The Nearest Polynomial with Two or More Given Zeros

来源 :第八届工业与应用数学国际大会 | 被引量 : 0次 | 上传用户:jili7315
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  For a given real polynomial f and two or more given zeros,we consider a problem of describing the distance between f and the nearest polynomial(f)to f having given zeros.
其他文献
  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.
会议
  In this talk,I will present a method to certify and compute numerically the simple zeros of an over-determined polynomial system.
会议
  In this talk,we introduce integral-differential algebras.By using the method of Grobner-Shirshov bases,we give the constructions of free commutative integro
会议
  Given two points in a real algebraic set,the motion planning problem consists in building a continuous path connecting them,if possible.
会议