m (Cinmemj moved page Draft Samper 850654105 to Diez et al 2018a) |
|||
| Line 3: | Line 3: | ||
Proper Generalized Decomposition (PGD) is devised as a computational method to solve high-dimensional boundary value problems (where many dimensions are associated with the space of parameters defining the problem). The PGD philosophy consists in providing a separated representation of the multidimensional solution using a greedy approach combined with an alternated directions scheme to obtain the successive rank-one terms. This paper presents an algorithmic approach to high-dimensional tensor separation based on solving the Least Squares approximation in a separable format of multidimensional tensor using PGD. This strategy is usually embedded in a standard PGD code in order to compress the solution (reduce the number of terms and optimize the available storage capacity), but it stands also as an alternative and highly competitive method for tensor separation. | Proper Generalized Decomposition (PGD) is devised as a computational method to solve high-dimensional boundary value problems (where many dimensions are associated with the space of parameters defining the problem). The PGD philosophy consists in providing a separated representation of the multidimensional solution using a greedy approach combined with an alternated directions scheme to obtain the successive rank-one terms. This paper presents an algorithmic approach to high-dimensional tensor separation based on solving the Least Squares approximation in a separable format of multidimensional tensor using PGD. This strategy is usually embedded in a standard PGD code in order to compress the solution (reduce the number of terms and optimize the available storage capacity), but it stands also as an alternative and highly competitive method for tensor separation. | ||
| + | ==Full Document== | ||
<pdf>Media:Draft_Samper_850654105_6210_2018-CRSM-DZGH.pdf</pdf> | <pdf>Media:Draft_Samper_850654105_6210_2018-CRSM-DZGH.pdf</pdf> | ||
Latest revision as of 14:09, 12 March 2020
Abstract
Proper Generalized Decomposition (PGD) is devised as a computational method to solve high-dimensional boundary value problems (where many dimensions are associated with the space of parameters defining the problem). The PGD philosophy consists in providing a separated representation of the multidimensional solution using a greedy approach combined with an alternated directions scheme to obtain the successive rank-one terms. This paper presents an algorithmic approach to high-dimensional tensor separation based on solving the Least Squares approximation in a separable format of multidimensional tensor using PGD. This strategy is usually embedded in a standard PGD code in order to compress the solution (reduce the number of terms and optimize the available storage capacity), but it stands also as an alternative and highly competitive method for tensor separation.
Full Document
Document information
Published on 01/01/2018
DOI: 10.1016/j.crme.2018.04.011
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?