fitting

计算电磁学有限元法全美经典教材，金建铭编著英文版(FEM computational electromagnetics American classic textbook, Jin Jianming edited English)

随机数生成程序，该随机数呈zipf分布，就是大家常说对于内容的访问遵循80/20原则，也就是20 的内容，会占有80 的访问量。(Random number generator, the zipf was distributed random numbers, that is, we often say that the access to the content to follow the 80/20 principle, which is 20 of the content will occupy 80 of visits.)

说明：  经典圆柱绕流算例，基于palabos开源软件，计算结果非常好(cylinder flow with palabos)

A finite element fortran code for 2-D truss

说明：  Matrix multiplication explained in detail for C++

Description 设a[0…n-1]是一个包含n个数的数组，若在i<j的情况下，有a[i]>a[j]，则称(i, j)为a数组的一个逆序对（inversion）。 比如 <2,3,8,6,1> 有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, <2,3,8,6,1> 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.)

说明：  几种模幂算法，有传统模幂，SMM模幂，基于2的K次方的模幂和最一般的模幂算法，还有为这些模幂算法建立的WINDOWS对话框。可以方便的运行。(algorithm, the traditional mode power, SMM Modular Power, Based on two of the K-th power module and the most common mode power algorithm, These modules also for the establishment of the algorithm Power Windows dialog box. To facilitate the operation.)

可是实现产生均匀分布的混沌序列，可以用于均匀分布的伪随机发生器(uniform distribution of the chaotic sequence)

本程序求相关性K值大小，采用傅里叶矩阵和haar矩阵内积。(The procedures for seeking the size of the K value of the correlation, the use of the Fourier matrix and haar matrix of inner product.)

计算动力学研究，应力波引起的裂纹扩展问题，供大家学习(Kinetics calculations, crack propagation problems caused by stress wave for everyone to learn)