作者: R.I. Mackie
DOI: 10.1016/S0965-9978(01)00026-6
关键词:
摘要: Abstract This paper describes how the U t DU decomposition method and sub-structuring algorithms can be implemented using object-oriented techniques. It is shown that this enables to very concisely. Moreover, there no increase in code complexity when are extended take account of sparsity. The sub-structuring, or domain expressed block matrix terms, classes used represent each these matrices. solution processes incorporated a finite element program. program uses distributed data structure, facilitates straightforward interface between mathematics. possesses clear control structure for responding user changes model.