MK

压缩包中包含五个CFD基础程序，其中MacCormack1DSolveRiemann.for是一维欧拉方程求解（黎曼问题），UpwindTVD_1D.for是一维可压粘性N-S方程求解，MAC-Chorin2D.for是利用MAC算法和Chorin压力迭代解法求解 二维不可压缩黏性平板间Poisuille流动问题，Lax-Webdroff2D.for是利用Lax-Webdroff差分格式求解二维平面激波反射问题，fvm_upwind_MAC_couette.for是以一阶迎风型离散格式和Chorin压力迭代求解couette二维流动问题。(CFD compression package contains five basic program, which is an Euler equation solving MacCormack1DSolveRiemann.for (Riemann problem), UpwindTVD_1D.for is one-dimensional compressible viscous NS equation solving, MAC-Chorin2D.for is the use of algorithms and MAC Chorin pressure iterative solution for solving the two-dimensional incompressible flow problems between viscous flat Poisuille, Lax-Webdroff2D.for using Lax-Webdroff difference scheme for solving the two-dimensional plane shock wave reflection problem, fvm_upwind_MAC_couette.for based on first order upwind scheme and Discrete Chorin pressure couette iterative solution of two-dimensional flows.)

多机电力系统仿真及其潮流计算，图像的光流法计算的matlab程序,与理论分析结果相比。( Multi-machine power system simulation and flow calculation, Image optical flow calculation matlab program, Compared with the results of theoretical analysis.)

储层产能预测文献，对于研究利用测井进行产能预测有帮助！(Prediction of Specific Productivity Index for Sihapas Formation in Uncored Wells of Minas Field Using Limited Available Core and Log Data)

一个用FTT法实现相关函数的快速估计程序(A correlation function with the FTT method to achieve the rapid estimation procedures)

用于处理电力系统中含有4个节点的随机潮流计算(Four nodes to deal with the random flow calculation)

为了进一步提高直接序列／跳频（ＤＳ／ＦＨ）扩频系统的抗干扰能力，基于小波包变换结合递归最小二乘算法设计 了一种变换域自适应干扰抑制算法，该算法采用小波包分解定位窄带干扰，递归最小二乘算法抑制窄带干扰。通过蒙特卡 罗仿真分析在增加抗干扰模块后，ＤＳ／ＦＨ系统工作在准静态时，在不同信噪比条件下抗窄带干扰性能。仿真结果表明：该 算法具有较强的自适应性以及抗窄带干扰能力，其性能优于传统的直接置零法，适用于多音干扰下的恶劣通信环境。(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.)

共轭梯度法（Conjugate Gradient）是介于最速下降法与牛顿法之间的一个方法，它仅需利用一阶导数信息，但克服了最速下降法收敛慢的缺点，又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点，共轭梯度法不仅是解决大型线性方程组最有用的方法之一，也是解大型非线性最优化最有效的算法之一(Conjugate gradient method (Conjugate Gradient) is between the steepest descent method and Newton' s method between a method that takes only a first derivative information, but to overcome the slow convergence of the steepest descent method shortcomings, but also avoid the need to store Newton and computing the inverse Hesse matrix and disadvantages, conjugate gradient method is not only to solve large linear equations of the most useful methods, large-scale nonlinear optimization solution is the most efficient algorithms)

说明：  Description 设a[0…n-1]是一个包含n个数的数组，若在ia[j]，则称(i, j)为a数组的一个逆序对（inversion）。 比如 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。 一个n个元素序列的逆序对个数由三部分构成： （1）它的左半部分逆序对的个数，（2）加上右半部分逆序对的个数，（3）再加上左半部分元素大于右半部分元素的数量。 其中前两部分（1）和（2）由递归来实现。要保证算法最后效率O(nlogn)，第三部分（3）应该如何实现？ 此题请勿采用O(n^2)的简单枚举算法来实现。 并思考如下问题： （1）怎样的数组含有最多的逆序对？最多的又是多少个呢？ （2）插入排序的运行时间和数组中逆序对的个数有关系吗？什么关系？ 输入格式 第一行：n，表示接下来要输入n个元素，n不超过10000。 第二行：n个元素序列。 输出格式 逆序对的个数。 输入样例 5 2 3 8 6 1 输出样例 5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array. For example, has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency. The number of inverse pairs of a sequence of n elements consists of three parts: (1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half. The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented? Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)

一篇论文，对研究转子动力学初学者有参考价值，题目为叶片振动影响下双盘转子-轴承系统的稳定性与分岔。(Paper, the study of rotor dynamics beginners reference value, titled double-disc rotor blade vibration under the influence- bearing system stability and bifurcation.)

使用ABAQUS软件进行过渡网格划分，帮助用户建立良好的过渡网格的小工具(use the ABAQUS to divide the transition gridding)