And the error bound of the simplified Markov model is mainly discussed.
并且对该简化方法的误差界限进行了讨论。
By means of analysing the global error bound, we prove that the method has a R-linear convergence rate.
借助于全局误差界的分析，证明了所提方法具有R -线性收敛速度。
Furthermore, by using an error bound condition, we establish linear convergence of the proposed algorithm.
在误差界假设条件下，我们得到了改进算法的线性收敛速度。
In this paper, the problem of the estimation of the error bound for a class of simplest Markov sources is discussed.
本文讨论了一类最简单的遍历马氏信源的误差界估计问题。
And the error is analyzed for the simplified Markov model and the error bound is presented with the minimum information of the neglected states.
通过对系统建立的简化模型进行误差分析，在已知被忽略状态的最少信息的前提下得到简化模型的误差界限。
When the error bound of location deviation is known, the original point pattern relaxation matching algorithm is improved to obtain better matching performance.
研究了在已知最大定位误差的情况下时，如何对基本点特征松弛匹配算法进行改进，以提高匹配性能。
The known error bound of location deviation is used to determine the minimum matching merit for two point pairs so that the effect of spurious feature points can be reduced.
基本思想是利用已知的最大定位误差，确定两点对的最小匹配度量，从而减小虚假特征点对匹配结果的影响。
The known error bound of location deviation is used to determine the minimum matching merit for two point pairs so that the effect of spurious feature points can be reduced.
基本思想是利用已知的最大定位误差，确定两点对的最小匹配度量，从而减小虚假特征点对匹配结果的影响。
应用推荐