program

计算岩石表面裂隙宽度并求取其表面粗糙度系数(Calculate the rock surface crack width and strike the surface roughness coefficient)

EDFA的掺铒光纤长度模拟计算，附3篇相关论文，330mw的980nm泵泵浦，3db的泵浦吸收，12m最佳长度已经的到验证，可作为EDFA设计参考 (EDFA erbium-doped fiber length simulation of three related papers, 330mw of 980nm pump pump pump 3db absorption 12m optimum length has been to verify, can be used as the EDFA design reference)

Orthogonal Polynomials Approximation 数值分析，计算正交基多项式的系数 (Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance. Format of function int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps ) where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial. Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)

用于拓展fluent磨损模型的UDF，采用tabakoff经验公式描述磨损量。(a udf to optimize erosion model in Fluent)

很好很实用的信号处理程序。适合学习和科研参考使用。(Very good very useful signal processing. Suitable for learning and scientific research use and reference.)

其基本思想是取B样条函数 为及基函数，在[a,b]中均匀划分区间，xi=a+ih,h=(b-a)/n,由于三次样条函数空间是n+3维的，所以把分点扩充到x-1,xn+1,则任意三次样条函数可用 线性组合来表示：(The basic idea is to take B-spline function and basis functions in [a, b] in the evenly divided intervals, xi = a+ ih, h = (ba)/n, because the cubic spline function is n+3 dimensional space , so the expansion points to the x-1, xn+1, then any cubic spline function can be expressed as a linear combination:)

说明：  Optics聚类算法 OPTICS没有显示地产生一个数据集合簇，它为自动和交互地聚类分析计算一个簇次序。这个次序代表了数据基于密度地聚类结构。它包含地信息，等同于从一个宽广地参数设置范围所获得的基于密度的聚类(Optics do not show clustering algorithm OPTICS to produce a collection of data clusters, it is automatically and interactively computing cluster analysis a cluster order. This order represents the data to cluster based on the density structure. It contains in information from a broadly equivalent range of parameters obtained by density-based clustering)

三次样条曲线拟合代码，先训练，后差值，计算非常准确(Three times spline curve fitting, the first training, and after, computation is very accurate)

本程序包括：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.)

四阶龙格库塔法函数更新四元数程序代码,采用VC编写(Fourth-order Runge-Kutta method function is updated quaternion code)