This is the peer reviewed version of the following article: Huerta, A., Nadal, E., Chinesta, F. Proper generalized decomposition solutions within a domain decomposition strategy. "International journal for numerical methods in engineering", 30 Març 2018, vol. 113, núm. 13, p. 1972-1994, which has been published in final form at https://onlinelibrary.wiley.com/doi/full/10.1002/nme.5729. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.

Domain Decomposition strategies and the Proper Generalized Decomposition are efficiently combined to obtain a fast evaluation of the solution approximation in parameterized elliptic problems with complex geometries. The classical difficulties associated to the combination of layered domains with arbitrarily oriented mid-surfaces, which may require in-plane–out-of-plane techniques, are now dismissed. More generally, solutions on large domains can now be confronted within a Domain Decomposition approach. This is done with a reduced cost in the offline phase. Because, the Proper Generalized Decomposition gives an explicit description of the solution in each subdomain in terms of the solution at the interface. Thus, the evaluation of the approximation in each subdomain is a simple function evaluation given the interface values (and the other problem parameters). The interface solution can be characterized by any a priori user-defined approximation. Here, for illustration purposes, hierarchical polynomials are used. The repetitiveness of the subdomains is exploited to reduce drastically the offline computational effort. The online phase requires to solve a nonlinear problem to determine all the interface solutions. But this problem only has degrees of freedom on the interfaces and the Jacobian matrix is explicitly determined. Obviously, other parameters characterizing the solution (material constants, external loads, geometry) can also be incorporated in the explicit description of the solution.

Peer Reviewed