-
curthr1
完成地震数据的curvelet阈值重构功能算法简洁注释详细(Completion of seismic data the curvelet threshold reconstruction algorithm is simple function comment in detail)
- 2013-05-08 16:44:51下载
- 积分：1
-
FCTVOFMain
FCTVOF的主程序,其中FCTVOF是求解关于VOF值的运输方程的一种经典算法，可求出各时刻的各网格的VOF值，从而利用界面重构技术实现界面的重构。(FCTVOF main program, including FCTVOF is for solving the transport equation of VOF value a classic algorithm, can calculate the VOF value of each moment of each grid, so as to make use of the interface to refactor the technical implementation interface.
)
- 2021-01-19 22:08:42下载
- 积分：1
-
leaveoneout_lssvm
用于最小二乘支持向量机的名为"留一法",可用于支持向量机超参数的确定.(for least squares support vector machine called "a stay", could be used to support vector machine-determined parameters.)
- 2007-03-04 13:31:21下载
- 积分：1
-
test_read_file
实现了对文档的数据读入，实现了文档的数据读入(The realization of the document data read into, The realization of the document data read into, )
- 2013-08-14 02:15:23下载
- 积分：1
-
AIA
基于最小二乘法求解相移量算法，最小二乘求相移图相位(phase shift algorithm based on the least squares method, least squares seeking phase shift diagram phase)
- 2013-04-08 18:38:11下载
- 积分：1
-
crackprop_modeI_lefm_xfem_cpe4
crackprop_modeI_lefm_xfem_cpe4，ABAQUS基于线弹性断裂力学的扩展有限元法实例。(crackprop_modeI_lefm_xfem_cpe4 ABAQUS based on linear elastic fracture mechanics extended finite element method instance.)
- 2021-04-08 17:19:00下载
- 积分：1
-
shuang-tuo-qiu-re-yuan
fluent软件的UDF程序，是焊接过程的热源，热源类型为双椭球空间热源。(fluent udf heat source)
- 2020-10-13 00:07:32下载
- 积分：1
-
fft
说明： 用DFT 函数计算电压u, 电流i的基波(f1=50 Hz)的有效值和相位;
用FFT函数分别计算电压u和电流i 所包含的直流,基波和谐波的有效值和初相角;
可计算基波(f1=50 Hz)和各次谐波的功率p和功率因数con?.(The effective value and phase of fundamental wave (f1 = 50 Hz) of voltage U and current I are calculated by DFT function.
The effective values and initial phase angles of DC, fundamental and harmonic waves contained in voltage U and current I are calculated by FFT function, respectively.
The power P and power factor con of fundamental wave (f1 = 50 Hz) and harmonics can be calculated.)
- 2019-03-28 15:48:19下载
- 积分：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
-
FEM
有限元平面应力问题计算，总体刚度矩阵矩阵压缩存储，LU分解求解(Plane stress finite element calculation, the overall stiffness matrix of compressed storage matrix, LU decomposition Solving)
- 2021-01-26 21:28:41下载
- 积分：1
