fortran

求解最短路算法，，， 赋路径初值 更新 显示迭代步数 显示每步迭代后(solve the lest distance)

用有限差分方法求解波动方程，画出波场快照，模拟波在地下传播！(The wave equation by finite difference method, draw the wave field snapshot, simulate wave propagation in the underground!)

求函数极小值，适用于不带约束的、函数可以为非线性的无约束规划问题的求解(Demand function is minimum applicable to non-binding, the function can be non-binding for the non-linear programming problem solving)

速度曲线规划，在给定长度path 曲线上，根据各waypoint的速度约束，规划出平滑的速度曲线(speed curve planning.In a given length path curve, according to the speed of the waypoint constraints, planning a smooth speed curve.)

非线性方程数值解法的数学基础，有牛顿法，割线法等(Mathematical foundations of numerical solution of nonlinear equations, Newton method, secant method)

应用基本粒子群算法求解复杂连续函数优化问题(Application of Basic Particle Swarm Optimization to Complex Continuous Function Optimization)

1. 牛顿迭代法 function [x,i]=newtonmethod(x0,f,ep,Nmax) 牛顿法求非线性方程根 x0是输入初始值, f是输入函数, 精度要求ep, Nmax为最大迭代次数 x是输出迭代序列,i是迭代次数 2. 二分法 function [x,k]=bisection(a,b,f,ep) 二分法解非线性方程 输入区间[a,b],函数f和误差ep, Nmax为最大二分次数 x为输出近似根, k为二分次数 ( Newton s law and the dichotomy)

正交变换源程序，带vc工程。 学习正交变换算法的有力工具。(Orthogonal transformation source code, with vc works. Orthogonal transformation algorithm to learn a powerful tool.)

说明：  一般的最小二乘通常是一次拿到全部的数据， 对所有数据进行统一优化计算得到模型系数。递推最小二乘是以一种递推的方式计算最小二乘，每次使用最新的测量值，来不断更新模型系数。(General least squares usually get all the data at one time, and perform unified optimization calculations on all the data to get the model coefficients. Recursive least squares is to calculate the least squares in a recursive way, each time the latest measured value is used to continuously update the model coefficients.)

含列所有图像处理的VC++程序，包括图像转置，傅立叶变换，图像编码等(Containing all image processing VC++ Procedures, including image transpose, Fourier transform, image coding, etc.)