# Proper generalized decomposition

## From Wikipedia, the free encyclopedia

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.

Part of a series on |

Machine learning and data mining |
---|

Problems |

Learning with humans |

Model diagnostics |

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.

Oops something went wrong: