搜索资源列表
ICP
- ICP迭代最近点算法的使用，使用matlab实现了ICP迭代最近点算法的方针，还包括了四元函数法和线性约束等基本方法的代码实现。-Iterative closest point ICP algorithm for the use of matlab to achieve the iterative closest point ICP algorithm approach, including the quaternary function method and the linear constr
newton
- 牛顿迭代法是求解非线性微分方程中非常重要的一种算法，收敛速度快！本文提供算例和程序-Newton iterative method is very important for solving nonlinear differential equations an algorithm fast convergence speed! This article provides examples and procedures
apcluster
- 一种聚类的新方法，不用开始就设定聚类点的总个数，只需要确定参数p的值，p越大算出的聚类个数就越大，相反一样。-[idx,netsim,dpsim,expref]=APCLUSTER(s,p) clusters data, using a set of real-valued pairwise data point similarities as input. Clusters are each represented by a cluster center data point (t
fire
- 模拟退火算法是基于蒙特卡罗迭代求解法的一种启发式随机搜索过程。本文给出了该算法的详细介绍和伪代码。-Monte-Carlo simulated annealing algorithm is based on a heuristic iterative method for solving stochastic search process. This paper gives a detailed descr iption of the algorithm and pseudo code.
IEEEXplore
- 视频编码中的自适应维纳插值滤波中的一种框架水平迭代算法。pdf 与大家分享-An Iterative Method for Frame-Level Adaptive Wiener Interpolation Filters in Video Coding
3-5LDPC
- 3-5循环移位码是LDPC码准循环码中一种典型的构造校验矩阵的方法，较小的（155 64）码通常也是对比测试其他码的性能好坏的重要测试标准，程序详细描述了构造的步骤和方法，结果是采用AList的结果存储方法，译码性能可以由BP迭代译码直接得出-3-5 cyclic shift LDPC codes are quasi-cyclic codes in the code structure of a typical calibration matrix method, the smaller (15
k_means
- In statistics and machine learning, k-means clustering is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. It is similar to the expectation-max
fuzzy_CRUOSE_CONTROL
- 利用模糊控制做巡航速度控制利用e, dot_e，當作兩個輸入，取交集在對輸出值u做砍頭的動作，再用重心法求解，再用Runge-Kutta做疊代更改增益值將會得到不一樣的結果。-Using fuzzy control to do cruise speed control using e, dot_e, as the two inputs, the output value of taking the intersection of the decapitation of the movement
fuzzy_control_inverted_pendulum
- 利用fuzzy做倒單擺!!利用e, dot_e，當作兩個輸入，取交集在對輸出值u做砍頭的動作，現做出控制器看輸出有無正確，再用重心法求解，再用Runge-Kutta做疊代更改增益值將會得到不一樣的結果。-Inverted pendulum using fuzzy do!! Use of e, dot_e, as the two inputs, the output value of taking the intersection of the decapitation of the moveme
gaosisaideer
- 数值计算 高斯赛德尔迭代法 用C++语言描述-High Sisaideer numerical iterative method described by C++ Language
pso
- 对微粒群算法结构的改进方案有很多种，对其可分类为：采用多个子种群；改进微粒学习对象的选取策略；修改微粒更新迭代公式；修改速度更新策略；修改速度限制方法、位置限制方法和动态确定搜索空间；与其他搜索技术相结合；以及针对多模问题所作的改进。-Structure of the particle swarm algorithm to improve the program there are many, its can be classified as: the use of multiple sub-p
Phase-estimation
- 一种基于软信息的编码辅助的迭代相位估计算法。该法采用载波相位同步、解调和译码联合处理的思想，将译码器输出的码比特的可靠量度直接反馈回估计单元以提高同步的准确度-Based on soft information encoded auxiliary iterative phase estimation algorithm. The method uses carrier phase synchronization, demodulation and decoding process of join
Programming-Assignment-Sharp3
- Write a program to solve the systems of linear equations via Gauss-Seidel method, one of the iterative-method strategies produce a sequence of approximate solution vectors for the system. And compare this with the naï ve Gaussian elimination meth
Genetic Nonlinear Matlab
- 遗传算法虽然全局搜索能力较强，但是局部搜索能力较弱，一般只能搜索到函数优化问题的次优解，而不是最优解，特别是函数具有多个峰值时，遗传算法易陷入局部极小，不能找到真正的全局最优解。非线性规划因多采用梯度下降方法求解，而具有极强的局部搜索能力。因此，本源代码结合两种算法的优点，一方面采用遗传算法进行全局搜索，另一方面采用非线性规划进行局部搜索，以得到函数优化问题的全局最优解。实验证明，这种方法不仅能解决多峰函数寻优易陷入局部极小的问题，而且具有很高的迭代寻优效率，取得了满意的结果。-Global s
RGLS
- 该算法用于自回归输入模型，是一种迭代的算法。其基本思想是基于对数据先进行一次滤波处理，后利用普通最小二乘法对滤波后的数据进行辨识，进而获得无偏一致估计。但是当过程的输出信噪比比较大或模型参数较多时，这种数据白色化处理的可靠性就会下降，辨识结果往往会是有偏估计。数据要充分多，否则辨识精度下降。模型阶次不宜过高。初始值对辨识结果有较大影响。-The algorithm used for autoregressive input model, it is a kind of iterative alg
yagebi
- 算法设计与分析 实验 雅各比迭代法求方程组的解经典的算法问题-Algorithm of classic algorithm design and analysis of experiments, Jacoby iterative method for solving equations
gauss_seidel
- In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations. It is named after the German mathematicians Carl Frie
methode_jacobie
- In numerical linear algebra, the Jacobi method (or Jacobi iterative method[1]) is an algorithm for determining the solutions of a diagonally dominant system of linear equations. Each diagonal element is solved for, and an approximate value is plugged
pso
- 一个简单的PSO算法，为逐步迭代法，步数为1000步，测试后对一些简单单峰的目标函数具有较好的收敛性-A simple PSO algorithm, for the gradual iterative method, steps 1000 steps, test some simple single peak of the objective function has better convergence
em
- 机械学习算法，用于求解OFDM系统中基于循环前缀的定时同步的迭代方法(Mechanical learning algorithm for solving the iterative method of timing synchronization based on cyclic prefix in OFDM system)