temperature

本程序应用python编程，用到3机9节点算例，数据也给出，可以实现潮流计算。(This program uses python programming, uses 3 machines and 9 nodes to calculate the example, and the data is also given, which can realize the load flow calculation.)

是用MATLABA编写的遗传运算发的一个小程序 挺好用的 大家(MATLABA is prepared by the genetic operator issued a small procedure very well, we try to use)

对互谱法被动测距的原理及算法各个环节进行仿真验证：加权最小二乘估计中权系数的选取；相关窗长度的选取；各频段综合方法等等。最后实现了对9000m—15000m距离的测距(Cross-spectral method for passive ranging all aspects of theory and algorithms for simulation: weighted least squares estimation of the right of the selection coefficient related to the length of the selection window an integrated approach to the various bands and so on. Finally realize the right of ranging from 9000m-15000m)

解释有限元程序SAP5的原理，结构，算例的一本书籍(The finite element program SAP5 explain the principles, structure, examples)

万有引力单目标优化算法，用于单目标线性规划问题(Universal gravitation single objective optimization algorithm is used for single target linear programming problem.)

说明：  c语言用来进行数值计算的相关程序和论文，非常棒棒棒(C language for numerical calculation of the relevant procedures and papers, very good)

包含优化类的几个简单示例程序，包括四元数的各种计算,一个计算声子晶体结构的一维传递矩阵法。( Optimization class contains several simple sample programs, Including quaternion various calculations, A one-dimensional transfer matrix method to calculate the phonon crystal structure.)

金属断裂的数值计算提供理论依据及实际详例解读(The numerical calculation of metal fracture provides theoretical basis and interpretation of practical examples)

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.)

设计迭代、有限差分法、有限元的matlab优化计算程序(Matlab design iterations, finite difference method, finite element calculation program optimization)