Proper generalized decomposition: Difference between revisions

Revision as of 07:19, 4 May 2021

Revision as of 07:30, 4 May 2021

Line 2:

The '''proper generalized decomposition''' ('''PGD''') is an [[iterative method|iterative]] [[numerical method]] for solving [[boundary value problem]]s (BVPs), that is, [[partial differential equation]]s constrained by a set of boundary conditions, such as the [[Poisson's equation]] or the [[Laplace's equation]].

The PGD algorithm computes an approximation of the solution of the BVP by successive enrichment. This means that, in each iteration, a new component (or ''mode'') is computed and added to the approximation. TheIn principle, the more modes obtained, the closer the approximation is to its theoretical solution., although the [[greedy algorithm|greedy]] nature of the algorithm may result in some modes failing to meet this.

By selecting only the most relevant PGD modes, a [[reduced order model]] of the solution is obtained. Because of this, PGD is considered a [[dimensionality reduction]] algorithm. In addition, it is considered as a generalized form of the [[proper orthogonal decomposition]].

== Description ==