juxingshuangjijisuane

说明：  克里金方法（Kriging）, 是以南非矿业工程师D.G.Krige (克里金)名字命名的一项实用空间估计技术，是地质统计学 的重要组成部分，也是地质统计学的核心。 (Kriging method (Kriging), is a South African mining engineer DGKrige (Kerry King), named after a practical space estimation techniques, is an important part of geostatistics is the core of geostatistics.)

三维重力梯度正演程序，可根据剖分模型计算多个场分量，绝对原创！(3D Gravity Gradients calculating )

电容层析成像的landweber算法演示程序，并有详细的说明。(The capacitive tomography of the landweber algorithm demonstrates the program and has a detailed description.)

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

一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems. Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)

同伦方程组求非线性方程组所有解，自编程序，很好用(Homotopy equations for all solutions of nonlinear equations, written procedures, very good use)

fft谐波分析的实例，并求出THD即谐波畸变率 (Examples fft harmonic analysis, and find THD)

实现多项式相乘求模运算，并且模多项式是可以改变的，方便，简单(To achieve polynomial multiplication modulo operation, and polynomial model can be changed, convenient and simple)

用于利用最大熵法求解数据资料服从的分布类型。并应用最小二乘法求解模型以得到最优解(Using the maximum entropy method for solving the data distribution type of obedience. And apply the least squares method to obtain the optimal solution to solve the model)

螺旋桨唱音信号建模，FFT变换后有明显的谐波(The propeller singing sound signal is modeled, and FFT transformation has obvious harmonic )