5

用matlab仿真，通过不同的方法计算矩阵的SVD分解，并用SVD的方法计算最小二乘问题和进行图像压缩(Matlab simulation, different ways to calculate the matrix SVD decomposition and the SVD method to calculate the least squares problem and the image compression)

用最小二乘法进行电力系统状态估计，包含IEEE30节点的电力系统图(Using least squares power system state estimation, including IEEE30 bus power system diagram)

含噪脉冲信号进行相关检测,信号处理中的旋转不变子空间法，代码里有很完整的注释和解释。( Noisy pulse correlation detection signal, Signal Processing ESPRIT method, Code, there are very complete notes and explanation.)

说明：  通过matlab实现抽样检测功能，具体通过蒙特塔罗算法依照概率分布计算指定变量的分布规律，是初学者的好案例(The sampling detection function is realized by matlab, and the distribution rule of specified variables is calculated by Montreal algorithm according to probability distribution.)

描述固体凝固的随机变化状态，为fortran语言，请自行下载对应编译器(describe solid phase status, as fortran lauguage, please download associated compiler)

假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解：（1，4，3，2），（1，4，5），（8，2），（3，5，2）。 [需求分析](Suppose there are a load of the backpack of the total volume of T and n volumes were w1, w2, ... wn items, whether selected from n items a number of exactly filled backpack, even if w1+w2+ ...+ wn = T, find out the solution of all the above conditions are met. For example: when T = 10, the volume of items {1,8,4,3,5,2}, can be found in the following four solutions: (1,4,3,2), (1,4,5 ), (8,2), (3,5,2). [Needs Analysis])

资料中提供了对应的数据和程序，其中程序能够实现对三维数据的拟合。(It can realize data fitting)

快速排序法和堆排序法Fortran90程序，其中快速排序法使用到了递归过程，因此对于堆栈要求较高(both Quicksort and Heapsort program are used for sort array. Note that a recursion process is used in Quicksort program, Thus it need require a relative high stack size.)

说明：   ★问题描述: 给出平面上的N 个二维点，求出距离最小的2 个点对。本题中距离定义为他们的直 线距离。例如(0,0) (3,4)的距离为5. ★数据输入： 有多组数据，对于每组数据，第一行是一个数字N 表示点的个数。N=0 的时候说明 输入结束。之后N 行，每行有2 个浮点数x_i,y_i 表示第i 个点的坐标。(1<=N<=10000 0,0<=|x_i|,|y_i|<=10^9) ★结果输出: 输出一个浮点数，表示最近点对的距离除以2，保留2 位小数(四舍五入)。

经典99行拓扑优化程序，采用Heaviside方程获得接近0-1离散解(The classical 99-line topology optimization program uses Heaviside equation to obtain nearly 0-1 discrete solution)