-
TMS320LF2407-FFT
基于TMS320LF2407的FFT算法的实现及应用(TMS320LF2407 of the FFT algorithm based on Implementation and Application of)
- 2009-11-27 12:39:04下载
- 积分：1
-
distance
C++程序求两点距离 可以点入坐标点(C++ program distance between two points)
- 2013-01-08 22:03:02下载
- 积分：1
-
MillerRabin()
素性检测的miller-rabin算法。。。。。(Primality testing)
- 2011-11-23 16:56:41下载
- 积分：1
-
cdq.rar
基于时间序列法的超短期电力负荷预测 利用时间序列法进行数学建模(Mathematical modeling based on very short-term power load time series forecasting using time series method)
- 2021-04-29 11:08:43下载
- 积分：1
-
BigNumberPlusMinusMuitiplyDivide
可以实现十几位整数的四则运算，效率也较好(Four operations can be more than a dozen integer,and the efficiency is better)
- 2012-05-10 09:56:55下载
- 积分：1
-
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 the base class, the split-based algorithm has the least amount of computation and structural rules remain in situ calculation and so on.)
- 2013-05-23 19:56:04下载
- 积分：1
-
Wdisp
Wdisp，是基于建造结构计算软件pkpm的结果数据提取文件，方便使用，提取数据后，可用于绘制曲线。(Wdisp, is based on The construction structure calculations software pkpm the results of data extraction files, easy to use, extract data, can be used to draw the curve.)
- 2013-04-08 15:34:48下载
- 积分：1
-
Unconstrained-directly
基于GWBASIC实现的无约束寻优算法，内附GWBASIC主程序和说明(Non-binding on GWBASIC achieve optimization algorithm, the main program and instructions included GWBASIC)
- 2011-09-25 19:18:07下载
- 积分：1
-
na7
Orthogonal Polynomials Approximation
数值分析，计算正交基多项式的系数
(Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance.
Format of function
int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps )
where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial.
Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)
- 2011-11-27 11:47:21下载
- 积分：1
-
zhuangcuo
糊涂先生给他的五个朋友写信，他写了五封信，但是当他的朋友收到信后，都告诉他：“你的信寄错了”。那么请你计算一下：出现这种情况的概率有多少？（假设糊涂先生是随机地往信封里装信的），你能不能把所有的情况都列出来呢(Mr. foolish to write him five friends, he wrote five letters, but when his friend received a letter, told him: )
- 2007-07-12 00:48:29下载
- 积分：1
