fft

计算水声传播的快速场程序，使用了有限元方法，计算速度快，精度高。(underwater acoustic propagation Fast Field Program, using Finte Element Method,fast and accurate.)

它是一个计算热通量的c++程序，用udf导入fluent，既可以求解，非常好用的一个，可以作为入门的一个例子学习。(it is a calculated heat flux of c++ program, with udf into fluent, not only can solve, very easy to use one, can be used as a case study entry.)

等几何分析MATLAB程序包,有着丰富的例子,其中fem包内为传统的拉格朗日插值有限元, iga包内为nurbs插值的等几何有限元(This is the README file for the Isogeometric Analysis (IGA) Matlab code. The code supports one, two and three dimensional linear elasticity problems. Extended IGA for hole, inclusion and crack modelling is also implemented.)

改进的极限学习机算法，具有更好的预测性能和稳定性(Improved limit learning machine algorithm)

快速排序法和堆排序法Fortran90程序，其中快速排序法使用到了递归过程，因此对于堆栈要求较高(both Quicksort and Heapsort program are used for sort array. Note that a recursion process is used in Quicksort program, Thus it need require a relative high stack size.)

分支界限费用矩阵的说明文档，非常实用,建议下载哦(Branch line cost matrix documentation, very practical, it is recommended to download Oh)

惩罚函数法C语言相关程序 它将有约束最优化问题转化为求解无约束最优化问题：其中M为足够大的正数， 起"惩罚"作用， 称之为罚因子，F(x, M )称为罚函数。(Penalty Function Method C language-related program it would have constrained optimization problem is transformed into solving unconstrained optimization problem: where M is a sufficiently large positive number, from the " punishment" effect, called the penalty factor, F (x, M) called the penalty function.)

说明：  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.)

说明：  abaqus vumat 子程序入门 UMAT FOR ABAQUS/STANDARD INCORPORATING ELASTIC BEHAVIOUR FOR PLANE STRAIN AND AXI-SYMMETRIC ELEMENTS.(introduction to abaqus vumat subroutine)

一个基于matalb和fortran的大地电磁2维正演模拟程序(A program in MATLAB and FORTRAN for two-dimensional magnetotelluric inversion)