In this paper we introduce, analyze, and compare several approaches designed to incorporate a linear (or affine) constraint within the Proper Generalized Decomposition framework. We apply the considered methods and numerical strategies to two classes of problems: the pure Neumann case where the role of the constraint is to recover unicity of the solution; and the Robin case, where the constraint forces the solution to move away from the already existing unique global minimizer of the energy functional.
|Number of pages
|Computer Methods in Applied Mechanics and Engineering
|Published - Apr 15 2017
Bibliographical noteFunding Information:
SP is grateful for the support by a Discovery Grant from the Natural Sciences and Engineering Research Council of Canada. He also acknowledges the support by KAUST under Award Number OCRF-2014-CRG3-2281.
© 2016 Elsevier B.V.
- Constrained problem
- Low-rank approximation
- Mixed formulation
- Model reduction
- Proper Generalized Decomposition (PGD)
- Tensor product approximation
ASJC Scopus subject areas
- Computational Mechanics
- Mechanics of Materials
- Mechanical Engineering
- General Physics and Astronomy
- Computer Science Applications