TY - JOUR
T1 - On a Goal-Oriented Version of the Proper Generalized Decomposition Method
AU - Kergrene, Kenan
AU - Chamoin, Ludovic
AU - Laforest, Marc
AU - Prudhomme, Serge
N1 - KAUST Repository Item: Exported on 2021-04-13
Acknowledged KAUST grant number(s): CRG3, OCRF-2014-CRG
Acknowledgements: SP is grateful for the support by a Discovery Grant from the Natural Sciences and Engineering Research Council of Canada. He also acknowledges the support by KAUST under Award Number OCRF-2014-CRG3-2281. Moreover, the authors gratefully acknowledge Olivier Le Maître for fruitful discussions on the subject.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.
PY - 2019/2/11
Y1 - 2019/2/11
N2 - In this paper, we introduce, analyze, and numerically illustrate a goal-oriented version of the Proper Generalized Decomposition method. The objective is to derive a reduced-order formulation such that the accuracy in given quantities of interest is increased when compared to a standard Proper Generalized Decomposition method. Traditional goal-oriented methods usually compute the solution of an adjoint problem following the calculation of the primal solution for error estimation and adaptation. In the present work, we propose to solve the adjoint problem first, based on a reduced approach, in order to extract estimates of the quantities of interest and use this information to constrain the reduced primal problem. The resulting reduced-order constrained solution is thus capable of delivering more accurate estimates of the quantities of interest. The performance of the proposed approach is illustrated on several numerical examples.
AB - In this paper, we introduce, analyze, and numerically illustrate a goal-oriented version of the Proper Generalized Decomposition method. The objective is to derive a reduced-order formulation such that the accuracy in given quantities of interest is increased when compared to a standard Proper Generalized Decomposition method. Traditional goal-oriented methods usually compute the solution of an adjoint problem following the calculation of the primal solution for error estimation and adaptation. In the present work, we propose to solve the adjoint problem first, based on a reduced approach, in order to extract estimates of the quantities of interest and use this information to constrain the reduced primal problem. The resulting reduced-order constrained solution is thus capable of delivering more accurate estimates of the quantities of interest. The performance of the proposed approach is illustrated on several numerical examples.
UR - http://hdl.handle.net/10754/668693
UR - http://link.springer.com/10.1007/s10915-019-00918-1
UR - http://www.scopus.com/inward/record.url?scp=85061501846&partnerID=8YFLogxK
U2 - 10.1007/s10915-019-00918-1
DO - 10.1007/s10915-019-00918-1
M3 - Article
SN - 0885-7474
VL - 81
SP - 92
EP - 111
JO - Journal of Scientific Computing
JF - Journal of Scientific Computing
IS - 1
ER -