Measuring and improving the geometric accuracy of piece-wise polynomial boundary meshes
- 1. Computer Applications in Science and Engineering, Barcelona Supercomputing Center - BSC, E-08034 Barcelona (Spain)
- 2. Laboratori de Càlcul Numèric (LaCàN), Universitat Politècnica de Catalunya, Jordi Girona 1, E-08034 Barcelona (Spain)
Description
Highlights: • A disparity measure to optimize the geometric accuracy of a high-order mesh. • Optimized high-order meshes have geometric accuracy of order 2p. • Optimized high-order meshes approximate normals with order . • Non-interpolative and interpolative meshes feature the same accuracy. We present a new disparity functional to measure and improve the geometric accuracy of a curved high-order mesh that approximates a target geometry model. We have devised the disparity to account for compound models, be independent of the entity parameterization, and allow trimmed entities. The disparity depends on the physical mesh and the auxiliary parametric meshes. Since it is two times differentiable on all these variables, we can minimize it with a second-order method. Its minimization with the parametric meshes as design variables measures the geometric accuracy of a given mesh. Furthermore, the minimization with both the physical and parametric meshes as design variables improves the geometric accuracy of an initial mesh. We have numerical evidence that the obtained meshes converge to the target geometry (unitary normal) algebraically, in terms of the element size, with order 2p (, respectively), where p is the polynomial degree of the mesh. Although we obtain meshes with non-interpolative boundary nodes, we propose a post-process to enforce, if required by the application, meshes with interpolative boundary nodes and featuring the same order of geometric accuracy. In conclusion, we can obtain super-convergent orders, at least for sufficiently smooth parametric curve (surface) entities, for meshes of polynomial degrees up to 4 (3, respectively). In perspective, this super-convergence might enable using a lower polynomial degree to approximate the geometry than to approximate the solution without hampering the required geometric accuracy for high-order analysis.
Availability note (English)
Available from http://dx.doi.org/10.1016/j.jcp.2021.110500Additional details
Identifiers
- DOI
- 10.1016/j.jcp.2021.110500;
- PII
- S0021999121003958;
Publishing Information
- Journal Title
- Journal of Computational Physics (Print)
- Journal Volume
- 443
- Journal Page Range
- vp.
- ISSN
- 0021-9991
- CODEN
- JCTPAH
INIS
- Country of Publication
- Netherlands
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 54094082
- Subject category
- S97: MATHEMATICAL METHODS AND COMPUTING;
- Descriptors DEI
- CONVERGENCE; DESIGN; GEOMETRY; MINIMIZATION; POLYNOMIALS; SURFACES
- Descriptors DEC
- FUNCTIONS; MATHEMATICS; OPTIMIZATION
Optional Information
- Copyright
- Copyright (c) 2021 The Author(s). Published by Elsevier Inc.