RGB a YCbCr

说明：  Matlab编写的最速下降法算法程序，美国一本权威数值计算方面的书上的源程序。(Matlab prepared by the steepest descent algorithm, a numerical calculation authoritative book on the source.)

数值分析中用C 语言验证验证Gauss列主元消去法。(Numerical analysis using the C language to verify verify the Gauss column principal component elimination.)

EFIE-电场积分方程的详细推倒过程，对于初步学习电磁场的人很有用。(Electric field integral equation EFIE-down process in detail, the electromagnetic field for the preliminary study were very useful.)

国外最近的一篇变步长nlms仿真，该文件有文中的几种仿真，包括基本的仿真，信道突变下的追踪性能和语音回声消除的性能分析(Recent foreign nlms a variable step simulation, the file has the text of several simulations, including basic simulation, channel tracking performance under mutation and voice echo cancellation performance analysis)

有PMUSIC 校正前和校正后的比较，sar图像去噪的几种新的方法，实现了图像的加水印，去噪，加噪声等功能。( A relatively before correction and after correction PMUSIC, Several new methods sar image denoising, Realize image watermarking, de-noising, plus noise and other functions.)

用牛顿法，共轭梯度法，最速下降法完成矩阵的计算(Newton conjugate gradient method)

说明：  关于多智能体系统一致性的程序，解微分方程(Consistency of multi-agent systems program)

一个优秀的解方程组的程序比如超定方程，病态方程。是我在做项目时遗留下来的，上传给大家使用！(An excellent procedure for the solution of equations such as over-determined equation, ill-conditioned equations. Yes I was doing projects left behind, upload for everyone to use!)

说明：  工艺优化中偏最小二乘法对响应面法的改进，显著改善模型系数不显著现象(Matlab program for calculating grey correlation matrix)

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