-
mxuliedejisuanjichengcheng
伪随机序列(N=4的M序列)的C语言编程实现,可以应用于相关分析法和最小二乘辨识的输入信号。(Pseudo-random sequence (N = 4 M-sequence) of the C programming language, can be used in correlation analysis and least squares identification of the input signal.)
- 2009-04-09 10:25:13下载
- 积分:1
-
PRP
说明: PRP共轭梯度法优化计算,采用FORTRAN语言(PRP conjugate gradient method optimization, the use of FORTRAN language)
- 2011-03-28 15:23:27下载
- 积分:1
-
FE_STructure
根据分好的单元,进行有限元分析。计算每个单元中四个高斯点的应力,应变,主应力以及位移。(According to sub-good unit, finite element analysis. Calculated for each unit in the four Gauss point stress, strain, principal stresses and displacements.)
- 2020-09-01 11:18:09下载
- 积分:1
-
Window_moving_iteration
重力勘探多次滑动平均方法。给出地址参数,建立网格模型,按网格进行滑动平均。得到平滑后的重力数据。可以去噪。(gravity window moving iteration)
- 2011-12-15 23:03:58下载
- 积分:1
-
half
计算半方差,如果按克里金法计算插值要求计算半方差,用此程序可实现。(Calculation of semi-variance, if the Kriging interpolation method call for the calculation of semi-variance, using this procedure can be realized.)
- 2008-05-15 13:48:06下载
- 积分:1
-
Romberg
数值分析,即计算方法课程中的龙贝格算法源代码。(Numerical analysis, calculation of the Romberg algorithm source code in the methods courses.)
- 2012-05-30 22:54:48下载
- 积分:1
-
newspring
粘弹性人工边界的实现,在abaqus中快速施加粘弹性人工边界(Realization of viscoelastic artificial boundary, imposed by rapid visco-elastic artificial boundary in abaqus)
- 2020-12-16 20:19:12下载
- 积分:1
-
fft13
fft code in visual c++
- 2011-07-16 22:23:05下载
- 积分: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
-
a.c
Finding special triples of the form (n, n + 1, n + 2)
Write a program that finds all triples of consecutive positive three-digit integers each of which is
the sum of two squares, that is, all triples of the form (n, n + 1, n + 2) such that:
• n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999
• eachofn,n+1andn+2isoftheforma2+b2.(Finding special triples of the form (n, n+ 1, n+ 2)
Write a program that finds all triples of consecutive positive three-digit integers each of which is
the sum of two squares, that is, all triples of the form (n, n+ 1, n+ 2) such that:
• n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999
• eachofn,n+1andn+2isoftheforma2+b2.)
- 2012-04-26 15:05:05下载
- 积分:1