摘要
在对现有 ＣＡＤ约束求解技术分析比较的基础上，对牛顿迭代算法在求解约束方程组上的应用进行了深入的探讨，阐述了该算法作为约束求解器核心算法的合理性和可行性，并针对实际的应用系统，提出了支持此算法的数据结构．
On the basis of analyzing of several developed techniques of constraint satisfaction, the application of Newton algorithm to nonlinear equations group is studied. The advantage and feasibility as the core algorithm in constraint solving are discussed and a set of practical data structure supporting the function of this algorithm in real systems is presented as well.
出处
《哈尔滨理工大学学报》
CAS
2000年第3期36-39,共4页
Journal of Harbin University of Science and Technology
