2021
DOI: 10.1016/j.cma.2021.113956
|View full text |Cite
|
Sign up to set email alerts
|

A discretize-then-map approach for the treatment of parameterized geometries in model order reduction

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 39 publications
0
4
0
Order By: Relevance
“…j=1 , connectivity matrix T and elements {D k, } N e k=1 , we denote by U a generic element of X and we denote by U ∈ R DN v the corresponding FE vector associated with the Lagrangian basis of T a , for all ∈ L. Following [14], we pursue a discretize-then-map treatment of parameterized geometries: given the mesh T a L i , we state the local variational problems in the deformed mesh…”
Section: Instantiated Systemmentioning
confidence: 99%
“…j=1 , connectivity matrix T and elements {D k, } N e k=1 , we denote by U a generic element of X and we denote by U ∈ R DN v the corresponding FE vector associated with the Lagrangian basis of T a , for all ∈ L. Following [14], we pursue a discretize-then-map treatment of parameterized geometries: given the mesh T a L i , we state the local variational problems in the deformed mesh…”
Section: Instantiated Systemmentioning
confidence: 99%
“…To speed up computations, we should thus resort to hyper-reduction techniques [7,18,27,62,78]. The choice of the hyper-reduction procedure strongly depends on the PDE model of interest, on the underlying high-fidelity numerical scheme, and on the geometrical parameterization: we refer to [72] for a discussion on the treatment of geometry parameterizations. We further observe that evaluation of (17a) involves evaluation of u j,µ in the mapped quadrature points of the mesh Ω Li : this evaluation is extremely expensive for unstructured meshes and thus requires a specialized treatment.…”
Section: Residual Assembly and Algebraic Formulation Of The Reduced-o...mentioning
confidence: 99%
“…EQ procedures also dubbed mesh sampling and weighting have been first proposed in References 4‐6 and further developed in several other works including Reference 7: the key feature of EQ is to recast the problem of hyper‐reduction as a sparse representation problem and then resort to state‐of‐the‐art techniques in machine learning and signal processing to estimate the solution to the resulting optimization problem. Here, we rely on the approach employed in Reference 8, which combines the methods in References 4 and 5 and relies on non‐negative least‐squares to estimate the solution to the sparse representation problem.…”
Section: Introductionmentioning
confidence: 99%
“…As discussed in Section 3, the presence of internal variables requires several changes to the EQ approach in Reference 8. Our approach relies on a different treatment of primary and internal variables compared to the works in Reference 9 and 10, as explained in Section 3.2.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation