Model-extension-and-FFT

说明：  用卡尔曼滤波方法对圆周运动进行预测的算法实现(Kalman filtering method using circular motion algorithm to predict)

最优解回溯法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.)

In this section we introduce the idea of Galerkin approximations by considering a simple 1-d boundary value problem

这是一个数组练习，程序的作用是查询一个一维数组（数值型数组）中每一个元素出现的次数，且元素出现的顺序不能改变(This is an array of exercises, the program' s role is to query a one-dimensional array (numeric array) in the number of occurrences of each element, and the element can not be changed in order of appearance)

说明：  最速下降法就是梯度下降法,可以用于求解最小二乘问题(线性和非线性都可以)。可以说是求解机器算法的最古老、最经典的模型，另一种常用的方法是最小二乘法。(The steepest descent method is the gradient descent method, which can be used to solve the least squares problem (both linear and non-linear). It can be said that it is the oldest and most classical model for solving machine algorithm. Another commonly used method is the least square method.)

给出了高斯消元的代码，和程序页面，方便快捷(The code and program page of Gauss elimination are given, which is convenient and quick.)

并联机构 正反解 六自由度并联机构空间运动结算 实例分析(DOF parallel mechanism inverse solution space motion parallel mechanism settled case analysis)

通径分析算法实现，没有gui的小程序，用于数学实验方面的联系，一般计算数学的课程设计(Path analysis algorithm, there is no gui applets, links to mathematical experiments, the general computational mathematics curriculum design)

基于递推最小二乘法进行系统辨识的基本原理,对给定的实际输入输出数据运用MATLAB的M语言编写递推最小二乘算法(The basic principle of system identification based on recursive least squares method, using the MATLAB M language to write recursive least squares algorithm for given actual input and output data)

ICP迭代最近点算法的各种实现方法，包括四元函数法，最小迭代，等算法，以及ICP迭代最近点算法的实现。(ICP iterative closest point algorithm implementation, including the four-function method, the minimum iteration algorithm, and ICP iterative closest point algorithm.)