一种设计分解的正确性证明 |
| |
引用本文: | 袁波,李彦涛,孙家广. 一种设计分解的正确性证明[J]. 软件学报, 2001, 12(3): 323-328 |
| |
作者姓名: | 袁波 李彦涛 孙家广 |
| |
作者单位: | 清华大学计算机科学与技术系, |
| |
基金项目: | This projecet is suppiorted bny the National Natural Science of Chian under Grant No.69772019(国家自然科学基金) |
| |
摘 要: | 二维变量化设计系统可以用含有n个未知数、m个方程的非线性方程组表示.通过设计分解可以提高几何约束求解的效率和数值稳定性.给出了一种基于图论的设计分解方法及其正确性证明.该方法可以(1)处理结构欠约束系统的分解;(2)检测出冗余约束.分解算法在有限步内终止,其结果是结构相容的
|
关 键 词: | 设计分解;几何约束求解;剪枝;规约 |
收稿时间: | 1999-05-04 |
修稿时间: | 1999-05-04 |
The Correctness Proof of a Decomposing Approach |
| |
Abstract: | Mathematically a 2Dconstrained design system can be modeled by mindependent nonlinear equa-tions with n design variables and the design process can be viewed as a process ofsolving a geometric constraintsystem.Design decomposition is a highly effective way to improve a geometric constraint solver to make it effi-cient and robust.This paper reports a graph based decomposing approach and gives the correctness proof oftheapproach:(1)this approach can dealwith the decomposition ofstructurally under-constrained systems,(2)thisapproach can detect structurally over-constrained systems,(3)the approach can terminate within finite numberofsteps,and(4)the solving steps obtained through the decomposing approach are structurally consistent. |
| |
Keywords: | design decomposition geometric constraint solving graph clipping graph reducing |
本文献已被 维普 万方数据 等数据库收录! |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |