Random-Forest-master

计算一般的mie散射光强等参数的精确程序，得到muller矩阵的各个元素表达式(scattering of Mie)

基于Levenberg-Marquardt的曲线/面拟合(C library for Levenberg-Marquardt least-squares minimization and curve fitting)

C++编写“三维粱单元有限元计算内核”，对杆系有限元的理论和C++的理解有了很大提高(C++ written " three-dimensional beam finite element kernel module" , and on finite element theory and the understanding of C++ has been greatly improved)

说明：  在matlab环境下能进行各种曲线拟合的算法，非常好。(In the matlab environment to conduct various kinds of curve fitting algorithms, very good.)

一个采用FLUENT计算气体-液体两相流的算例，附件文件可以直接用FLUENT打开，并附带了计算结果截图。(FLUENT is calculated using a gas- liquid two-phase study, attachment files can be opened directly by FLUENT, and the calculation results with the screenshot.)

这个程序分别用二分法，Newton法，弦截法，Newton下山法等算法求解非线性方程(this procedure were used dichotomy, Newton, String interception, Newton downhill law for solving nonlinear equations)

适用于ABAQUS的自定义材料子程序，适用于显式分析的J2等向强化模型。(ABAQUS apply to the self-defined material subroutine suitable for explicit analysis J2 model to strengthen.)

unit commitment with Gams

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

计算机常用数值算法与程序(C++版) (Commonly used numerical algorithm of computer and program )