Abstract

Abstract

Dynamic Data-Driven Application Systems—DDDAS—appear as a new paradigm in the field of applied sciences and engineering, and in particular in Simulation-based Engineering Sciences. By DDDAS we mean a set of techniques that allow to link simulation tools with measurement devices for real-time control of systems and processes. In this paper a novel simulation technique is developed with an eye towards its employ in the field of DDDAS. The main novelty of this technique relies in the consideration of parameters of the model as new dimensions in the parametric space. Such models often live in highly multidimensional spaces suffering the so-called curse of dimensionality. To avoid this problem related to mesh-based techniques, in this work an approach based upon the Proper Generalized Decomposition—PGD—is developed, which is able to circumvent the redoubtable curse of dimensionality. The approach thus developed is composed by a marriage of DDDAS concepts and a combination of PGD “off-line” computations, linked to “on-line” post-processing. In this work we explore some possibilities in the context of process control, malfunctioning identification and system reconfiguration in real time, showing the potentialities of the technique in real engineering contexts.

Abstract

Optimization of manufacturing processes or structures involves the optimal choice of many parameters (process parameters, material parameters or geometrical parameters). Usual strategies proceed by defining a trial choice of those parameters and then solving the resulting model. Then, an appropriate cost function is evaluated and its optimality checked. While the optimum is not reached, the process parameters should be updated by using an appropriate optimization procedure, and then the model must be solved again for the updated process parameters. Thus, a direct numerical solution is needed for each choice of the process parameters, with the subsequent impact on the computing time. In this work we focus on shape optimization that involves the appropriate choice of some parameters defining the problem geometry. The main objective of this work is to describe an original approach for computing an off-line parametric solution. That is, a solution able to include information for different parameter values and also allowing to compute readily the sensitivities. The curse of dimensionality is circumvented by invoking the Proper Generalized Decomposition (PGD) introduced in former works, which is applied here to compute geometrically parametrized solutions

Abstract

This work presents a simple technique for real-time monitoring of thermal processes. Real-time simulationbased control of thermal processes is a big challenge because high-fidelity numerical simulations are costly and cannot be used, in general, for real-time decision making. Very often, processes are monitored or controlled with a few measurements at some specific points. Thus, the strategy presented here is centered on fast evaluation of the response only where it is needed. To accomplish this, classical harmonic analysis is combined with recent model reduction techniques. This leads to an advanced harmonic methodology, which solves in real-time the transient heat equation at the monitored point. In order to apply the reciprocity principle, harmonic analysis is used in the space-frequency domain. Then, Proper Generalized Decomposition, a reduced order approach, pre-computes a transfer function able to produce the output response for a given excitation. This transfer function is computed offline and only once. The response at the monitoring point can be recovered performing a computationally inexpensive post-processing step. This last step can be performed online for real-time monitoring of the thermal process. Examples show the applicability of this approach for a wide range of problems ranging from fast temperature evaluation to inverse problems.

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

In this paper we present the basics of a novel methodology for the development of simulation-based and augmented learning tools in the context of applied science and engineering. It is based on the extensive use of model order reduction, and particularly, of the so-called Proper Generalized Decomposition (PGD) method. This method provides a sort of meta-modeling tool without the need for prior computer experiments that allows the user to obtain real-time response in the solution of complex engineering or physical problems. This real-time capability also allows for its implementation in deployed, touch-screen, handheld devices or even to be immersed into electronic textbooks. We explore here the basics of the proposed methodology and give examples on a few challenging applications never until now explored, up to our knowledge.

Abstract

This paper proposes a generalized finite element method based on the use of parametric solutions as enrichment functions. These parametric solutions are precomputed off-line and stored in memory in the form of a computational vademecum so that they can be used on-line with negligible cost. This renders a more efficient computational method than traditional finite element methods at performing simulations of processes. One key issue of the proposed method is the efficient computation of the parametric enrichments. These are computed and efficiently stored in memory by employing proper generalized decompositions. Although the presented method can be broadly applied, it is particularly well suited in manufacturing processes involving localized physics that depend on many parameters, such as welding. After introducing the vademecum-generalized finite element method formulation, we present some numerical examples related to the simulation of thermal models encountered in welding processes.

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.

Abstract

Tensor representations allow compact storage and efficient manipulation of multi-dimensional data. Based on these, tensor methods build low-rank subspaces for the solution of multi-dimensional and multi-parametric models. However, tensor methods cannot always be implemented efficiently, specially when dealing with non-linear models. In this paper, we discuss the importance of achieving a tensor representation of the model itself for the efficiency of tensor-based algorithms. We investigate the adequacy of interpolation rather than projection-based approaches as a means to enforce such tensor representation, and propose the use of cross approximations for models in moderate dimension. Finally, linearization of tensor problems is analyzed and several strategies for the tensor subspace construction are proposed. This is a post-peer-review, pre-copyedit version of an article published in Journal of scientific computing