Proper generalized decomposition: Difference between revisions

Revision as of 15:10, 13 April 2020

Revision as of 15:11, 13 April 2020

Line 1:

{{Machine learning bar}}

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. The PGD algorithm computes an approximation of the theoretical 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, thus successively ''enriching'' the solution. By selecting only the first PGD modes, a [[reduced order model]] of the solution is obtained. ThereforeBecause of this, PGD is considered a [[dimensionality reduction]] algorithm.

== Description ==