Riemann-problems

用递推最小二乘法，使用MATLAB对液面高度进行估计。(using recursive least squares method, using MATLAB surface height estimation.)

matlab的adi方法求解偏微分方程，精确度较高(ADI method of MATLAB for solving partial differential equations)

素性检测的miller-rabin算法。。。。。(Primality testing)

说明：  PCA主成分分析的标准MATLAB程序,可通用,非常有效(PCA principal component analysis of the standard MATLAB procedures, can be universal, very effective)

计算多重分形非趋势波动分析matlab程序,包括脚本文件和函数文件形式，AHP层次分析法计算判断矩阵的最大特征值。( Calculation multifractal detrended fluctuation analysis matlab program, Including script files and function files in the form, Calculate the maximum eigenvalue judgment matrix of AHP.)

传统的算法是基于邻接矩阵对网络指标进行计算，而大型网络通过稀疏矩阵保存。本研究编写了可以计算稀疏矩阵的经典传染病SIS模型的程序。(The traditional method is based on network indicators adjacency matrix computing, and large networks through sparse matrix saved. The study prepared by the epidemic SIS model can calculate the classical sparse matrix program.)

基于FFT的海面模拟。能够实现海面的复制，波浪模拟效果较好。(FFT-based simulation of the sea. Be able to achieve replication of the sea, wave simulation better.)

说明：   ★问题描述: 给出平面上的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 位小数(四舍五入)。

FFT（Fast Fourier Transformation）是离散傅氏变换（DFT）的快速算法 [1] 。即为快速傅氏变换。它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。(FFT (Fast Fourier Transform) is a fast algorithm of discrete Fourier Transform (DFT). That is fast Fourier transform. According to the odd, even, imaginary and real characteristics of discrete Fourier transform, the algorithm of discrete Fourier transform is improved.)

说明：  利用五点差分格式和Jacobi迭代法，求解精确解和数值解的误差，判断阶数是否正确(Five-point difference scheme and Jacobi iteration method are used to solve the error between exact solution and numerical solution and to judge whether the order is correct or not.)