A Fast Solver Free of Fill-In for Finite Element Problems
暂无分享,去创建一个
A new algorithm for solving finite element problems is presented. It blends a preconditioned conjugate gradient iteration into a direct factorization method. The goal was to reduce fill to a negligible level and thus reduce storage requirements, but the algorithm turned out to be faster than its rivals for an important class of problems.
[1] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .
[2] J. Pasciak,et al. Computer solution of large sparse positive definite systems , 1982 .