Show simple item record

dc.contributor.authorRuiz-Gironés, Eloi
dc.contributor.authorRoca Navarro, Francisco Javier
dc.contributor.authorSarrate Ramos, Josep
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III
dc.date.accessioned2015-04-13T10:28:01Z
dc.date.available2015-04-13T10:28:01Z
dc.date.created2014
dc.date.issued2014
dc.identifier.citationRuiz, E.; Roca, X.; Sarrate, J. Optimizing mesh distortion by hierarchical iteration relocation of the nodes on the CAD entities. A: International Meshing Roundtable. "23rd International Meshing Roundtable". 23rd International Meshing Roundtable: Elsevier, 2014, p. 101-113.
dc.identifier.isbn1877-7058 (ISSN)
dc.identifier.urihttp://hdl.handle.net/2117/27269
dc.description.abstractMesh untangling and smoothing is an important part of the meshing process to obtain high-quality discretizations. The usual approach consists on moving the position of the interior nodes while considering fixed the position of the boundary ones. However, the boundary nodes may constrain the quality of the whole mesh, and high-quality elements may not be generated. Specifically, thin regions in the geometry or special configurations of the boundary edges may induce low-quality elements. To overcome this drawback, we present a smoothing and untangling procedure that moves the interior nodes as well as the boundary ones, via an optimization process. The objective function is defined as a regularized distortion of the elements, and takes the nodal Cartesian coordinates as input arguments. When dealing with surface and edge nodes, the objective function uses the nodal parametric coordinates in order to avoid projecting them to the boundary. The novelty of the approach is that we consider a single target objective function (mesh distortion) where all the nodes, except the vertex nodes, are free to move on the corresponding CAD entity. Although the objective function is defined globally, for implementation purposes we propose to perform a node-by-node process. To minimize the objective function, we consider a block iterated non-linear Gauss-Seidel method using a hierarchical approach. That is, we first smooth the edge nodes, then the face nodes, and finally the inner nodes. This process is iterated using a node-by-node Gauss-Seidel approach until convergence is achieved
dc.format.extent13 p.
dc.language.isoeng
dc.publisherElsevier
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica::Modelització matemàtica
dc.subject.lcshNumerical analysis
dc.subject.otherMesh smoothing
dc.subject.otherMesh untangling
dc.subject.otherAlgebraic quality
dc.subject.otherFunction optimization
dc.subject.otherHierarchical approach
dc.titleOptimizing mesh distortion by hierarchical iteration relocation of the nodes on the CAD entities
dc.typeConference report
dc.subject.lemacAnàlisi numèrica
dc.contributor.groupUniversitat Politècnica de Catalunya. LACÀN - Mètodes Numèrics en Ciències Aplicades i Enginyeria
dc.identifier.doi10.1016/j.proeng.2014.10.369
dc.description.peerreviewedPeer Reviewed
dc.subject.ams65K Mathematical programming, optimization and variational techniques
dc.rights.accessOpen Access
drac.iddocument15548199
dc.description.versionPostprint (published version)
upcommons.citation.authorRuiz, E.; Roca, X.; Sarrate, J.
upcommons.citation.contributorInternational Meshing Roundtable
upcommons.citation.pubplace23rd International Meshing Roundtable
upcommons.citation.publishedtrue
upcommons.citation.publicationName23rd International Meshing Roundtable
upcommons.citation.startingPage101
upcommons.citation.endingPage113


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain