Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Conferences
ISSN 2753-3239 CCC: 3
PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL STRUCTURES TECHNOLOGY Edited by: B.H.V. Topping and J. Kruis
Paper 1.1
Modern Finite Element Analysis with AMORE K.J. Bathe
Massachusetts Institute of Technology Cambridge, Massachusetts, United States of America K.J. Bathe, "Modern Finite Element Analysis
with AMORE", in B.H.V. Topping, J. Kruis, (Editors), "Proceedings of the Fourteenth International Conference on Computational Structures Technology", Civil-Comp Press, Edinburgh, UK,
Online volume: CCC 3, Paper 1.1, 2022, doi:10.4203/ccc.3.1.1
Keywords: finite elements, overlapping finite elements, AMORE, automatic meshing
with overlapping and regular elements, statics and dynamics, computational effort.
Abstract
A major difficulty in traditional finite element analysis is the effort of meshing complex
three-dimensional solids and structures. The inherent reason for the difficulty is
that highly distorted elements should be avoided. This condition is difficult to satisfy
because the traditional elements must abut to each other, that is, they cannot overlap.
To overcome this restriction, we have developed “overlapping elements”. These elements
perform well even when highly distorted and hence can be used much more
easily in meshing a complex domain. However, they use additional nodal degrees
of freedom which add to the computational effort of solution. To reduce the overall
solution cost, including the meshing, we focus on the AMORE scheme in which traditional
undistorted elements are used to discretize most of the analysis domain and
overlapping elements are used for the rest of the domain. The premise is that in this
way, the meshing effort is much reduced and the computational effort is also less than
in a traditional finite element analysis. This way the use of AMORE leads to an overall
efficient modern finite element analysis.
download the full-text of this paper (PDF, 13 pages, 1340 Kb)
go to the next paper |
|