|
Abstract:
|
In its original conception, proper generalized decomposition (PGD) provides explicit parametric solutions, denoted as computational vademecums or digital abacuses, to parametric boundary value problems. The PGD approach is extended here to devise a set of algebraic tools enabling to operate with multidimensional tensor data. These tools are designed to store, compress and perform basic operations (in particular divisions) with tensors in separable format. These tools are directly producing the computational vademecums for the resulting high-dimensional tensor data. Thus, the general methodology enables performing nontrivial operations (storage, compression, division, solving linear systems of equations...) for multidimensional tensor data. The idea is based on the principle of the PGD separation, that produces a separable least squares approximation of any multidimensional function. The PGD compression is a particular case, extensively used in practice to compact the separable solution without loss of accuracy. Here, this concept is applied to algebraic tensor structures that are also seen as functions in multidimensional Cartesian domains. Moreover, a straightforward extension of this concept is devised to operate with multidimensional objects stored in the separable format. That allows creating a toolbox of PGD arithmetic operators that is publicly released at https://git.lacan.upc.edu/zlotnik/algebraicPGDtools. Numerical tests demonstrate the performance and efficiency of the toolbox, both for tensor data handling and operation and also in applications pertaining to the discretized version of boundary value problems. |
