TY - JOUR
T1 - Data structures for the distributed iterative solution of non-conventional finite element models
AU - Cismaşiu, Ildi
AU - de Almeida, J. P. Moitinho
N1 - This work is part of the research activity carried out at ICIST, Instituto de Engenharia de Estruturas, Território e Construção, and has been partially supported by FEDER and Fundação para a Ciência e Tecnologia through grant PRAXIS XXI/BD/9754/96, project POCTI/ECM/33066/99 and the funding of the research unit.
PY - 2007/1/1
Y1 - 2007/1/1
N2 - A class of specialised data structures designed for the distributed solution of non-conventional finite element formulations, which are equally effective when used in conjunction with conventional formulations, is presented. We begin by briefly discussing how the non-conventional finite element formulations being developed within the structural analysis group at IST [Freitas JAT, Almeida JPM, Pereira EMBR. Non-conventional formulations for the finite element method. Comput Mech 1999;23(5-6):488-501] lead to systems of equations that appear to be naturally suited for parallel processing, but we also recognise that to take full advantage of the characteristics of these systems - large dimension, non-overlapping block structure and sparsity - it is necessary to use appropriate data structures. The approach presented, which references the logical subdivisions of the system matrices, was designed to fulfil these objectives. Examples of parallel performance and efficiency on an homogeneous distributed platform are presented.
AB - A class of specialised data structures designed for the distributed solution of non-conventional finite element formulations, which are equally effective when used in conjunction with conventional formulations, is presented. We begin by briefly discussing how the non-conventional finite element formulations being developed within the structural analysis group at IST [Freitas JAT, Almeida JPM, Pereira EMBR. Non-conventional formulations for the finite element method. Comput Mech 1999;23(5-6):488-501] lead to systems of equations that appear to be naturally suited for parallel processing, but we also recognise that to take full advantage of the characteristics of these systems - large dimension, non-overlapping block structure and sparsity - it is necessary to use appropriate data structures. The approach presented, which references the logical subdivisions of the system matrices, was designed to fulfil these objectives. Examples of parallel performance and efficiency on an homogeneous distributed platform are presented.
KW - Domain decomposition
KW - Hybrid finite elements
KW - Matrix handling data structures
KW - Parallel processing
UR - http://www.scopus.com/inward/record.url?scp=34447623538&partnerID=8YFLogxK
U2 - 10.1016/j.advengsoft.2006.08.030
DO - 10.1016/j.advengsoft.2006.08.030
M3 - Article
AN - SCOPUS:34447623538
SN - 0965-9978
VL - 38
SP - 750
EP - 762
JO - Advances in Engineering Software
JF - Advances in Engineering Software
IS - 11-12
T2 - 7th International Conference on Computational Structures Technology/4th International Conference on Engineering Computational
Y2 - 7 September 2004 through 9 September 2004
ER -