Steiner-point free edge cutting of tetrahedral meshes with applications in fracture
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | por |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10174/24234 https://doi.org/http://dx.doi.org/10.1016/j.finel.2017.05.001 |
Resumo: | Realistic 3D finite strain analysis and crack propagation with tetrahedral meshes require mesh refinement/ division. In this work, we use edges to drive the division process. Mesh refinement and mesh cutting are edge- based. This approach circumvents the variable mapping procedure adopted with classical mesh adaptation algorithms. The present algorithm makes use of specific problem data (either level sets, damage variables or edge deformation) to perform the division. It is shown that global node numbers can be used to avoid the Schönhardt prisms. We therefore introduce a nodal numbering that maximizes the trapezoid quality created by each mid-edge node. As a by-product, the requirement of determination of the crack path using a crack path criterion is not required. To assess the robustness and accuracy of this algorithm, we propose 4 benchmarks. In the knee-lever example, crack slanting occurs as part of the solution. The corresponding Fortran 2003 source code is provided. |
id |
RCAP_f0e236cdcdc39f75c9c750ec917a509d |
---|---|
oai_identifier_str |
oai:dspace.uevora.pt:10174/24234 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Steiner-point free edge cutting of tetrahedral meshes with applications in fractureRealistic 3D finite strain analysis and crack propagation with tetrahedral meshes require mesh refinement/ division. In this work, we use edges to drive the division process. Mesh refinement and mesh cutting are edge- based. This approach circumvents the variable mapping procedure adopted with classical mesh adaptation algorithms. The present algorithm makes use of specific problem data (either level sets, damage variables or edge deformation) to perform the division. It is shown that global node numbers can be used to avoid the Schönhardt prisms. We therefore introduce a nodal numbering that maximizes the trapezoid quality created by each mid-edge node. As a by-product, the requirement of determination of the crack path using a crack path criterion is not required. To assess the robustness and accuracy of this algorithm, we propose 4 benchmarks. In the knee-lever example, crack slanting occurs as part of the solution. The corresponding Fortran 2003 source code is provided.2019-01-24T17:47:45Z2019-01-242017-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10174/24234http://hdl.handle.net/10174/24234https://doi.org/http://dx.doi.org/10.1016/j.finel.2017.05.001porhttps://www.sciencedirect.com/science/article/pii/S0168874X16306333?via%3Dihubpmaa@uevora.ptnd287Areias, PRabczuk, Tinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-01-03T19:17:06Zoai:dspace.uevora.pt:10174/24234Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T01:14:55.766257Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Steiner-point free edge cutting of tetrahedral meshes with applications in fracture |
title |
Steiner-point free edge cutting of tetrahedral meshes with applications in fracture |
spellingShingle |
Steiner-point free edge cutting of tetrahedral meshes with applications in fracture Areias, P |
title_short |
Steiner-point free edge cutting of tetrahedral meshes with applications in fracture |
title_full |
Steiner-point free edge cutting of tetrahedral meshes with applications in fracture |
title_fullStr |
Steiner-point free edge cutting of tetrahedral meshes with applications in fracture |
title_full_unstemmed |
Steiner-point free edge cutting of tetrahedral meshes with applications in fracture |
title_sort |
Steiner-point free edge cutting of tetrahedral meshes with applications in fracture |
author |
Areias, P |
author_facet |
Areias, P Rabczuk, T |
author_role |
author |
author2 |
Rabczuk, T |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Areias, P Rabczuk, T |
description |
Realistic 3D finite strain analysis and crack propagation with tetrahedral meshes require mesh refinement/ division. In this work, we use edges to drive the division process. Mesh refinement and mesh cutting are edge- based. This approach circumvents the variable mapping procedure adopted with classical mesh adaptation algorithms. The present algorithm makes use of specific problem data (either level sets, damage variables or edge deformation) to perform the division. It is shown that global node numbers can be used to avoid the Schönhardt prisms. We therefore introduce a nodal numbering that maximizes the trapezoid quality created by each mid-edge node. As a by-product, the requirement of determination of the crack path using a crack path criterion is not required. To assess the robustness and accuracy of this algorithm, we propose 4 benchmarks. In the knee-lever example, crack slanting occurs as part of the solution. The corresponding Fortran 2003 source code is provided. |
publishDate |
2017 |
dc.date.none.fl_str_mv |
2017-01-01T00:00:00Z 2019-01-24T17:47:45Z 2019-01-24 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10174/24234 http://hdl.handle.net/10174/24234 https://doi.org/http://dx.doi.org/10.1016/j.finel.2017.05.001 |
url |
http://hdl.handle.net/10174/24234 https://doi.org/http://dx.doi.org/10.1016/j.finel.2017.05.001 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.relation.none.fl_str_mv |
https://www.sciencedirect.com/science/article/pii/S0168874X16306333?via%3Dihub pmaa@uevora.pt nd 287 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799136631003807744 |