资源列表
matrix
- visual c++矩阵计算库，visual c++矩阵计算库-visual c++ matrix calculation library, visual c++ matrix computation libraries
PCA
- 多元统计分析中经典的主成分分析法的源程序，通过实例验证-Classical multivariate statistical analysis principal component analysis of the source, verified by an example
The-optimal-loading
- 使用c++来实现最优装载，要求输入货物数和货物重量-Use c++ to achieve optimal loading, asked to enter the number of goods and cargo weight
XYLAlgorithm
- 采用匈牙利算法求解将N个任务分配给N个人，没人均有且仅有一个任务的指派问题-Hungarian algorithm using the task assigned to the N N individuals, not per capita has one and only one task assignment problem
ModeAlgorithm
- 在O(n)的时间内求解出给定的一组数据的众数-In O (n) time solved a given set of data of the plural
HalfSetAlgorithm
- 利用备忘录策略，采用递归分治方法实现求解半数集问题-Use memo strategies, using recursive divide and conquer method to solve half the problem set
compound
- 文件汇集了三种复化求积公式的程序，柯特斯公式，复化辛普森等-Document brings together three complex procedures of quadrature formulas, Cotes formulas, rehabilitation of Simpson
Gauss-Legendre
- 数值分析算法，拉格朗日插值与函数逼近，已运行成功-Numerical analysis algorithms, Lagrange interpolation and function approximation, has been running successfully
FFTaIFFT
- 计算复序列的快速傅里叶变换FFT和快速傅里叶反变换IFFT-Calculating complex sequence FFT fast Fourier transform and inverse fast Fourier transform IFFT
FFT4
- 计算按频率抽取的基4快速傅里叶变换算法，与基2FFT相比，基4FFT的乘法量约减少25 。-Calculating frequency taken by fast Fourier transform algorithm base 4, compared with the base 2FFT the base 4FFT multiplication about 25 less.
srfft
- 计算复序列的分裂基快速傅里叶变换，分裂基快速算法是将基2和基4分解组合而成。在基2M类快速算法中，分裂基算法具有最少的运算量，且仍保留结构规则、原位计算等优点。-Calculate complex sequence of split radix fast Fourier transform, fast algorithm is to split the base base 2 and base 4 decomposition combination. 2M fast algorithm in t
r2fft
- 用一个N点复序列的FFT同时计算两个N点实序列离散傅里叶变换-With an N-point complex sequence of N-point FFT calculate two real sequences discrete Fourier transform