A priori tensor approximations for the numerical solution of high dimensional problems: alternative definitions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

A priori tensor approximations for the numerical solution of high dimensional problems: alternative definitions

Résumé

Model reduction techniques based on the construction of separated representations are receiving a growing interest in scientific computing. A family of methods, recently called Proper Generalized Decomposition (PGD) methods, have been introduced for the a priori construction of separated representations of the solution of problems defined in tensor product spaces. Different definitions of PGDs and associated algorithms have been proposed. Here, we review classical definitions of progressive PGDs and we introduce several variants in order to improve convergence properties. In particular, we introduce the Minimax PGD, recently proposed for evolution problems, which can be interpreted as a Petrov-Galerkin model reduction technique. The different variants are presented in an abstract setting. Model examples will illustrate some properties of the different variants of PGDs.
Fichier principal
Vignette du fichier
paper_nouy_ect_2010.pdf (236.01 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00664061 , version 1 (28-01-2012)
hal-00664061 , version 2 (20-02-2012)

Identifiants

Citer

Anthony Nouy. A priori tensor approximations for the numerical solution of high dimensional problems: alternative definitions. The Seventh International Conference on Engineering Computational Technology (ECT2010), Sep 2010, Valencia, Spain. Paper 44, ⟨10.4203/ccp.94.44⟩. ⟨hal-00664061v2⟩
359 Consultations
451 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More