登录
首页 » matlab » ENVtoECEF

ENVtoECEF

于 2013-11-14 发布 文件大小:11KB
0 269
下载积分: 1 下载次数: 137

代码说明:

  matlab编程实现从东北天坐标系到地心坐标系的坐标转换,包含了资料文件。调用函数名为:ENVtoECEF,输入参数为东北天原点经纬度数据,东北天坐标点数据;输出数据是东北天坐标系下坐标点对应的经纬高数据。(matlab programming from the northeast sky coordinate system to the geocentric coordinate system conversion, including the data file. Call the function named: ENVtoECEF, input parameters for the origin of latitude and longitude data northeastern days, Northeast day coordinate data output data is northeast days coordinates of latitude and longitude coordinates of points corresponding to the high data.)

文件列表:

ENVtoECEF.m,403,2013-07-11
ENVtoECEF从东北天坐标系到地心坐标系.docx,13079,2013-11-14

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • ITD
    ITD法模态识别,基于自由振动曲线进行的模态识别(modal analysis)
    2010-07-23 08:50:28下载
    积分:1
  • 1.MUSIC-MATLAB
    MUSIC算法MATLAB程序,波束形成陈列信号处理的理论和应用(failed to translate)
    2011-10-31 11:10:29下载
    积分:1
  • matlab-for-coding
    introduce coding using Matlab
    2012-12-02 12:18:10下载
    积分:1
  • CandMatlab
    基于C的Matlab函数功能扩充组合代码(Based on the C to expand the portfolio of Matlab Function code)
    2008-04-02 13:18:03下载
    积分:1
  • ofdm_4
    this is the matlab program of dvb transmission and reception of ofdm signals
    2013-01-09 23:02:10下载
    积分:1
  • Kmeans
    a kmean clustering prog
    2010-05-21 19:17:01下载
    积分:1
  • DigitalImageProcessing-3
    Digital Image Processing Using Matlab Additional Material
    2011-05-27 22:32:16下载
    积分:1
  • xiexueshu-zuiyoukongzhi-
    最优控制工具书,大师级人物解学书经典力作,研究最优控制必备(Optimal control books, school books gurus solution classic masterpiece, essential Optimal Control)
    2014-09-23 20:21:27下载
    积分:1
  • paper_2_registration
    用于图像与图像之间的配准,使得两幅图像能够融合。(image fusion)
    2010-07-22 23:59:56下载
    积分:1
  • maxcost
    “基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法,其基本思路为:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条自V1至Vn的最短路;再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流量增至最大可能值;而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新确定,如此多次迭代,最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
    2010-12-22 17:27:32下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载