搜索资源列表
md
- The program md.f implements a simple molecular dynamics simulation in continuous real space. The velocity Verlet algorithm is used to implement the time stepping. The force and energy computations are performed in parallel, as is the time integration
FFT
- An Elementary Introduction to the Discrete Fourier Transform 1.1 ComplexNumbers 1.3 Analyzing the Series 1.5 Filtering a Signal 1.6 How Often Does One Sample? 1.7 Notes and References 1.2 Trigonometric Interpolation 1.4 Fourier Frequenc
MOPSOwang
- 关于模糊车辆路径问题的多目标粒子群算法，里面有作者提出的实数编码方式，在经典的MOPSO基础上完成的。模糊包括模糊需求、模糊旅行时间和模糊服务时间多重模糊特性。-Fuzzy vehicle routing problem with multi-objective particle swarm algorithm, which has the real number encoding, proposed by the authors in classic MOPSO based on. Fuzzy
fastfour1
- 实数据的快速傅里叶变换fortran程序,我们大多时候都是对是数据做福利叶变换，所以这两个程序比较实用。-Real data fast Fourier transform fortran program, most of the time we are right to do welfare Fourier transform of the data, so these two programs more practical.
WaveletSoftware
- In mathematics, a wavelet series is a representation of a square-integrable (real- or complex-valued) function by a certain orthonormal series generated by a wavelet. Nowadays, wavelet transformation is one of the most popular candidates of the time-
rtkpos
- RTKLIB的定位功能主要为PPP以及相对定位，需要指出的是PPP模式提供模糊度固定功能。RTKLIB的核心函数是rtkpos。不管采用实时还是事后的处理方式，均通过rtkpos函数实现，换句话说，rtkpos为单历元处理函数。-RTKLIB positioning function mainly for the PPP and relative positioning, it should be pointed out that the PPP mode provides fixed degr
RNN-RTRL-train
- 递归神经网络-实时学习训练算法代码，亲测可用，简洁无误，容易上手。- Recursive neural network- real-time learning training algorithm code, pro-test available, simple and correct, easy to use.
fftw-2.1.5.tar
- 用的TI官方给的controlSUITE里面的定点库例程计算实数FFT,板子是helloDSP28335开发板。用TI例程做定点实数FFT时候,256点(With the TI official to the controlSUITE fixed-point library routines to calculate the real number of FFT, the board is helloDSP28335 development board. With TI routines do
fast-fourier-transforms-22.1
- FT是一种FT的高效算法，称为快速傅立叶变换（fast Fourier transform），它根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。(FT is an efficient algorithm for DEFT, called fast U Lie transform (fast Fourier transform). It is obtained by improving the algorithm of discrete U Lie transform