Proper generalized decomposition

The proper generalized decomposition (PGD) is an iterative numerical method for solving boundary value problems (BVPs), that is, partial differential equations constrained by a set of boundary conditions, such as the Poisson's equation or…

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

The proper generalized decomposition (PGD) is an iterative numerical method for solving boundary value problems (BVPs), that is, partial differential equations 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. In principle, the more modes obtained, the closer the approximation is to its theoretical solution. Unlike POD principal components, PGD modes are not necessarily orthogonal to each other.

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. \mathbf{u} \approx \mathbf{u}^N(x_1, x_2, \ldots, x_d) = \sum_{i=1}^N \mathbf{X_1}_i(x_1) \cdot \mathbf{X_2}_i(x_2) \cdots \mathbf{X_d}_i(x_d), where the number of addends N and the functional products X 1 (x 1 ), X 2 (x 2 ), ..., X d (x d ), each depending on a variable (or variables), are unknown beforehand. \mathbf{u} \approx \mathbf{u}^N(x_1, \ldots, x_d; k_1, \ldots, k_p) = \sum_{i=1}^N \mathbf{X_1}_i(x_1) \cdots \mathbf{X_d}_i(x_d) \cdot \mathbf{K_1}_i(k_1) \cdots \mathbf{K_p}_i(k_p), where a series of functional products K 1 (k 1 ), K 2 (k 2 ), ..., K p (k p ), each depending on a parameter (or parameters), has been incorporated to the equation.

In this case, the obtained approximation of the solution is called computational vademecum: a general meta-model containing all the particular solutions for every possible value of the involved parameters.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1371309441 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

8 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.