Runge-Kutta

盒维数计算和豪斯多夫维数的计算与应用研究程序(box counting)

用于焊接模拟的fluent的双椭球体热源UDF程序。(For welding simulation fluent double ellipsoid heat source UDF program.)

The solver was mdae to solve the teat tansfrer fields with cooling and hot zone. The Gauss-seidial, ADI, Laasonnen, and Crank-Nicolson schemes are present in the code. You can handle the method you want, iteration and the level of tolerance. The code was made at the LINUX platform. Let me know if you need assistance.

说明：  此代码包括牛顿法和梯度下降法的实现过程，最优化以及算法中常见的问题解决方式(This code includes the process of Newton method and gradient descent method)

CS算法OMP该进算法，对傅里叶与 的信号进行稀疏采样(Compressive Sensing OMP)

Echo cancellation using NLMS adaptive filter

3-D 目标MoM源代码 可以求解球体，旋转体等目标的电磁散射问题(MoM )

for counting a bunch of solar cell

计算离散傅里叶变换的一种快速算法，简称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.)

求解O-S方程特征值，可以适用于多种条件下的O-S方程特征值计算(To solving OS Equation characteristic value, can be applied to a variety of conditions OS equation eigenvalue calculation)