This paper revisits a new model reduction methodology based on the use of separated representations, the so called Proper Generalized Decomposition—PGD. Space and time separated representations generalize Proper Orthogonal Decompositions—POD—avoiding any a priori knowledge on the solution in contrast to the vast majority of POD based model reduction technologies as well as reduced bases approaches. Moreover, PGD allows to treat efficiently models defined in degenerated domains as well as the multidimensional models arising from multidimensional physics (quantum chemistry, kinetic theory descriptions,…) or from the standard ones when some sources of variability are introduced in the model as extra-coordinates.

This paper revisits a powerful discretization technique, the Proper Generalized Decomposition—PGD, illustrating its ability for solving highly multidimensional models. This technique operates by constructing a separated representation of the solution, such that the solution complexity scales linearly with the dimension of the space in which the model is defined, instead the exponentially-growing complexity characteristic of mesh based discretization strategies. The PGD makes possible the efficient solution of models defined in multidimensional spaces, as the ones encountered in quantum chemistry, kinetic theory description of complex fluids, genetics (chemical master equation), financial mathematics, … but also those, classically defined in the standard space and time, to which we can add new extra-coordinates (parametric models, …) opening numerous possibilities (optimization, inverse identification, real time simulations, …).

In this paper we are addressing a new paradigm in the field of simulation-based engineering sciences (SBES) to face the challenges posed by current ICT technologies. Despite the impressive progress attained by simulation capabilities and techniques, some challenging problems remain today intractable. These problems, that are common to many branches of science and engineering, are of different nature. Among them, we can cite those related to high-dimensional problems, which do not admit mesh-based approaches due to the exponential increase of degrees of freedom. We developed in recent years a novel technique, called Proper Generalized Decomposition (PGD). It is based on the assumption of a separated form of the unknown field and it has demonstrated its capabilities in dealing with high-dimensional problems overcoming the strong limitations of classical approaches. But the main opportunity given by this technique is that it allows for a completely new approach for classic problems, not necessarily high dimensional. Many challenging problems can be efficiently cast into a multidimensional framework and this opens new possibilities to solve old and new problems with strategies not envisioned until now. For instance, parameters in a model can be set as additional extra-coordinates of the model. In a PGD framework, the resulting model is solved once for life, in order to obtain a general solution that includes all the solutions for every possible value of the parameters, that is, a sort of computational vademecum. Under this rationale, optimization of complex problems, uncertainty quantification, simulation-based control and real-time simulation are now at hand, even in highly complex scenarios, by combining an off-line stage in which the general PGD solution, the vademecum, is computed, and an on-line phase in which, even on deployed, handheld, platforms such as smartphones or tablets, real-time response is obtained as a result of our queries.

Summary Karhunen-Loève expansion and snapshot POD are based on principal component analysis of series of data. They provide basis vectors of the subspace spanned by the data. All the data must be taken into account to find the basis vectors. These methods are not convenient for any improvement of the basis vectors when new data are added into the data base. We consider the data as a state evolution and we propose an incremental algorithm to build basis functions for the decomposition of this state evolution. The proposed algorithm is based on the APHR method (A Priori Hyper-Reduction method). This is an adaptive strategy to build reduced order model when the state evolution is implicitely defined by non-linear governing equations. In case of known state evolutions the APHR method is an incremental Karhunen-Loève decomposition. This approach is very convenient to expand the subspace spanned by the basis functions. In the first part of the present paper the main concepts related to the “a priori” model reduction technique are revisited, as a previous task to its application in the cases considered in the next sections. Some engineering problems are defined in domains that evolve in time. When this evolution is large the present and the reference configurations differ significantly. Thus, when the problem is formulated in the total Lagrangian framework frequent remeshing is required to avoid too large distortions of the finite element mesh. Other possibility for describing these models lies in the use of an updated formulation in which the mesh is conformed to each intermediate configuration. When the finite element method is used, then frequent remeshing must be carried out to perform an optimal meshing at each intermediate configuration. However, when the natural element method, a novel meshless technique, is considered, whose accuracy does not depend significantly on the relative position of the nodes, then large simulations can be performed without any remeshing stage, being the nodal position at each intermediate configuration defined by the transport of the nodes by the material velocity or the advection terms. Thus, we analyze the extension of the “a priori” model reduc tion, based on the use in tandem of the Karhunen-Loève decomposition (that extracts significant information) and an approximation basis enrichment based on the use of the Krylov's subspaces, previously proposed in the framework of fixed mesh simulation, to problems defined in domains evolving in time. Finally, for illustrating the technique capabilities, the “a priori” model reduction will be applied for solving the kinetic theory model which governs the orientation of the fibers immersed in a Newtonian flow.