office10help

这是学习分数阶傅里叶变换，必须的算法这是学习分数阶傅里叶变换，必须的算法这是学习分数阶傅里叶变换，必须的算法(the of fragnaii or fft)

PCA算法程序设计步骤： 1、去均值 2、计算协方差矩阵及其特征值和特征向量 3、计算协方差矩阵的特征值大于阈值的个数 4、降序排列特征值 5、去掉较小的特征值 6、去掉较大的特征值(一般没有这一步） 7、合并选择的特征值 8、选择相应的特征值和特征向量 9、计算白化矩阵 10、提取主分量 (PCA algorithm programming steps: 1 to mean 2, calculation of covariance matrix and its eigenvalues and eigenvectors 3, the calculation of covariance matrix eigenvalues greater than the threshold number of 4, in descending order of eigenvalue 5, remove the smaller eigenvalue 6, remove the larger eigenvalue (usually not this step) 7, the combined choice of eigenvalues 8, select the appropriate eigenvalues and eigenvectors 9, computing whitening matrix 10, principal component extraction)

用于计算裂纹的扩展有限元程序，Matlab编写(Extended finite element program used to calculate the crack, Matlab prepared)

根据电磁参数,介电常数实部和虚部，磁导率的实部和虚部，计算反射损耗。(calculating the reflection loss from the electromagnetic parameters)

相变UDF，包括质量传递和热量传递，能够进行气液相变的模拟(Phase transition UDF, including mass transfer and heat transfer, gas-liquid phase transition can be simulated)

一维欧拉方程计算，集合了Lax-Friedrichs，Richtmyer，MacCormack，Steger-Warming，Van Leer，AUSM，Zha-Bilgen，Godunov，Osher，Roe，Rusanov，HLL(HLLE)，HLLL，AUFS方法(One dimensional Euler equation, including Lax-Friedrichs, Richtmyer, MacCormack, Steger-Warming, Van Leer, AUSM, Zha-Bilgen, Godunov, Osher, Ro, Rusanov, HLL(HLLE), HLLL, AUFS)

contourlet变换工具箱，附带贝叶斯阈值去噪(Toolbox contourlet transform, with Bayesian threshold denoising)

ansys二次开发损伤本构关系的详细代码，已经调试成功(ansys damage constitutive secondary development of detailed code, debugging has been successful)

计算fluent相变的udf模型，包括气相到液相，液相到气相的双向传递。(Calculate the udf model of fluent phase transition)

Finding special triples of the form (n, n + 1, n + 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n + 1, n + 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.(Finding special triples of the form (n, n+ 1, n+ 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n+ 1, n+ 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.)