zoeppritz

matlab编写的流体计算和传热程序(很不错的哦)(matlab prepared and heat transfer fluid calculation procedures)

关于神经网络控制，数据模型归一化，模态振动，多目标跟踪的粒子滤波器。( On neural network control, Normalized data model, modal vibration, Multi-target tracking particle filter.)

feap 有限元程序，国外某大学的开源程序(feap finite element program)

这个程序是关于轴承刚度方程的MATLAB程序(This program is about the bearing stiffness equation MATLAB program)

用VBA在Excel里实现分级计算，实现通过年终奖和月收入计算个人所得税的功能。数据为2012年最新的标准，对于会计电算化人员有非常强的实用性。(VBA in Excel to achieve grade calculated to achieve the functionality of the calculation of personal income tax through the end of the year Award and the monthly income. The data for 2012 the latest standards, computerized accounting personnel have a very strong practicability.)

C-N解偏微分方程的程序。解的是定步长的抛物型偏微分方程： du/dx - a * d2u/dx2 = 0 在程序中可以更改 a 的值以实现不同系数的解。在循环中改变 a 的值以实现变系数. 该说明在压缩包是也有(CN solution of partial differential equations procedures. Solution is scheduled to step parabolic partial differential equation: du/dx- a* d2u/dx2 = 0 in the procedure can be changed in order to realize the value of a different coefficient of the solution. Change in the cycle in order to realize the value of a variable coefficient. The note in the compressed packet is also)

地球科学（Fortran90）: 计算空间重力异常、扰动重力、垂线偏差或重力梯度的垂向梯度。 计算方式：数值积分、二维平面FFT、二维球面FFT或一维FFT。(Earth Science (Fortran90): calculate the gravity anomaly, gravity disturbance, the deflection of the vertical or gravity gradient vertical gradient. Calculation: numerical integration, FFT of the two-dimensional plane, two-dimensional spherical FFT or one-dimensional FFT.)

c语言程序编写在经验模态分解，包含三次样条(c language programming in the empirical mode decomposition, contains the cubic spline)

C语言版,机载SAR回波仿真程序，附有FFT和复数库，以及位图显示模块。本程序注释详解，对加深SAR的理解有很好的帮助(C language version, airborne SAR echo simulation program with FFT and complex database, as well as bitmap display module. Detailed notes of this procedure, for deepening the understanding of SAR has a good assist)

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