Content deleted Content added
No edit summary |
|||
Line 3:
== Description ==
The proper generalized decomposition is a method characterized by (1) a [[variational formulation]] of the problem, (2) a discretization of the [[Domain of a function|___domain]] in the style of the [[finite element method]], (3) the assumption
The most implemented variational formulation in PGD is the [[Bubnov-Galerkin method]],<ref name=":0">{{Cite thesis|title=Proper generalised decompositions: theory and applications|url=http://orca.cf.ac.uk/73515/|publisher=Cardiff University|date=2015-04-09|degree=phd|language=en|first=Thomas Lloyd David|last=Croft}}</ref><ref>{{Cite book|last=Chinesta|first=Francisco|url=https://www.springer.com/gp/book/9783319028644|title=The Proper Generalized Decomposition for Advanced Numerical Simulations: A Primer|last2=Keunings|first2=Roland|last3=Leygue|first3=Adrien|date=2014|publisher=Springer International Publishing|isbn=978-3-319-02864-4|series=SpringerBriefs in Applied Sciences and Technology|language=en}}</ref> although other implementations exist.<ref>{{Cite web|url=https://hal.archives-ouvertes.fr/tel-01926078/document|title=Advanced strategies for the separated formulation of problems in the Proper Generalized Decomposition framework|last=Aguado|first=José Vicente|date=18 Nov 2018|website=|url-status=live|archive-url=|archive-date=|access-date=}}</ref><ref name=":0" />
|