-
速度规划
在轨迹给定长度范围内,各个waypoint给定确定的速度范围约束,规划处平滑的速度变化曲线(Within the given length range of the trajectory, each waypoint is given a determined velocity range constraint and a smooth velocity variation curve at the planning point)
- 2017-07-09 11:51:42下载
- 积分:1
-
Gauss-Hermite
国外比较好用的高斯-厄米特数值积分源代码(the code of gauss-hermite )
- 2021-04-01 17:49:08下载
- 积分:1
-
Outside-the-penalty-function-method
外点罚函数方法,可以用来求解约束优化问题,也可以用来被调用在智能算法中(Point outside the penalty function can be used for solving constrained optimization problems, can also be used in intelligent algorithm called)
- 2011-10-16 19:13:57下载
- 积分:1
-
vpm
二维涡流位置及流场分布计算程序,Vortex Panel Method (Two-dimensional eddy current distribution of the location and flow field calculation program, Vortex Panel Method)
- 2007-12-07 11:06:04下载
- 积分:1
-
cubef
一个挺好用的源程序打包器,北京联高软件公司的,fortran代码转换成chm文档。(A useful tool for converting fortran source files to chm document.)
- 2011-09-26 19:26:13下载
- 积分:1
-
1
说明: 一维黎曼问题,一维问题,即激波管问题,是一个典型的一维可压缩无黏气体动力学问题,并有 解析解。对它采用二阶精度两步差分格式进行数值求解。(Riemann problem, One dimensional problem, the shock tube problem, is a typical one-dimensional compressible non viscous gas dynamic problem with analytic solutions. It is solved numerically by two order two step difference scheme.)
- 2018-04-29 14:56:36下载
- 积分:1
-
gsl1.8
GNU Scientific Library (GSL) 是一个用于科学计算的 C 语言类库。有超过1000个函数。
(GNU Scientific Library (GSL) is a C language library for scientific computing. There are more than 1000 functions.)
- 2013-04-23 10:51:50下载
- 积分:1
-
AR
说明: 使用时间序列分析AR方法对油价进行分析,以及预测。采用BIC准则进行判阶,最小二乘法进行参数估计(AR time series analysis using the method of price analysis and forecasting. BIC criteria used sentence order, the least square method for parameter estimation)
- 2009-06-08 09:19:56下载
- 积分:1
-
Computational-Science-codes
开发环境没有可选项,fortran90,Fortran_90_and_Computational_Science-_codes(Computational Science codes by fortran90
)
- 2013-10-10 17:07:12下载
- 积分: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