-
UDF-sa
FLUENT里面改进的SA湍流模型，为UDF文件，可以进行链接编译计算(FLUENT which improved SA turbulence model for the UDF file can be compiled to calculate the link)
- 2021-01-02 15:18:57下载
- 积分：1
-
牛顿迭代法求解非线性方程组
说明： 使用牛顿迭代法求解非线性方程组，程序简单易懂，初学者都能看明白。(Newton iterative method is used to solve the nonlinear equations. The program is simple and easy to understand for beginners.)
- 2020-06-02 23:22:49下载
- 积分：1
-
Biot-Savat
根据物理学的毕奥-萨法尔定理，计算环形线圈周围电磁场的强度。。(According to physics, Biot- Safar theorem, calculate the intensity of electromagnetic field around the circular coil. .)
- 2010-10-01 19:00:18下载
- 积分：1
-
Program33_waveguide
二维脊形光波导的FDTD仿真，能轻易修改波导尺寸和波导介质，，对硅等高折射率的波导求解正确(fdtd simulation of optical waveguide)
- 2020-09-30 20:37:43下载
- 积分：1
-
Parallel-inverse-solution
并联机构 正反解 六自由度并联机构空间运动结算 实例分析(DOF parallel mechanism inverse solution space motion parallel mechanism settled case analysis)
- 2021-03-20 11:59:18下载
- 积分：1
-
fdtd_2D_TE_PML
fdtd的2d算法，pml边界条件，二维TE波(fdtd the 2d algorithm, pml boundary conditions, 2D TE wave)
- 2007-02-02 16:43:27下载
- 积分：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
-
lapack_3.3.0_win_wpzhao
一本介绍fortran语言的不错的书籍，希望你喜欢，版权归属原作者，仅供学习交流(A good book for learning Fortran language, if you read it carefully, you will get what you want.)
- 2012-04-06 17:24:43下载
- 积分：1
-
Window_moving_iteration
重力勘探多次滑动平均方法。给出地址参数，建立网格模型，按网格进行滑动平均。得到平滑后的重力数据。可以去噪。(gravity window moving iteration)
- 2011-12-15 23:03:58下载
- 积分：1
-
毕设程序
滚动轴承信号的保罗谱分析，hilbert Teager能量算子，信号平方，信号取绝对值等等方法求信号包络谱(hilbert transmission)
- 2018-10-26 18:33:28下载
- 积分：1
