python机器学习预测分析核心算法

说明：  umat公式详细介绍，我也不知道够20字了mei(the introduction of umat in abaqus)

本程序是用数学方程试计算出一个点在一条线上的垂线坐标，并判断出在线内外，是测量中用的程序！(The test procedure is used to calculate the mathematical equation of a line a point in the vertical coordinate, and determine the line outside, the procedure used to measure!)

比较JPLDE405的切比雪夫系数导出的位置与低精度月球坐标分析。(Comparative Analysis of JPL DE405 cut Chebyshev coefficients derived position with low accuracy lunar coordinates.)

室内无线定位技术，基于两次最小二乘法的matlab仿真程序(Indoor wireless positioning technology, based on the two least-squares method matlab simulation program)

A numerical method for analysis of Korres2003

说明：  这是数值分析的一些作业实验，文件中有详细的文档对理论，实验和算法的说明，用于病态方程组求解的源代码(This is the numerical analysis of the experimental operation, the paper detailed documentation of theory, experiment and the algorithm shows that morbid equation for solving the source code)

一个自己写的，生成BA无标度网络并计算其度分布的程序，fortran77格式，并附图一张，数据一份。(A program written myself, which can generate the BA scale-free networks and calculate the degree distribution , fortran77 format attachment is a drawing and data.)

编程珠玑有一条项链，它由 N 个随机排列的红、白和蓝色的珠子组成（3< =N< =350(Abas programming there is a necklace, which consists of N random with red, white and blue components of the beads (3 < = N < = 350)

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

上三角或下三角矩阵也有大部份的元素不储存值（为0），我们可以将它们使用一维阵列来储存以节省储存空间，而对称矩阵因为对称于对角线，所以可以视为上三角或下三角矩阵来储存。(Upper or lower triangular matrix or a large majority of elements are not stored value (0), we can use them to store a one-dimensional array in order to save storage space, and because the symmetrical diagonal symmetric matrix, it can be regarded as the or lower triangular matrix storage.)