弹道导弹基本诸元的快速装订算法研究
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:


The Research of Efficient Method for Computing Basic Firing Data of Ballistic Missiles
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    应用牛顿迭代法实现了弹道导弹基本诸元的快速装订。推导了根据落点偏差求飞行程序角和发射方位角的牛顿迭代公式, 设计了迭代算法, 并给出了实际算例。考虑到迭代算法收敛速度与所给的迭代初值有一定的关系, 提出了预先准备简易射表采用反插值算法为牛顿迭代法准备初值的方法, 经计算表明可以大大减少迭代次数, 从而实现标准弹道的快速设计。

    Abstract:

    This paper applies Newton iterative method to computing basic firing data of ballistic missiles efficiently. In this paper, Newton iterative formula based on deviations of dropping point is deduced and the iterative program is designed, an example is given. Considering the relationship between the convergent speed of the iterative method and the initial value of parameters, the paper brings forward a method, which provides good initial values of parameters by using a reverse interpolation method based on prepared firing tables. The actual practice indicates that the method accelerates iteration rapidly. It is possible to design a standard trajectory of ballistic missiles quickly by using the method presented in this paper.

    参考文献
    相似文献
    引证文献
引用本文

王海丽,陈磊,胡小平.弹道导弹基本诸元的快速装订算法研究[J].国防科技大学学报,1999,21(2):5-8.
Wang Haili, Chen Lei, Hu Xiaoping. The Research of Efficient Method for Computing Basic Firing Data of Ballistic Missiles[J]. Journal of National University of Defense Technology,1999,21(2):5-8.

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:1998-06-21
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2013-11-18
  • 出版日期:
文章二维码