Proper generalized decomposition
Numerical method for solving boundary value problems
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.
Nº Q55080117 ★★
Uncommon · History
Proper generalized decomposition
Numerical method for solving boundary value problems
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.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
Broyden–Fletcher–Goldfarb–Shanno algorithm
Optimization method
Nº Q2877013 ★
Backward Euler method
Numerical method for solving differential equations
Nº Q2736820 ★★
Bailey–Borwein–Plouffe formula
Formula for calculating π
Nº Q803807 ★
Conjugate gradient method
Method to compute systems of linear equations whose matrix is symmetric positive-definite
Nº Q1191895 ★★
Korteweg–De Vries equation
Integrable partial differential equation of a function u(t,x): uₜ + uₓₓₓ = 6uuₓ
Nº Q601796 ★
D'Alembert's formula
Mathematical solution
Nº Q2388753 ★