期刊文献+

塔机有限元分析求解器的快速求解技术

Fast Solver Technologies in FEM Analysis Solver of Tower Crane
下载PDF
导出
摘要 塔式起重机结构有限元分析中,静力方程求解器是分析程序的核心。随着塔机求解规模的增大及对求解速度的高要求,传统的直接求解器愈显不足,成为有限元分析中的瓶颈。目前较好的塔机有限元程序是用稀疏直接求解器,其中引入循环展开(loop-unrolling)技术改进工作性能,实践证明,它对内存或硬盘空间的需求量明显减少,求解速度得到显著提高。 Large-scale eqution solver is a key techinique in finite element programs.It has become the bottleneck with respect to computer time and storage and the high solver speed for people .The sparse direct solver is adopted by the better finite element programs of tower crane.A method to incorporate the loop-unrolling strategy to improve its efficiency, it has shown its advantages both in solution time and memory( hard disk) space requirement through practice.
出处 《机械管理开发》 2006年第4期29-31,共3页 Mechanical Management and Development
关键词 静力方程求解器 塔机有限元分析程序 稀疏直接求解器 循环展开 Static eqution solver Finite element program of tower crane Sparse direct solver Loop-unrolling
  • 相关文献

参考文献8

  • 1王菘,周坚鑫,王来.有限元方法编程(第3版)[M].北京:北京电子工业出版社.2003.
  • 2刘而烈,崔恩第,徐振铎.有限单元法及程序设计(第2版)[M].天津:天津大学出版社.2004.
  • 3Joseph W H Liu.Modifieation of the minimum degree algorithm by multiple elimininationJ.Transactionson Mathematical Software,1985,11(2):141-153.
  • 4Timothy A Davis,Patrick Amestoy,and Iain S Duff.An approximate minimum degree algorithmR.Technical Report TR-94-039,Com puter Andinformation Sciences Department,University of Florida,Gainesville,FL,1994.
  • 5Josephliu.the multifrontal method for sparse matrix solution:theory and practice J.SIAM Review,1992,34:81-109.
  • 6陈璞,孙树立,袁明武.有限元分析快速解法[J].力学学报,2002,34(2):216-222. 被引量:16
  • 7梁峰,钱若军.空间结构有限元分析的快速求解技术[J].空间结构,2003,9(4):3-8. 被引量:2
  • 8李立,陈平,张长青.一种提高现有有限元求解器速度的方法[J].长安大学学报(自然科学版),2003,23(1):64-67. 被引量:2

二级参考文献17

  • 1北京大学数学系代数与几何教研室.高等代数[M].北京:高等教育出版社,1978..
  • 2[1]Mehran Lashkari. New fast finite element technologies[A]. PVP-Vol.355, Advances in Analytical, Experimental and Computational Technologies in Fluids, Structures, Transients and Natural Hazards, ASME[C], 1997.
  • 3[2]Iain S Duff. Direct methods[R]. Technical Report, Appleton Laboratory, Oxfordshire, 1998.
  • 4[3]Joseph W H Liu. Modification of the minimum degree algorithm by multiple elimination[J]. Transactions on Mathematical Software,1985,11(2):141-153.
  • 5[4]Timothy A Davis, Patrick Amestoy, and Iain S Duff. An approximate minimum degree ordering algorithm[R]. Technical Report TR-94-039, Computer and Information Sciences Department, University of Florida, Gainesville, FL, 1994.
  • 6[5]Bruce Hendrickson and Edward Rothberg. Improving the runtime and quality of nested dissection ordering[R]. Technical Report SAND96-0868J, Sandia National Laboratories, Albuquerque,1996.
  • 7[6]A Gupta. Fast and effective algorithms for graph partitioning and sparse-matrix ordering[R]. Technical Report RC 20496(90799). IBM T. J. Watson Research Center, 1996.
  • 8[7]Iain S Duff. The impact of high performance computing in the solution of linear system: trends and problems[R]. Technical Report TR/PA/99/41. Rutherford Appleton Laboratory, 1999.
  • 9[8]Joseph Liu. The multifrontal method for sparse matrix solution: theory and practice[J]. SIAM Review,1992,34:82-109.
  • 10[9]Ajiz M A and Jennings A. A robust incomplete cholesky conjugate gradient algorithm[J]. International Journal for Numerical Methods in Engineering,1984,20.

共引文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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