-
FEM_onedimpbg
采用有限元离散计算一维声子、光子能带,参数见文件源码内(Calculated using the finite element discrete one-dimensional phonon, photon energy band, within the parameters see document source)
- 2020-10-07 16:17:38下载
- 积分:1
-
FDTD_computational_electromagnetics
很有用的一篇国外关于FDTD算法的学术论文,相信对初学者有很大帮助(Useful in a foreign academic papers on the FDTD method, I believe very helpful for beginners)
- 2010-05-24 23:50:03下载
- 积分:1
-
PID自动控制电机转速
利用pid算法控制电机转速,转速可调,数码管显示,初学者实用(Using PID algorithm to control motor speed, adjustable speed, digital display, beginners practical)
- 2020-06-22 16:00:01下载
- 积分:1
-
GA
说明: 遗传算法用来求解带容量的车辆路径问题,用c++完成的代码(The genetic algorithm is used to solve the vehicle routing problem with capacity. The code is completed by c++.)
- 2019-06-19 16:30:06下载
- 积分:1
-
staggered-grid
实现了声波波动方程有限差分正演模拟,交错网格下,时间2阶空间10阶(Achieve the acoustic wave equation finite difference forward modeling, staggered under the grid, the time second-order space 10 order)
- 2021-04-12 16:38:57下载
- 积分:1
-
《啊哈!算法》
用简单易懂的图文方式阐释算法的奥秘,快速了解每个算法的使用场景、原理(Explain the mysteries of the algorithm with simple and understandable graphics and text, and quickly understand the scene and principle of each algorithm)
- 2017-10-26 19:20:16下载
- 积分:1
-
EKFUKF_1_1
EKF uKF的matlab工具箱,适合做非线性滤波的仿真计算。(EKF uKF the matlab toolbox for nonlinear filter to do the simulation.)
- 2008-07-01 12:25:57下载
- 积分:1
-
ekfslam_v2.0
使用Extended Kalman Filter进行SLAM的新版本代码,主要用于机器人定位和地图自动绘制。(The New Version of SLAM code using Extended Kalman Filter, used in the field of robot localization and map building)
- 2009-02-13 00:09:59下载
- 积分:1
-
CH2CH5CH7
最小二乘法的参数辨识研究。逐个的程序实现了最小二乘法算法以及实现的研究。(Least squares method of parameter identification studies. Procedures achieved by least squares algorithm and realize research.)
- 2008-05-13 22:02:16下载
- 积分: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