Revision as of 12:30, 13 April 2020 edit Kokoo (talk \| contribs) 364 edits →Description ← Previous edit		Revision as of 14:23, 13 April 2020 edit undo Kokoo (talk \| contribs) 364 edits No edit summary Next edit →
Line 3: == Description == The proper generalized decomposition is characterized by a [[variational formulation]] of the problem, a discretization of the ___domain in the style of the [[finite element method]] and a numerical solution algorithm based on a [[greedy algorithm]] that assumes the solution as a separated representation. PGD assumes that the solution '''u''' of a multidimensional problem can be approximated as a separated representation '''u'''<sup>''N''</sup> of the form

Proper generalized decomposition: Difference between revisions