介绍一种解决双障碍问题的迭代算法，该算法称之为内点迭代算法。
This paper presents a new iterative method which is called interior-point-iterative algorithm for solving the bi-obstacle problems.
非扩张映像是最重要的非线性算子之一，非扩张映像不动点迭代算法已经积累了系统的研究成果。
The nonexpansive mapping is the most important one of the nonlinear operators. The fixed point iterative algorithm of nonexpansive mapping has accumulated systematic research results.
主要构造了求解一维隐式差分方程的四点嵌套迭代并行算法，并证明了它的收敛性。
The focal point is to construct a new embedding overlapped iterative algorithm for solving one-dimensional implicit difference equations.
概述了迭代最近点(ICP)算法及其实现最优匹配的几个关键问题。
Also, the iterative closest point (ICP) algorithm and several critical techniques in implementing optimal match are briefly decrypted here.
为了解决此缺点，提出了一种使用迭代函数系统的点式隐式曲面绘制算法，它的实现非常简单，易于编程。
A pointed type implicit surface drawing algorithm with iterative function is provided to solve the default and its implementation is very simple and it is easy to program.
论文将对偶四元数法应用到三维物体识别的匹配算法中，利用最小二乘的思想提出了一种基于迭代最近点的匹配算法。
Last, we apply the dual quaternion algorithm to matching algorithm of 3d object recognition and make use of least-squares technique to propose a matching method based on iterative closest point.
修正PCA算法能够在运行过程中自动地识别样本集之中的“劣点”，从而通过迭代计算加以适当处理来排除对运算精度的影响。
The new robust PCA algorithm can recognize the outliers in the sample set automatically and exterminate their effects to the accuracy of the PCA algorithm through proper processing to the outliers.
针对扫描点云杂乱无序的特点，讨论了点云数据预处理的问题，提出了一种新的基于点云切片的数据预处理迭代算法。
Several problems about data pre-processing were analyzed and solved considering the original scattered point cloud, and a new iterative algorithm based on point cloud slicing was proposed.
提出一种基于地面控制点的迭代动态规划立体匹配算法。
A ground control point based stereo matching algorithm via iterative dynamic programming is proposed.
利用迭代最近等值点(ICCP)算法对重力图上的航迹进行匹配可以减小惯性导航系统误差，但计算量大。
It can reduce the error of the inertial navigation system when using Iterative Closest Contour Point (ICCP) algorithm for track matching on the gravity map, however it brings large computation costs.
针对一次二阶矩法可靠度指标分析中验算点的计算问题，提出一种新的修正迭代算法。
A new iterative algorithm is presented for seeking the design point in the FOSM reliability index analysis.
该算法在迭代的每一步，都将全部点根据适应值进行排序，让好点与差点进行两两配对。
All points were arranged according to the fitness value in each iterative step of the algorithm, and the good points and the bad points were made pairs respectively.
本文对于矩形区域上某一内点为奇点的奇异积分的近似计算给出了优化中心数值算法，它在迭代计算过程中避免了函数值的重复计算。
This paper presents an optimum numerical algorithm of center rule for the approximate evaluation of singular integrals over rectangular domains with a inner singularity.
目前最近距离扫描算法使用迭代法来计算最近距离点，计算量较大，迭代算法的收敛性对扫描算法的整体性能有较大的影响。
Currently, the iterative method is used to calculate the nearest points in scanning the nearest distance, which requires a large amount of calculation.
目前，应用最普遍的数据配准算法是最近点迭代（ICP）算法，它采用迭代方式逐渐逼近最佳结果。
Nowadays, the most popular registration algorithm is the ICP algorithm, which utilizes iterative method to approach the best result.
这样在每一个非稳定点处至少存在一个可行的下降方向，在初始点是可行点的条件下，此算法产生的每一个迭代点都是可行点。
So at every nonstationary point there exists at least one feasible descent direction, every iterate generated by the methods is feasible so long as the initial iterate is feasible.
该鲁棒pca算法能够在运行过程中自动地识别样本集之中的“劣点”，从而在迭代训练中加以适当处理来排除对运算精度和收敛性的影响。
The new robust PCA algorithm can recognize the outliers in the sample set automatically and exterminate their effects to the accuracy of the PCA algorithm through proper processing to the outliers.
该鲁棒pca算法能够在运行过程中自动地识别样本集之中的“劣点”，从而在迭代训练中加以适当处理来排除对运算精度和收敛性的影响。
The new robust PCA algorithm can recognize the outliers in the sample set automatically and exterminate their effects to the accuracy of the PCA algorithm through proper processing to the outliers.
应用推荐