为解决非线性搜索的初值问题,采用线性化方法、简单迭代法求得中间矩阵的初值。
In order to get a fine initial guess for the matrix, a linear algorithm and a simple iteration method are introduced.
该算法将非线性搜索转化为只对当前控制增量的约束,避免了非线性优化求解,并不需要很多的计算量。
The algorithm converts the nonlinear searching into the constraint on present control increment and avoids the complicated nonlinear optimization. The computation burden is not very serious.
这种搜索协议用来取代传统的画法几何学规则集,传统规则集对于这种非线性形态往往太过复杂。
Such search protocols are used to replace traditional descriptive geometry rule-sets often far too complex on such non-linear morphologies.
应用推荐