Parallel-inverse-solution

本程序包括：DFT（离散傅里叶变换），FFT（快速傅里叶变换），IFFT（快速傅里叶逆变换），conv（卷积：圆周卷积、线性卷积），主要应用于信号处理，既可以对实序列做上述操作，也可以对复序列。(This process includes: DFT (Discrete Fourier Transform), FFT (fast Fourier transform), IFFT (inverse fast Fourier transform), conv (convolution: circular convolution, linear convolution), mainly used signal processing, either on the actual sequence to do the operation, can also be complex sequence.)

通过FORTRAN编写damage子程序，在板材成形中实现破裂的可视化及成形极限预测(FORTRAN subroutine written by damage to achieve rupture of visualization in sheet metal forming and forming limit prediction)

程序提示用户输入两个数,然后它将输出这两个数字的和、差、积、商、以及余数，分十进制和十六进制两种格式 (The program prompts the user to enter two numbers, then it will be the output of these two numbers and difference, product, quotient, and the remainder, and decimal and hexadecimal two formats)

美国汪利宏的蒙特卡洛及卷积模拟程序，可以模拟top-hat光束和高斯光束在生物组织中的传输(U.S. WANG Li-hong of the Monte Carlo and convolution simulation program can simulate the top-hat beam and Gaussian beam transport in tissue)

EFIE-电场积分方程的详细推倒过程，对于初步学习电磁场的人很有用。(Electric field integral equation EFIE-down process in detail, the electromagnetic field for the preliminary study were very useful.)

这个程序用来计算四阶累计量，程序中有详细说明(This procedure used to calculate the fourth-order cumulant, the program in detail)

牛顿法计算方程，能计算非线性方程/方程程组，有需要的能试试，主要是数学方法的实现 (Newton method to calculate the equation to calculate the nonlinear equation/equation of equations, needs to try, mainly the implementation of the mathematical methods)

windsat卫星风场数据读写操作及说明(windsat reader)

用于matlab环境下的支持向量机svm的工具箱，做这方面的朋友很需要哦(Matlab environment for support vector machine SVM Toolbox, make this area really need a friend Oh)

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