fftbianhuan

西安交大陶老师经典SIMPLER算法程序，Fortran编写，对学习CFD很有帮助！(Tao, Xi' an Jiaotong University Teachers classic SIMPLER algorithm program, Fortran write, to learn CFD helpful!)

计算流体力学;高精度7阶二维weno格式;矢通量分裂方法(Vector flux splitting in 7 order two dimensional WENO scheme)

支持向量机和BP神经网络都可以用来做非线性回归拟合，但它们的原理是不相同的，支持向量机基于结构风险最小化理论，普遍认为其泛化能力要比神经网络的强。大量仿真证实，支持向量机的泛化能力强于BP网络，而且能避免神经网络的固有缺陷——训练结果不稳定。本源码可以用于线性回归、非线性回归、非线性函数拟合、数据建模、预测、分类等多种应用场合(Support vector machines and BP neural network can be used for non-linear regression fit, but they is not the same principle, support vector machine based on structural risk minimization theory, generally considered its generalization ability than the neural network of strong . Inherent defect- a large number of simulation confirmed that generalization ability of support vector machine is stronger than the BP network, but also to avoid neural network training results unstable. The source code can be used for linear regression, nonlinear regression, nonlinear function fitting a variety of applications, data modeling, forecasting, classification)

说明：  使用有限体积法求解naca0012流场，欧拉方程(Using finite volume method to solve NACA0012 flow field, Euler equation)

LS_SVM 偏最小二乘结合支持向量机(The LS SVM partial least squares and Support Vector Machine)

最小二乘法回报潮汐水位，根据dooson数回报潮汐，并计算调和常数，余水位，高潮和低潮的数值。(Least squares method returns tide level, tidal according dooson return number, and calculate the harmonic constants, values ​ ​ more than the water level, high tide and low tide.)

大名鼎鼎的J.A.Stratton版电磁理论（中文版），书中有关电磁理论方面的内容是很有指导性的，属于经典书籍。(Famous J.A.Stratton version of electromagnetic theory (Chinese version), the book content of the electromagnetic theory is very instructive, are classic books.)

maple学习资料，以后学习maple就不用担心了(maple learning materials)

有限元热计算的算例，做有限元热分析的朋友比较有用(Finite element calculation of hot example, to do finite element analysis of hot Friend more useful)

常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) (Commonly used algorithm design strategies (including the strategy of divide and conquer, dynamic programming, greedy strategy, backtracking method, random algorithm) algorithm complexity analysis (number of iterations, using a recursive equation, frequency analysis, etc.))