2016
DOI: 10.1002/nme.5218
|View full text |Cite
|
Sign up to set email alerts
|

A 10-node composite tetrahedral finite element for solid mechanics

Abstract: We propose a reformulation of the composite tetrahedral finite element first introduced by Thoutireddy et al. By choosing a different numerical integration scheme, we obtain an element that is more accurate than the one proposed in the original formulation. We also show that in the context of Lagrangian approaches, the gradient and projection operators derived from the element reformulation admit fully analytic expressions, which offer a significant improvement in terms of accuracy and computational expense. F… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

4
24
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 28 publications
(28 citation statements)
references
References 15 publications
(41 reference statements)
4
24
0
Order By: Relevance
“…In the third instance of the notched cylinder example, the subdomain Ω 1 is discretized using composite tetrahedral elements [45], whereas the subdomain Ω 2 is discretized using hexahedral elements. The discretizations of these domains are shown in Figure 16 (a) and (b), respectively.…”
Section: Nonconformal Hex-to-tet Couplingmentioning
confidence: 99%
See 4 more Smart Citations
“…In the third instance of the notched cylinder example, the subdomain Ω 1 is discretized using composite tetrahedral elements [45], whereas the subdomain Ω 2 is discretized using hexahedral elements. The discretizations of these domains are shown in Figure 16 (a) and (b), respectively.…”
Section: Nonconformal Hex-to-tet Couplingmentioning
confidence: 99%
“…16 10 − 14 10 − 12 10 − 10 10 − 8 10 − 6 10 − 4 10 − 2 10 0 Convergence behavior of the four algorithms of Section 2.4 for the singular bar problem. The plotted error measure for the Schwarz iterations (n) is defined in(45) in the notation of Algorithms 2-5. Occasionally, the Modified Schwarz method (green) displays non-monotonic convergence, as shown in the right plot.…”
mentioning
confidence: 99%
See 3 more Smart Citations