Abstract

Solving the Helmholtz equation for a large number of input data in an heterogeneous media and unbounded domain still represents a challenge. This is due to the particular nature of the Helmholtz operator and the sensibility of the solution to small variations of the data. Here a reduced order model is used to determine the scattered solution everywhere in the domain for any incoming wave direction and frequency. Moreover, this is applied to a real engineering problem: water agitation inside real harbors for low to mid-high frequencies. The Proper Generalized Decomposition (PGD) model reduction approach is used to obtain a separable representation of the solution at any point and for any incoming wave direction and frequency. Here, its applicability to such a problem is discussed and demonstrated. More precisely, the contributions of the paper include the PGD implementation into a Perfectly Matched Layer framework to model the unbounded domain, and the separability of the operator which is addressed here using an efficient higher-order projection scheme. Then, the performance of the PGD in this framework is discussed and improved using the higher-order projection and a Petrov-Galerkin approach to construct the separated basis. Moreover, the efficiency of the higherorder projection scheme is demonstrated and compared with the higher-order singular value decomposition.

Abstract

Domain decomposition strategies and 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 midsurfaces, 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 solving a nonlinear problem to determine all the interface solutions. However, 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, and geometry) can also be incorporated in the explicit description of the solution.

Abstract

The NURBS-enhanced finite element method (NEFEM) combined with a hybridisable discontinuous Galerkin (HDG) approach is presented for the first time. The proposed technique completely eliminates the uncertainty induced by a polynomial approximation of curved boundaries that is common within an isoparametric approach and, compared to other DG methods, provides a significant reduction in number of degrees of freedom. In addition, by exploiting the ability of HDG to compute a postprocessed solution and by using a local a priori error estimate valid for elliptic problems, an inexpensive, reliable and computable error estimator is devised. The proposed methodology is used to solve Stokes flow problems using automatic degree adaptation. Particular attention is paid to the importance of an accurate boundary representation when changing the degree of approximation in curved elements. Several strategies are compared and the superiority and reliability of HDG-NEFEM with degree adaptation is illustrated.