登录
首页 » C++ » EXERCISE_3_2

EXERCISE_3_2

于 2020-11-11 发布 文件大小:2KB
0 196
下载积分: 1 下载次数: 1

代码说明:

  比较JPLDE405的切比雪夫系数导出的位置与低精度月球坐标分析。(Comparative Analysis of JPL DE405 cut Chebyshev coefficients derived position with low accuracy lunar coordinates.)

文件列表:

EXERCISE_3_2.CPP,5921,2001-09-02

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

发表评论

0 个回复

  • Fortran_3D_FDTD
    说明:  三维FDTD程序,一个Fortran写的三维FDTD程序(Three-dimensional FDTD procedure, a Fortran program written by three-dimensional FDTD)
    2021-04-09 11:19:00下载
    积分:1
  • JDJSQ
    这是一个最最简单计算器,提供给大家参考一下(dadasddasdasd fafdsafasfafad)
    2012-03-16 15:48:54下载
    积分:1
  • lijisuan
    这是几篇关于粒计算在故障诊断中的应用,对学习粒计算的应用很有帮助。(This is a few on Granular Computing in Fault Diagnosis of learning the application of granular computing helpful.)
    2013-09-11 18:03:25下载
    积分:1
  • Curve-and-Surface--
    详细介绍了移动最小二乘法的原理 应用和特点 并且给最后给出了曲线拟合和空间散 出了使用移动最小二乘法进行曲线曲面拟合的程序设计流程(Moving least squares method described in detail the principles and characteristics of the application and to give the final curve fitting and shed space using moving least squares method curve and surface fitting procedure design process)
    2020-11-06 08:49:49下载
    积分:1
  • bode
    关于FFT和bode图的相关分析和再saber中的实现程序。。关于FFT和bode图的相关分析和再saber中的实现程序。。关于FFT和bode图的相关分析和再saber中的实现程序。。(On the FFT and Bode diagram of the relevant analysis and re saber in the implementation process.)
    2020-06-29 12:20:01下载
    积分:1
  • SMM
    说明:  几种模幂算法,有传统模幂,SMM模幂,基于2的K次方的模幂和最一般的模幂算法,还有为这些模幂算法建立的WINDOWS对话框。可以方便的运行。(algorithm, the traditional mode power, SMM Modular Power, Based on two of the K-th power module and the most common mode power algorithm, These modules also for the establishment of the algorithm Power Windows dialog box. To facilitate the operation.)
    2006-04-27 22:49:38下载
    积分:1
  • fft
    用C++编写的一维和二维快速傅里叶变换程序(Prepared with C++ one-dimensional and two-dimensional fast Fourier transform procedure)
    2013-11-04 16:19:50下载
    积分:1
  • KFFT
    计算离散傅里叶变换的一种快速算法,简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少,特别是被变换的抽样点数N越多,FFT算法计算量的节省就越显著。(A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.)
    2013-12-18 22:32:50下载
    积分:1
  • MATLABcode
    基于RWG基函数的矩量法分析偶极子天线的辐射特性,全部程序每行本人都有详细注释,清晰容易理解,出来的结果与理论分析完全一致。(RWG basis function method of moments-based analysis of the dipole antenna radiation characteristics, all the procedures every line I have detailed notes, clear and easy to understand, exactly the same out of the results with the theoretical analysis.)
    2020-12-10 11:09:18下载
    积分:1
  • chan
    二维情况的chan定位算法,1994年原版论文代码实现,可以支持远近和linear nonlinear四种模式(2 dimension chan algorithm, TDOA localization. Including near, far field and linear nonlinear sensor array)
    2017-12-27 13:37:47下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载