Abstract

In this paper two different approximations for the solution of high-order problems by proper generalized decompositions (PGD) are developed. The first one is based upon the use of collocation techniques, along with Chebyshev polynomials, while the second employs Hermite polynomials in a Galerkin framework. Both approaches having pros and cons, they are studied with the help of some classical benchmark tests.