Computational & Technology Resources
an online resource for computational,
engineering & technology publications 

CivilComp Proceedings
ISSN 17593433 CCP: 94
PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by: B.H.V. Topping, J.M. Adam, F.J. Pallarés, R. Bru and M.L. Romero
Paper 2
A Parallel Direct Solver for a Hierarchical HAdaptive Finite Element Code J.J. Ródenas^{1}, C. Corral^{2}, J. Mas^{1}, F. Olmeda^{1} and J. Albelda^{1}
^{1}Research Centre for Vehicle Technology, ^{2}Institute for Multidisciplinary Mathematics,
J.J. Ródenas, C. Corral, J. Mas, F. Olmeda, J. Albelda, "A Parallel Direct Solver for a Hierarchical HAdaptive Finite Element Code", in B.H.V. Topping, J.M. Adam, F.J. Pallarés, R. Bru, M.L. Romero, (Editors), "Proceedings of the Seventh International Conference on Engineering Computational Technology", CivilComp Press, Stirlingshire, UK, Paper 2, 2010. doi:10.4203/ccp.94.2
Keywords: parallel direct solver, domain decomposition, nested domain decomposition, hadaptive refinement, hierarchical data structure, finite element analysis.
Summary
Ródenas et al. [1] showed the hierarchical relationships between geometrically similar finite elements. Under this similarity condition, the terms involved in the evaluation of element stiffness matrices, corresponding to parent and child elements, are related by a constant which is a function of the ratio of the element sizes (scaling factor). These and other parentchild relations where then used to develop a basic implementation of a hierarchical hadaptive refinement program (based on element subdivision, and the use of multipoint constraints to satisfy the C^{0} continuity) in order to create a framework that could help us to explore the possibilities of the use of hierarchical relations in hadaptivity to improve the performance of adaptive analyses. The program uses a data structure that accounts for hierarchical relations to reduce to a minimum the number of element stiffness matrices that need to be evaluated, simplifies the mesh generation process, reduces the computational cost associated to the evaluation of volume integrals, etc.
The data structure was used in [2,3] to create a nested domain decomposition (NDD) that generates stiffness matrices with a nested arrowhead structure. This allowed for the development of efficient domain decomposition sequential direct solvers. These references already mentioned that the algorithms were suitable for parallelization This paper shows the following benefits provided by the hierarchical data structure associated to the resolution of the system of equations. On the one hand, the NDD reordering, directly provided by the data structure at no additional cost, has shown to outperform the behaviour of the rest of reordering techniques analyzed in the paper. On the other hand, the hierarchical data structure has shown its usefulness in the definition of parallel domain decomposition solver based on MatlabR [4]. The results obtained are satisfactory but suggest the implementation of the algorithm in a more efficient programming language such as C++ to improve the performance of the code. Further improvements of the parallel solver could also be obtained by using the NDD solver presented in [3]. References
purchase the fulltext of this paper (price £20)
go to the previous paper 
