期刊文献+

对基于稀疏矩阵分解求解约束系统方法的改进

Improving the Method for Solving Constraint Systems Based on Sparse Matrix Decomposition
下载PDF
导出
摘要 采用基于稀疏矩阵分解的方法 ,可以把约束系统分解成依次求解的子约束集合 ,但有时并不能顺利求解 ,其子约束集合的雅可比矩阵非满秩。本文分析了出现这种状况的几种原因 ,提出可以采用对雅可比矩阵进行下三角化求秩的方法来消除冗余约束和冗余自由度 ,然后再使用基于稀疏矩阵分解的方法进行求解。 With the method based on sparse matrix decomposition, constraint systems can be decomposed into a series of subsystems, which can be solved subsequently. But sometimes a subsystem cannot be solved, because its Jacobi matrix is not in full order. This paper analyses several reasons for this,presents a method based on calculating the order of the Jacobi matrix to eliminate redundant constraints and degrees, then the constraint system can be solved based on sparse matrix decomposition.
作者 戴春来
出处 《计算机工程与科学》 CSCD 2004年第9期52-53,61,共3页 Computer Engineering & Science
关键词 稀疏矩阵 约束分解 冗余约束 冗余自由度 过约束 欠约束 constraint decomposition sparse matrix over-constraint under-constraint redundant constraint redundant degree
  • 相关文献

参考文献6

  • 1Sridhar N, Agrawal R, Kinzel G L. Algorithms for the Structural Diagnosis and Decomposition of Sparse, Under-Constrained Design Systems[J]. Computer Aided Design, 1996, 25(4) :237 - 249.
  • 2Lee J Y, Kim K. A 2-D Geometric Constraint Solver Using DOFBased Graph Reduction [ J ]. Computer Aided Design, 1998, 30(11) :883 - 896.
  • 3Kondo K. A Gebraic Method for Manipulation of Dimensional Relation Ships in Geometric Models [ J ]. Computer Aided Design,1992,24(3) :141 - 147.
  • 4Solano L, Brunet P. Constructive Constraint-Based Model for Parametric CAD System[J]. Computer Aided Design, 1994,26(8) :614- 621.
  • 5Lin V C, Gossard D C. Variational Geometry: Modification in Computer Aided Design[J]. Computer Graphics, 1981,15(3): 171- 179.
  • 6Ge J X, Chou S C, Gao S X. Geometric Constraint Satisfaction Using Optimization Methods[J]. Computer Aided Design, 1999,31 (9):867 - 879.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部