Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 507-525 |
Number of pages | 19 |
Journal | Computer Methods in Applied Mechanics and Engineering |
Volume | 317 |
DOIs | |
State | Published - Apr 15 2017 |
Externally published | Yes |
Keywords
- 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