A New Triangular Decomposition Algorithm for Differential Polynomial Systems

来源 :第八届工业与应用数学国际大会 | 被引量 : 0次 | 上传用户:wgsnt1
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  In this talk,a new triangular decomposition algorithm will be presented for ordinary differential polynomial systems,which has triple exponential computational complexity.
其他文献
  The problem concerning global existence and finite-time blow-up for solutions of differential equations is an important issue in many mathematical models an
会议
  Linear and nonlinear stability of a zonal flows on a rotating sphere is discussed numerically and analytically.
会议
  We consider Kolmogorov's problem for the 2D Navier-Stokes equations.
会议
  This second part deals with some asymptotic and numerical results on a self-similar Navier-Stokes flows(Proudman-Johnson flows)confirming the unimodality fo
会议
  We present a statistical framework for characterizing and comparing morphological variation in biological shapes.
会议
  In this talk,we discuss the problem of segmentation and tracking of objects in videos.
会议
  We introduce the notion of multiscale covariance tensor fields associated with a probability measure on Euclidean space and use these fields to define local
会议
  In this talk we explore a class of matrix-valued kernels that induce Riemannian translation-and rotation-invariant metrics on the group of diffeomorphisms.
会议
  Stochastic hybrid systems exist in many real embedded systems that operate in the presence of uncertainty and randomness.
会议
  Traditionally,a Cylindrical Algebraic Decomposition(CAD)was sign-,or order-,invariant for the polynomials,meaning it could answer ALL questions about those
会议