FEMC

FFT/IFFT 变换程序----------------(FFT/IFFT transformation process----------------)

RPCA的求解方法(利用拉格朗日乘子法，进行迭代)(the solution of RPCA called ALM)

一个在fluent udf中使用Compute_Force_and_Moment函数计算力的算例(An Example of Compute_Force_and_Moment Function in Fluent UDF)

这是大地电磁一维正演程序，只要输入电阻率和深度即可正演计算；使用的是卡尼亚视电阻率公式，有关说明已经在文件中说明。(This is a one-dimensional magnetotelluric forward the program, as long as the input resistivity and depth to forward calculation use Carney ATV resistivity formula, and instructions in the file description.)

计算器编程代码，便于需要编程计算器的学员查询相关代码(Calculator programming code, to facilitate students in need of programming calculator related code)

Hypercomplex mathematical morphology

大量数值分析常见算法的源程序 如解方程组 插值等 可以用浏览器打开的HTM文件，内部使用C开发(A large number of numerical analysis algorithms common source such as the solution of equations interpolation can be used to open the browser)

％ 奇异值分解 (sigular value decomposition,SVD) 是另一种正交矩阵分解法；SVD是最可靠的分解法， ％ 但是它比QR 分解法要花上近十倍的计算时间。[U,S,V]=svd(A)，其中U和V代表二个相互正交矩阵， ％ 而S代表一对角矩阵。 和QR分解法相同者， 原矩阵A不必为正方矩阵。 ％ 使用SVD分解法的用途是解最小平方误差法和数据压缩。用svd分解法解线性方程组，在Quke2中就用这个来计算图形信息，性能相当的好。在计算线性方程组时，一些不能分解的矩阵或者严重病态矩阵的线性方程都能很好的得到解( Singular value decomposition (sigular value decomposition, SVD) is another orthogonal matrix decomposition method SVD decomposition is the most reliable method, but it takes more than QR decomposition near ten times the computing time. [U, S, V] = svd (A), in which U and V on behalf of two mutually orthogonal matrix, and the S on behalf of a diagonal matrix. And QR decomposition are the same, the original matrix A is no need for the square matrix. The use of SVD decomposition method are used as a solution of least squares error method and data compression. Using SVD decomposition solution of linear equations, in Quke2 on to use this information to calculate the graphics performance quite good. In the calculation of linear equations, some indecomposable matrix or serious pathological matrix of linear equations can be a very good solution)

为了进一步提高直接序列／跳频（ＤＳ／ＦＨ）扩频系统的抗干扰能力，基于小波包变换结合递归最小二乘算法设计 了一种变换域自适应干扰抑制算法，该算法采用小波包分解定位窄带干扰，递归最小二乘算法抑制窄带干扰。通过蒙特卡 罗仿真分析在增加抗干扰模块后，ＤＳ／ＦＨ系统工作在准静态时，在不同信噪比条件下抗窄带干扰性能。仿真结果表明：该 算法具有较强的自适应性以及抗窄带干扰能力，其性能优于传统的直接置零法，适用于多音干扰下的恶劣通信环境。(In order to further improve the anti-jamming capability of direct sequence/frequency-hopping spread spectrum system (DS/FH), based on wavelet packet transform combined with recursive least squares algorithm design a transform domain adaptive interference suppression algorithm, the algorithm uses wavelet packet decomposition positioning narrowband interference, narrowband interference suppression recursive least squares algorithm. By Monte Carlo simulation analysis to increase the anti-jamming module DS/FH system work in the quasi-static, in different SNR anti narrowband interference performance. Simulation results show that: the algorithm has strong adaptability and resistance to narrowband interference ability, its performance is superior to the traditional method of direct zero, poor communication environment suitable for multi-tone interference.)

用传输矩阵法计算光栅场，寻找bloch 模(use of the transfer matrix method grating market, find bloch Die)