Revision as of 23:45, 8 December 2020 edit Monkbot (talk \| contribs) Bots 3,695,952 edits m Task 18 (cosmetic): eval 7 templates: del empty params (16×); del \|url-status= (1×); Tag: AWB ← Previous edit		Revision as of 14:12, 26 April 2021 edit undo Kokoo (talk \| contribs) 364 edits correction Tag: Visual edit Next edit →
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. 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. The more modes obtained, the closer the approximation is to its theoretical solution. By selecting only the ~~first~~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 ==

Proper generalized decomposition: Difference between revisions