kalman_suppression

Fluent 学习文件 全方位的指导手册 (Building geometry Setting boundary condition types)

说明：  LM莱文博格马夸特优化算法，python语言(this is a file of LM algorithm which was wroten by python language)

cape是计算对流有效位能和对流抑制能的一个fortran。广泛应用在大气科学计算大气垂直速度的诊断分析中。(cape is the calculation of CAPE and convective inhibition energy of a fortran. Widely used in calculation of the vertical velocity of atmospheric science and diagnostic analysis.)

王兆华关于apFFT原理的一篇文章，写的很简单明了，方便大家更好理解全相位FFT(WangZhaoHua about apFFT principle of an article, written in very simple and clear, facilitate everybody better understand all phase FFT )

六轴工业机器人的逆运动学,采用VC++进行编程自动求解(inverse of 6-dof industrial robot)

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

用于测试hadoop的mapreduce功能，功能与自带的wordcount程序大相径庭。(Use to test the mapreduce function of hadoop,this program was seem to the origin program.)

加步探索法，二分法,黄金分割法,抛物线插值法求解方程的演示(Plus step-by-step exploration of law, black-and-white, golden section method, the parabolic interpolation method for solving equations of presentation)

运用线性矩阵不等式(LMI)求解鲁棒优化问题。该LMI不等式求解代码，更具有一般性，结合matlab中help命令,能够方便的对新的LMI问题求解(This programme code is useful for the common optimization problem, combined with the description of matlab help statement, a new LMI problem can be easy to solve. )

gmres 方法。视图求解线性方程组A*x=b的解x。nXn的稀疏矩阵A必须是方程且应是大型稀疏矩阵。列向量b的长度必须为n。(gmres method. View solving linear equations A* x = b the solution x. nXn sparse matrix A must be equation and should be large sparse matrix. The length of the column vector b must be to n.)