首页> 外文期刊>Journal of symbolic computation >A polynomial time algorithm for finding rational general solutions of first order autonomous ODEs
【24h】

A polynomial time algorithm for finding rational general solutions of first order autonomous ODEs

机译:一阶自主ODE有理通用解的多项式时间算法

获取原文
获取原文并翻译 | 示例
           

摘要

We give a necessary and sufficient condition for an algebraic ODE to have a rational type general solution. For a first order autonomous ODE F = 0, we give an exact degree bound for its rational solutions, based on the connection between rational solutions of F = 0 and rational parametrizations of the plane algebraic curve defined by F = 0. For a first order autonomous ODE, we further give a polynomial time algorithm for computing a rational general solution if it exists based on the computation of Laurent series solutions and Pade approximants. Experimental results show that the algorithm is quite efficient.
机译:我们为代数ODE给出一个有理类型的一般解提供了充要条件。对于一阶自治ODE F = 0,我们基于F = 0的有理解与F = 0定义的平面代数曲线的有理参数化之间的联系,为其精确解给出一个精确度界。自治ODE,我们进一步根据Laurent级数解和Pade近似值的存在,给出了一种用于计算有理通用解的多项式时间算法。实验结果表明该算法是有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号