-
hope
变步长网格，声波方程，有限差分数值模拟程序，二阶(Variable step mesh, acoustic equation, finite difference numerical simulation program, second order)
- 2016-11-04 14:38:13下载
- 积分：1
-
Algorithm-for-DOA-Location
是一种测向交叉定位算法 通过大量阅读论文获得，可以参考。有兴趣，可以一块讨论(Algorithm for DOA Location)
- 2012-02-12 17:23:12下载
- 积分：1
-
GGSA
改进的万有引力搜索算法的matlab程序，经过测试，100%可以使用的。(gravitational search algorithm matlab program, after testing, 100% can be used.)
- 2018-06-24 17:56:52下载
- 积分：1
-
Burden_solution
数值分析（Burden）第七版的习题解答，中文繁体，找不到简体的，大家凑合看吧(Numerical Analysis (Burden) answers to the seventh edition of the exercises, Chinese Traditional, can not find the simplified)
- 2021-03-09 22:49:27下载
- 积分：1
-
cnn regression
通过卷积神经网络回归进行的图像配准，相比传统的图像配准算法，能更快地获得配准参数，也能更好地减小配准误差(Image registration based on convolution neural network regression can get registration parameters faster and reduce registration error better than traditional image registration algorithm.)
- 2017-12-12 22:22:25下载
- 积分：1
-
single
使用奇异值分解来帮助求解最小二乘问题，特别是在方程系数矩阵不满秩的情况下。(SGELSD computes the minimum-norm solution to a real linear least
* squares problem:
* minimize 2-norm(| b- A*x |)
* using the singular value decomposition (SVD) of A. A is an M-by-N
* matrix which may be rank-deficient.)
- 2009-10-30 16:32:14下载
- 积分：1
-
ca713
信号维数的估计，计算一维光子晶体的透射特性和反射特性，小波包分析提取振动信号中的特征频率。( Signal dimension estimates, Calculated transmission characteristics and reflection characteristics of the one-dimensional photonic crystals, Wavelet packet analysis to extract vibration signal characteristic frequency.)
- 2017-04-19 09:47:37下载
- 积分：1
-
kalman-MATLAB
使用MATLAB编写的卡尔曼滤波源程序，简单易用，输出卡尔曼滤波的最优结果。(Prepared by the use of MATLAB Kalman filter source, easy-to-use, the output of the optimal Kalman filter results.)
- 2008-05-07 10:10:22下载
- 积分：1
-
fgcone
matlab 程序 圆锥拟合 使用最小二乘法(matlab cone fitting procedure using the least squares method)
- 2021-02-22 11:19:41下载
- 积分：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
