Since in many finite element problems, lots of opera tions are repetitive on elements, it is of great interest to study methods that use this repetition in order to vec torize and parallelize the computation. Among these ele ment by element methods we present a preconditioner for the conjugate gradient algorithm. We also present the results of computations run on an Alliant FX/8 machine.
Get full access to this article
View all access options for this article.
References
1.
Carey, G.F., and Jiang, B.N.1984. Element-by-element preconditioned conjugate gradient algorithm for compressible flow. In Proceedings of the intenational conference on innovative methods for nonlinear problems, edited by W. K. Liu, T. Belytschko , and K. C. Park.Swansea: Pineridge Press Ltd, pp. 41-49.
2.
Golub, G.H., and Van Loan, C.F.1983. Matrix computations. Baltimore : Johns Hopkins.
3.
Hayes, L.J., and Devloo, P.1984. An element-by-element block iterative method for large nonlinear problems. In Proceedings of the international conference on innovative methods for nonlinear problems, edited by W. K. Liu, T. Belytschko , and K. C. Park. Swansea: Pineridge Press Ltd, pp. 51-62.
4.
Kamat, M.P., Watson, L.T., and Vanden Brink, D.J.1984. Comparison of a globally convergent quasi-Newton method with an EBE method for nonlinear structural problems. In Proceedings of the international conference on innovative methods for nonlinear problems, edited by W. K. Liu, T. Belytschko, and K. C. Park.Swansea: Pineridge Press Ltd, pp. 63-82.
