节点文献

有限递推法与待定系数法的计算复杂性比较——用于求y"+py’+qy=Pm(x)eaxcosbx(或sinbx)的特解时

A Comparison of the Computing Complexity of the Finite Recurrence Method and the Method of Undetermined Coefficients on Finding the Particular Solution of——y" +py’+qy= Pm(x)eax cosbx or y"+py’+qy=Pm(x)eaxsinbx

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 刘颖方有康

【Author】 LIU Ying;FANG You-kang;Information Department,Liaoning Provincial College of Communications;Beihai College of Beihang University;Faculty of Science,Shenyang Ligong University;

【机构】 辽宁省交通高等专科学校信息系北京航空航天大学北海学院沈阳理工大学理学院

【摘要】 分析了在求二阶常系数线性常微分方程y"+py’+qy=Pm(x)eaxcos bx;y"+py’+qy=Pm(x)eaxsin bx的特解时;采用有限递推法或待定系数法的各自计算复杂性.证明了在求上述方程特解时,有限递推法在计算复杂性上优于待定系数法.

【Abstract】 In this paper,a comparison of the computing complexity on finding the particular solution of y " + py’ + qy = Pm(x)eaxcos bx or y" + py’ + qy = Pm(x)eaxsin bx using the finite recurrence method and the method of undetermined coefficients is given.It is shown that from the viewpoint of the computing complexity,the finite recurrence method is better than the method of undetermined coefficients on solving the problem above.

  • 【文献出处】 数学的实践与认识 ,Mathematics in Practice and Theory , 编辑部邮箱 ,2014年17期
  • 【分类号】O175.1
  • 【被引频次】2
  • 【下载频次】73
节点文献中: 

本文链接的文献网络图示:

本文的引文网络