填充元优化算法在有限元快速求解中的应用.pdfVIP

第六届全国土木工程研究生学术论坛 清华大学 2008 填充元优化算法在有限元快速求解中的应用 于二青，王春江，陈 锋 (上海交通大学土木工程系，上海 200240) 摘 要：有限元分析中最基本的计算是大规模线性方程组的求解，国内外众多学者对有限元方程组求解算法做了较深入的研 究。用直接法求解有限元线性方程组 Ax? b ，填充元优化算法是通过减少矩阵三角分解时产生的填充元（Fill-in）数量来减少数 据存贮量及浮点计算次数，从而大大提高求解速度并减少精度损失。本文回顾了有限元快速求解技术的发展，比较了常用的几种 求解算法的优劣及发展应用前景，着重讨论了填充元优化算法中的最小度算法的原理，并用C++语言编制计算程序加以实现。算 例表明，在方程组求解计算程序中采用基于填充元优化算法的快速求解技术，比普通的直接求解法更节省内存，更高效。 关键词：有限元；线性方程组；快速求解；填充元优化；最小度算法 The Application of Fill-Ins Optimization Algorithm in Finite Element Fast Solution YU Erqing , WANG Chunjiang, CHEN Feng (Department of Civil Engineering, Shanghai Jiao Tong University, Shanghai 200240, China) Abstract: The solution of large-scale linear equations is the most basic calculation in the finite element analysis, many scholars, both at home and abroad further studied the solution algorithms of the finite element equations. Solving the finite element linear equation Ax? b with direct solution for linear equations, the fill-ins optimization algorithm can reduce the data storage and floating-point computation, thus improve factorization efficiency and reduce accuracy loss. In this paper, the author reviewed the development of finite element fast solution technology, compared the pros and cons of various common algorithms, then discussed the principle of the minimum degree algorithm and realized it in program by means of C++ language. Numerical examples shows that the fast solution method based on fill-ins optimization algorithms used in equations solver program can save more memories and be more efficient. Key words: Finite Element; Linear Equations; Fast Solution; Fill-ins Optimization; Minimum Degree Algorithm 1 引言