mie-uu36

说明：  基2基4基8以及分裂基的fft算法，代码效率很高。是难得一见的好代码。应用范围很广。(Radix-2-4-based 8 and split fft-based algorithm, a high code efficiency. Is a rare good code. Application of a very wide scope.)

植被指数计算程序，共计算了31个植被指数(Vegetation index calculation program, a total of 31 vegetation index calculations)

利用这个方法计算混沌时间序列的平均轨道周期p(Use this method to calculate the average orbital period of chaotic time series p)

算术编码是用符号的概率和它的编码间隔两俩个基本参数来描述的。算术编码可以是静态的或是自适应的。(Arithmetic coding to both of two basic parameters to describe the probability of the symbol and its coding interval. Arithmetic coding can be static or adaptive.)

实现线性代数的矩阵运算的C++程序，矩阵计算器。(Linear algebra matrix operations C++ procedures matrix calculator.)

给定求解区间，用最小二乘法给出函数的零点，并给出迭代次数(Given the solution interval, the zeros of the function are given by the least square method, and the number of iterations is given.)

％ SSOR预处理的共轭梯度法求解方程Ax=b ％ 输入参数说明 ％ A 正定矩阵[n*n] ％ b 右边向量 ％ omega SSOR预处理参数(0--2) ％ Times 迭代次数 ％ errtol 给定误差终止条件 ％ ％输出参数 ％ NewX 方程Ax=b的x近似解 ％ avgerr 求解的当前平均绝对误差( SSOR preconditioning conjugate gradient method for solving equations Ax = b the input parameter descriptions A positive definite matrix [n* n] b right side vector omega SSOR preconditioning parameters (0- 2) Times iterations errtol termination of a given error condition NewX output parameter equation Ax = b of x approximate solution to solve the current avgerr average absolute error)

说明：  用Doolittle式的LU分解来求解线性方程组。(Solve the linear equations using Doolittle LU Decomposition!)

这本书由 Clive G. Page(University of Leicester)先生撰写，旨在帮助正在学习fortran的人。这是本非常好的原版英文入门书。(This book written by Clive G. Page(University of Leicester) is aimed to help those who want to pursue his/her career in Fortran. It is a good start book.)

最优解回溯法0-1问题，为了构造最优解，必须在算法中记录与当前最优值相应的当前最优解。(The optimal solution backtracking 0-1 must be recorded in the algorithm, in order to construct the optimal solution, corresponding to the current optimal value, the current optimal solution.)