Skip to main content
  • Research article
  • Open access
  • Published:

A separated representation involving multiple time scales within the Proper Generalized Decomposition framework


Solutions of partial differential equations can exhibit multiple time scales. Standard discretization techniques are constrained to capture the finest scale to accurately predict the response of the system. In this paper, we provide an alternative route to circumvent prohibitive meshes arising from the necessity of capturing fine-scale behaviors. The proposed methodology is based on a time-separated representation within the standard Proper Generalized Decomposition, where the time coordinate is transformed into a multi-dimensional time through new separated coordinates, each representing one scale, while continuity is ensured in the scale coupling. For instance, when considering two different time scales, the governing Partial Differential Equation is commuted into a nonlinear system that iterates between the so-called microtime and macrotime, so that the time coordinate can be viewed as a 2D time. The macroscale effects are taken into account by means of a finite element-based macro-discretization, whereas the microscale effects are handled with unidimensional parent spaces that are replicated throughout the time domain. The resulting separated representation allows us a very fine time discretization without impacting the computational efficiency. The proposed formulation is explored and numerically verified on thermal and elastodynamic problems.


Many engineering problems are defined in very large time intervals (e.g., when dealing with fatigue, aging, dynamics with loadings involving multiple characteristic times) and, at the same time, the response must encompass the different time scales present in the model. Following standard time marching approaches, a suitable time step that captures the evolution of the finest scale has to be adopted to ensure a reliable modeling, deriving into a prohibitive simulation cost. Many numerical algorithms have been proposed to bypass the time marching approach up to the finest time scale.

For instance, when only macro-scale effects are envisaged, time-homogenization techniques perform well, although subject to a number of hypotheses which are not always realistic, as well as to the scale separation.

In [1], it is proposed a technique that makes use of the separation of variables. The time domain is partitioned into a number of subdomains, where times defining the subdomain partition describe the macrotime, whereas the subdomain discretization resolves fast responses (microtime). The main issue characterizing this technique is the necessity of ensuring the continuity of the resulting two-scale discretization. Lagrange multipliers are adopted for this purpose. This choice makes substantially prohibitive the computational implementation associated with this procedure.

In [2,3,4] a numerical algorithm based on the LArge Time INcrement-Proper Generalized Decomposition (LATIN-PGD) is presented. Temporal and spatial multi-scale behaviors in solid mechanic problems are handled by associating a temporal macro basis with the interfacial degrees of freedom coupling different macro domains. The scalability of the methodology is restored via an appropriate correction of the temporal basis founded on the residual.

Also in [5], the time domain is partitioned into subintervals, and a common reduced basis is adopted in every subinterval. Afterwards, additional interface restrictions are imposed to ensure the continuity of the primal variable and of the associated time derivative. Hence, values at the endpoints of each macro interval are enforced to vanish, and the offset is calculated on the macro discretization.

An alternative view is proposed in [6, 7], within the so-called Parareal scheme, that iterates between macro and micro domain partitions, so that the initial conditions for each micro interval are provided by the macro resolution of the problem. The algorithm is easily parallelizable, making it very efficient for addressing general models.

Another numerical strategy based on combining different PGDs under the partition of unity (PU) rationale is proposed in [8, 9]. Here, the main idea is to use macro shape functions fulfilling the partition of unity. This ensures moving throughout different PGDs in diverse intervals while guaranteeing a perfect continuity. Actually, the overlap between the PGDs solutions related to the overlapping subdomains ensures the continuity when the PGDs solutions are multiplied by the macroscopic shape functions thanks to the standard PU features. Despite its effectiveness, the necessity of combining microscopic discretization with the macroscopic PU enrichment, hinders the computational implementation of this approach.

This paper aims at computing the time evolution of the unknown fields involved by a multiscale Partial Differential Equation (PDE), taking into account all the information that it involves, i.e., covering all the time scales. The solution procedure that we are proposing includes neither major hypotheses, nor the need of time scale separation, as for time homogenization techniques. In more detail, the new approach ensures continuity in a direct and computationally inexpensive manner without resorting to the use of Lagrange multipliers, penalty or the PU paradigm. Our proposal directly derives from the discrete tensor formulation of the separated representation involved in the PGD constructor, making use of a tensor formalism. For that purpose, in the next section, after providing the basics for a PGD tensor representation,Footnote 1 we introduce the new approach to manage temporal multi-scale problems and we apply it to the heat equation. In “Multiscale resolution of transient elastodynamic problems” section we extend such an approach to computational solid mechanics and, more concretely, to elastodynamics. Finally “Conclusion” section shortly summarizes the main achievements of the present work.

Time multiscale with PGD

Tensor-based PGD methods

Here we shortly recall the PGD algorithm in a general tensor framework, as described in [13, 14]. For a detailed formalization of the PGD method, we refer the interested reader, e.g., to [15,16,17,18,19,20]. The solution of a multidimensional problem is built as a sum of tensor products of functions defined in some sub-spaces with moderate dimension (1, 2 or 3), thus providing a general separable representation form. In particular, the authors make use of the best rank-1 approximation property of tensors of order 3 or higher [21] (in [22], it has been proved that tensors of order 3 or higher can fail to have best rank-n approximation) to propose an iterative method based on the so-called projection-enrichment technique [13].

Let \(\Omega \) be a multidimensional domain involving several coordinates \(x_i\) (not necessarily one-dimensional), which can coincide, for instance, with spatial coordinates, time, model or geometric parameters. We consider the weak formulation of a linear problem:

$$\begin{aligned} \begin{aligned}&\textit{Find}\, \psi \in V( \Omega ) \textit{ s.t. } \\&a( \psi ( x_1, \dots , x_d ), \psi ^*( x_1, \dots , x_d ) ) = b(\psi ^*( x_1, \dots , x_d )) \quad \forall \psi ^*\in V( \Omega ), \end{aligned} \end{aligned}$$

with \(V(\Omega )\) an adequate function space ensuring the well-posedness of such a formulation.

We assume that, after a discretization of problem (1), we are lead to solve the linear system:

$$\begin{aligned} {{}^{\mathrm{t}}{{{\,\mathrm{\varvec{\uppsi }}\,}}^*}} \mathcal {A} {{\,\mathrm{\varvec{\uppsi }}\,}}= {{}^{\mathrm{t}}{{{\,\mathrm{\varvec{\uppsi }}\,}}^*}} \mathcal {B}, \end{aligned}$$

where the operator on the left-hand side and the right-hand side member are expressed in a separated form as

$$\begin{aligned} {{\,\mathrm{\mathcal {A}}\,}}= \sum _{ k = 1 }^{N_A} {{\,\mathrm{\mathbf {A}}\,}}_1^k \otimes {{\,\mathrm{\mathbf {A}}\,}}_2^k \otimes \cdots \otimes {{\,\mathrm{\mathbf {A}}\,}}_d^k, \quad {{\,\mathrm{\mathcal {B}}\,}}= \sum _{ k = 1 }^{N_B} {{\,\mathrm{\mathbf {b}}\,}}_1^k \otimes {{\,\mathrm{\mathbf {b}}\,}}_2^k \otimes \cdots \otimes {{\,\mathrm{\mathbf {b}}\,}}_d^k. \end{aligned}$$

The approximated PGD solution \({{\,\mathrm{\varvec{\uppsi }}\,}}\) is sought in the discrete separated form

$$\begin{aligned} {{\,\mathrm{\varvec{\uppsi }}\,}}= \sum _{ j = 1 }^{N_F} \alpha _j {{\,\mathrm{\mathbf {f}}\,}}_1^j \otimes {{\,\mathrm{\mathbf {f}}\,}}_2^j \otimes \ldots \otimes {{\,\mathrm{\mathbf {f}}\,}}_d^j, \end{aligned}$$

and an analogous representation is adopted for the test function \({{\,\mathrm{\varvec{\uppsi }}\,}}^*\), being

$$\begin{aligned} {{\,\mathrm{\varvec{\uppsi }}\,}}^*={{\,\mathrm{\mathbf {f}}\,}}_1^i \otimes {{\,\mathrm{\mathbf {f}}\,}}_2^i \otimes \ldots \otimes {{\,\mathrm{\mathbf {f}}\,}}_d^i, \end{aligned}$$

with \(i=1, \ldots , N_F\).

Solution \({{\,\mathrm{\varvec{\uppsi }}\,}}\) is built-up by using a projection-enrichment iterative scheme [13]. In particular, it will be assumed that the global convergence is attained when the error estimator \(\varepsilon = \left| \left| {{\,\mathrm{\mathcal {A}}\,}}{{\,\mathrm{\varvec{\uppsi }}\,}}- {{\,\mathrm{\mathcal {B}}\,}}\right| \right| _2\) is small enough, where \(\left| \left| \cdot \right| \right| _2\) denotes the standard Frobenius norm of a tensor of order d.

The projection stage consists of finding the set of coefficients \(\alpha _j\) in (4) verifying the relations

$$\begin{aligned} \sum _{ j = 1 }^{N_F} H_{ij} \alpha _j = J_i \quad \forall i = 1, \dots , N_F \end{aligned}$$


$$\begin{aligned} H_{ij}&= \sum _{ k = 1 }^{N_A} \left( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {f}}\,}}_1^i} {{\,\mathrm{\mathbf {A}}\,}}_1^k {{\,\mathrm{\mathbf {f}}\,}}_1^j \right) \cdot \left( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {f}}\,}}_2^i} {{\,\mathrm{\mathbf {A}}\,}}_2^k {{\,\mathrm{\mathbf {f}}\,}}_2^j \right) \cdot \ldots \cdot \left( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {f}}\,}}_d^i} {{\,\mathrm{\mathbf {A}}\,}}_d^k {{\,\mathrm{\mathbf {f}}\,}}_d^j \right) ,\\ J_i&= \sum _{ k = 1 }^{N_B} \left( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {f}}\,}}_1^i} {{\,\mathrm{\mathbf {b}}\,}}_1^k \right) \cdot \left( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {f}}\,}}_2^i} {{\,\mathrm{\mathbf {b}}\,}}_2^k \right) \cdot \ldots \cdot \left( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {f}}\,}}_d^i} {{\,\mathrm{\mathbf {b}}\,}}_d^k \right) . \end{aligned}$$

The enrichment stage includes new candidates for enriching the reduced separated approximation basis, so that \({{\,\mathrm{\varvec{\uppsi }}\,}}\) can be updated as

$$\begin{aligned} {{\,\mathrm{\varvec{\uppsi }}\,}}= \underset{ {=:}{{\,\mathrm{\varvec{\uppsi }}\,}}_{{{\,\mathrm{\mathbf {f}}\,}}} }{\underbrace{\sum _{ j = 1 }^{N_F} \alpha _j {{\,\mathrm{\mathbf {f}}\,}}_1^j \otimes {{\,\mathrm{\mathbf {f}}\,}}_2^j \otimes \cdots \otimes {{\,\mathrm{\mathbf {f}}\,}}_d^j}} + \underset{ {=:}{{\,\mathrm{\varvec{\uppsi }}\,}}_{{{\,\mathrm{\mathbf {r}}\,}}} }{\underbrace{ {{\,\mathrm{\mathbf {r}}\,}}_1 \otimes {{\,\mathrm{\mathbf {r}}\,}}_2 \otimes \cdots \otimes {{\,\mathrm{\mathbf {r}}\,}}_d }}, \end{aligned}$$

and (2) is replaced by the system

$$\begin{aligned} {}^{\mathrm{t}}{{{\,\mathrm{\varvec{\uppsi }}\,}}^*} \mathcal {A} {{\,\mathrm{\varvec{\uppsi }}\,}}_{{{\,\mathrm{\mathbf {r}}\,}}}+ {}^{\mathrm{t}}{{{\,\mathrm{\varvec{\uppsi }}\,}}^*} \mathcal {A} {{\,\mathrm{\varvec{\uppsi }}\,}}_{{{\,\mathrm{\mathbf {f}}\,}}} = {}^{\mathrm{t}}{{{\,\mathrm{\varvec{\uppsi }}\,}}^*} \mathcal {B}. \end{aligned}$$

In particular, within a fixed point alternating direction algorithm, at each iteration we look for the computation of a single discrete function, \({{\,\mathrm{\mathbf {r}}\,}}_j\), all the other components of \({{\,\mathrm{\varvec{\uppsi }}\,}}_{{{\,\mathrm{\mathbf {r}}\,}}}\) being assumed known, and after setting \({{\,\mathrm{\varvec{\uppsi }}\,}}^*\) to \({{\,\mathrm{\mathbf {r}}\,}}_1 \otimes \cdots {{\,\mathrm{\mathbf {r}}\,}}_{j-1} \otimes {{\,\mathrm{\mathbf {r}}\,}}_{j}^*\otimes {{\,\mathrm{\mathbf {r}}\,}}_{j+1}\cdots \otimes {{\,\mathrm{\mathbf {r}}\,}}_d\). This strategy leads to solve the linear system

$$\begin{aligned} {{\,\mathrm{\mathbf {K}}\,}}{{\,\mathrm{\mathbf {r}}\,}}_j + {{\,\mathrm{\mathbf {v}}\,}}= \tilde{{{\,\mathrm{\mathbf {v}}\,}}}, \end{aligned}$$


$$\begin{aligned} \begin{aligned} {{\,\mathrm{\mathbf {K}}\,}}&= \sum _{ k = 1 }^{N_A} \bigg ( {{\,\mathrm{\mathbf {A}}\,}}_j^k \prod _{ \begin{array}{c} h = 1\\ h \ne j \end{array} }^{d} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {r}}\,}}_h} {{\,\mathrm{\mathbf {A}}\,}}_h^k {{\,\mathrm{\mathbf {r}}\,}}_h \bigg ),\\ {{\,\mathrm{\mathbf {v}}\,}}&= \sum _{i = 1}^{N_F} \sum _{ k = 1 }^{N_A} \bigg ( \alpha _i {{\,\mathrm{\mathbf {A}}\,}}_j^k {{\,\mathrm{\mathbf {f}}\,}}_j^i \prod _{ \begin{array}{c} h = 1\\ h \ne j \end{array} }^{d} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {r}}\,}}_h} {{\,\mathrm{\mathbf {A}}\,}}_h^k {{\,\mathrm{\mathbf {f}}\,}}_h^i \bigg ), \quad \tilde{{{\,\mathrm{\mathbf {v}}\,}}} = \sum _{k = 1}^{N_B} \bigg ( {{\,\mathrm{\mathbf {b}}\,}}_j^k \prod _{ \begin{array}{c} h = 1\\ h \ne j \end{array} }^{d} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {r}}\,}}_h} {{\,\mathrm{\mathbf {b}}\,}}_h^k \bigg ). \end{aligned} \end{aligned}$$

For the explicit computations leading to system (8), we refer the interested reader to [13], whereas a convergence analysis for this greedy rank-1 update algorithm can be found in [21].

Remark 0.1

The projection in (5) does not represent the only possible choice when defining \({{\,\mathrm{\varvec{\uppsi }}\,}}\). Alternatively, one could use a standard greedy-based enrichment [14, 21]. The aim of the projection is to regularize the solution, thus getting rid of possible spurious modes yielded by an enrichment procedure and, consequently, to enhance the global convergence. Indeed, since modes are normalized, coefficients \(\alpha _j\) in (5) can be intended as a truncation error since they express the importance of the different enrichment terms. This allows us to stop the enrichment procedure when not significant modes occur, thus limiting the inclusion of noisy information.

Remark 0.2

As discussed in [13], the convergence of the fixed point strategy characterizing the enrichment step is guaranteed for symmetric discrete operators. Actually, numerical tests performed with non symmetric discrete operators (e.g., with hyperbolic operators) exhibit some difficulties in the convergence of the fixed point procedure as well as a loss of optimality in terms of number of function products to be computed. For this reason, all the problems analyzed in this work are suitably rewritten in order to deal with a symmetric operator. In general, the new problem to be solved reads:

$$\begin{aligned} {{}^{\mathrm{t}}{{{\,\mathrm{\varvec{\uppsi }}\,}}^*}} {}^{\mathrm{t}}{\mathcal {A}} \mathcal {A} {{\,\mathrm{\varvec{\uppsi }}\,}}= {{}^{\mathrm{t}}{{{\,\mathrm{\varvec{\uppsi }}\,}}^*}} {}^{\mathrm{t}}{\mathcal {A}} \mathcal {B}, \end{aligned}$$

and the associated projection stage becomes

$$\begin{aligned} \sum _{ j = 1 }^{N_F} H^S_{ij} \alpha _j = J^S_i \quad \forall i = 1, \dots , N_F \end{aligned}$$


$$\begin{aligned} H^S_{ij}&= \sum _{ k' = 1 }^{N_A} \sum _{ k = 1 }^{N_A} \left( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {f}}\,}}_1^i} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {A}}\,}}}_1^{k'} {{\,\mathrm{\mathbf {A}}\,}}_1^k {{\,\mathrm{\mathbf {f}}\,}}_1^j \right) \cdot \left( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {f}}\,}}_2^i} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {A}}\,}}}_2^{k'} {{\,\mathrm{\mathbf {A}}\,}}_2^k {{\,\mathrm{\mathbf {f}}\,}}_2^j \right) \cdot \ldots \cdot \left( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {f}}\,}}_d^i} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {A}}\,}}}_d^{k'} {{\,\mathrm{\mathbf {A}}\,}}_d^k {{\,\mathrm{\mathbf {f}}\,}}_d^j \right) ,\\ J^S_i&= \sum _{ k' = 1 }^{N_A} \sum _{ k = 1 }^{N_B} \left( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {f}}\,}}_1^i} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {A}}\,}}}_1^{k'} {{\,\mathrm{\mathbf {b}}\,}}_1^k \right) \cdot \left( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {f}}\,}}_2^i} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {A}}\,}}}_2^{k'} {{\,\mathrm{\mathbf {b}}\,}}_2^k \right) \cdot \ldots \cdot \left( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {f}}\,}}_d^i} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {A}}\,}}}_d^{k'} {{\,\mathrm{\mathbf {b}}\,}}_d^k \right) . \end{aligned}$$

Analogously, system (7) will be replaced by the new one

$$\begin{aligned} {{}^{\mathrm{t}}{{{\,\mathrm{\varvec{\uppsi }}\,}}^*}} {}^{\mathrm{t}}{{{\,\mathrm{\mathcal {A}}\,}}} {{\,\mathrm{\mathcal {A}}\,}}{{\,\mathrm{\varvec{\uppsi }}\,}}_{{{\,\mathrm{\mathbf {r}}\,}}} + {{}^{\mathrm{t}}{{{\,\mathrm{\varvec{\uppsi }}\,}}^*}}{}^{\mathrm{t}}{{{\,\mathrm{\mathcal {A}}\,}}} {{\,\mathrm{\mathcal {A}}\,}}{{\,\mathrm{\varvec{\uppsi }}\,}}_{{{\,\mathrm{\mathbf {f}}\,}}} = {{}^{\mathrm{t}}{{{\,\mathrm{\varvec{\uppsi }}\,}}^*}}{}^{\mathrm{t}}{{{\,\mathrm{\mathcal {A}}\,}}} {{\,\mathrm{\mathcal {B}}\,}}, \end{aligned}$$

so that system (8) takes the form

$$\begin{aligned} {{\,\mathrm{\mathbf {K}}\,}}^S {{\,\mathrm{\mathbf {r}}\,}}_j + {{\,\mathrm{\mathbf {v}}\,}}^S = \tilde{{{\,\mathrm{\mathbf {v}}\,}}}^S, \end{aligned}$$


$$\begin{aligned} {{{\,\mathrm{\mathbf {K}}\,}}^S}&= \sum _{ k' = 1 }^{N_A} \sum _{ k = 1 }^{N_A} \bigg ( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {A}}\,}}}_j^{k'} {{\,\mathrm{\mathbf {A}}\,}}_j^k \prod _{ \begin{array}{c} h = 1\\ h \ne j \end{array} }^{d} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {r}}\,}}_h} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {A}}\,}}}_h^{k'}{{\,\mathrm{\mathbf {A}}\,}}_h^k {{\,\mathrm{\mathbf {r}}\,}}_h \bigg ), \\ {{{\,\mathrm{\mathbf {v}}\,}}^S}&= \sum _{i = 1}^{N_F} \sum _{ k' = 1 }^{N_A} \sum _{ k = 1 }^{N_A} \bigg ( \alpha _i {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {A}}\,}}}_j^{k'} {{\,\mathrm{\mathbf {A}}\,}}_j^k {{\,\mathrm{\mathbf {f}}\,}}_j^i \prod _{ \begin{array}{c} h = 1\\ h \ne j \end{array} }^{d} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {r}}\,}}_h} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {A}}\,}}}_h^{k'} {{\,\mathrm{\mathbf {A}}\,}}_h^k {{\,\mathrm{\mathbf {f}}\,}}_h^i \bigg ), \\ {\tilde{{{\,\mathrm{\mathbf {v}}\,}}}^S}&= \sum _{k' = 1}^{N_A} \sum _{k = 1}^{N_B} \bigg ( {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {A}}\,}}}_j^{k'} {{\,\mathrm{\mathbf {b}}\,}}_j^k \prod _{ \begin{array}{c} h = 1\\ h \ne j \end{array} }^{d} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {r}}\,}}_h} {}^{\mathrm{t}}{{{\,\mathrm{\mathbf {A}}\,}}}_h^{k'} {{\,\mathrm{\mathbf {b}}\,}}_h^k\bigg ). \end{aligned}$$

A two-time scale separated representation within the PGD method

In the proposal of numerical methods to manage multi-scale phenomena, a crucial point is represented by the capability to ensure the continuity of the approximation. This turns out to be an issue also when dealing with a PGD approach. For instance, in [9], PGD is combined with the partition of unity (PU) paradigm to circumvent the continuity problem. Thus, a generic multiscale function u is expressed as

$$\begin{aligned} u(x) = \sum _{ i = 1 }^N N_i(x) u_i \sum _{ j = 1 }^J G_j( {\xi } (x - x_i) ) g_j, \end{aligned}$$

where the collection, \(\{x_i\}_{i=1}^N\), of the so-called centroids \(x_i\) introduces a macro-partition of the time window, \(N_i(x)\) is the macroscale shape function associated with the i-th centroid, \(x_i\), \({\xi } (x - x_i)\) is a dependent variable characterized by an offset based on \(x_i\), and \(G_j({\xi })\) denotes the j-th microscale shape function, with \(g_j\) the corresponding microscale degree of freedom. Here, the microscale effects occurring in the compact support of the macroscale shape function \(N_i(x)\) are mapped into the corresponding microscale space, via \({\xi }\). Formulation (9) allows the authors to automatically ensure the continuity to the approximation u as proved in [9]. Other formulations enforce the continuity in different way, for instance by resorting to Lagrange multipliers as in [1].

The present work takes a step forward with respect to the available literature by proposing a new approach which ensures the continuity of the PGD solution in a computationally inexpensive manner, without resorting to Lagrange multipliers or penalization strategies.

We exemplify the new method on a simple problem, i.e., on the heat equation solved in a one-dimensional spatial domain \(\Omega _{x} = (0,L)\) over the time window \(\Omega _t = (0, T_f)\), and completed with non homogeneous Dirichlet data,

$$\begin{aligned} \left\{ \begin{array}{ll} \displaystyle \frac{\partial u}{\partial t} - k \frac{\partial ^2 u}{\partial {x}^2} = f \quad &{} \text { in } \Omega _x \times \Omega _t \\[3mm] u(x, 0) = u_0(x) &{} \text { in } \Omega _x\\ u(0, t) = u(L, t) = u_g(t) &{} \text { in } \Omega _t, \end{array} \right. \end{aligned}$$

with k the diffusivity coefficient and \(f=f(x,t)\) the source term.

A standard time-marching approach requires a discretization of \(\Omega _{t}\) by means of \(N_t\) times. On the contrary, the technique here presented is based on splitting the whole time interval \((0,T_{f})\) into M macro subintervals \(\Omega _{i+1} = [T_i,T_{i+1}]\), for \(i = 0,\dots , M-1\), of constant amplitude \(\Delta T\), by choosing a sequence \(\left\{ T_i \right\} _{i=0}^{M}\) of equispaced macro-dofs and by setting \(T_0 = 0\) and \(T_M = T_f\). Afterwards, in the first macro subinterval, a new continuous time-microscale, \(\tau (\Omega _1)\), is introduced so that the subinterval \(\Omega _1\) is discretized by involving \(m + 1\) micro-dofs, \(\{\tau _j^1\}_{j=0}^m\) and setting \(\tau _0^1 = T_0\). Also the discretization at the microscale is uniform, with a constant time step set to \(\Delta \tau \) throughout \(\Omega _{1}\). Moreover, the last micro-dof is internal to \(\Omega _1\), being \(\tau ^1_m=T_1-\Delta \tau \). By means of a tensor product, the micro discretization in \(\Omega _1\) is replicated throughout the other subintervals \(\Omega _{i+1}\), covering the whole time window (see Fig. 1 for a sketch). In such a way, a fine time grid consisting of \(N_t = M(m+1)\) dofs is obtained by mapping \(m+1\) micro-dofs onto a coarser grid of M macro intervals, without a priori needing a fine discretization of the whole time window. In particular, the value of the solution at the right endpoint, \(T_{i+1}\), of each subinterval \(\Omega _{i+1}\) is recovered by means of this tensor product. As a consequence, such a discretization is intentionally not meant to predict values at \(T_M = T_f\). Figure 2 shows the Cartesian product of the macro and micro dofs together, with the associated nodal evaluations of the generic unknown function u in (10).

Fig. 1
figure 1

Construction of macro and micro scales

Fig. 2
figure 2

Tensor product of the macro and micro dofs

If we discretize the time derivative in (10) by means of a standard finite difference formula, we have:

$$\begin{aligned} \forall n \in \{0, 1, \dots , N_t - 1\},\quad \frac{\partial u}{\partial t} \approx \frac{1}{\Delta t} (u_{n + 1} - u_n), \end{aligned}$$

that we can write also as

$$\begin{aligned} \frac{\partial u}{\partial t} \approx {{\,\mathrm{\mathbf {E}}\,}}_{N_t} {{\,\mathrm{\mathbf {u}}\,}}, \end{aligned}$$


$$\begin{aligned} {{\,\mathrm{\mathbf {E}}\,}}_{N_t}&= \frac{1}{\Delta t} \begin{pmatrix} 1 &{} 0 &{} 0 &{} \cdots &{} 0&{} 0 &{} 0 \\ -1 &{} 1 &{} 0 &{} 0 &{} \cdots &{} 0 &{} 0\\ 0 &{} -1 &{} 1 &{} 0 &{} 0 &{} \cdots &{} 0 \\ \vdots &{} \ddots &{} \ddots &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ 0 &{} \cdots &{} 0 &{} -1 &{} 1 &{} 0 &{} 0 \\ 0 &{} 0 &{} \cdots &{} 0 &{} -1 &{} 1 &{} 0\\ 0 &{} 0 &{} 0 &{} \cdots &{} 0 &{} -1 &{} 1\\ \end{pmatrix}_{N_t}\text { and } {{\,\mathrm{\mathbf {u}}\,}}= \begin{pmatrix} u_1\\ u_2\\ \vdots \\ u_{N_t} \end{pmatrix}, \end{aligned}$$

where the first equation understands that the initial value \(u_0\) has to be included in the right-hand side of the equation associated with \(n=0\), while the subscript \(N_t\) for the operator \({{\,\mathrm{\mathbf {E}}\,}}\) denotes the size of the corresponding matrix. This notation will be particularly useful to simplify the discussion which follows.

Using a two-scale time variable, the time derivative in (11) is replaced by the new one

$$\begin{aligned} \frac{\partial }{\partial \tau } u( T, \tau ), \end{aligned}$$

where \(T \in \{T_i\}_{i=0}^{M-1}\) is adopted to identify the subinterval \(\Omega _{i+1}\) of interest, while \(\tau \in [T_0, T_1)\) represents the actual temporal independent variable, spanning \(\Omega _1\), i.e, via tensor product, the generic subinterval \(\Omega _{i+1}\). This leads to perform the time derivation with respect to variable \(\tau \).

With a view to the application of PGD for approximating problem (10) with the two-scale time discretization, matrix \({{\,\mathrm{\mathbf {E}}\,}}_{N_t}\) in (13) associated with the standard time coordinate deserves to be modified in order to replicate the PGD tensor structure. The idea is to introduce a suitable macro-micro decomposition of the time derivative operator in (12). For this purpose, let us identify the partial derivative of order zero with respect to T, \(\frac{\partial ^0}{\partial T^0}\), with the identity operator, so that, \(\frac{\partial ^0}{\partial T^0}f(T)= f(T)\), and, as a consequence, identity

$$\begin{aligned} \frac{\partial }{\partial \tau } u(T,\tau ) = \left( \frac{\partial ^0}{\partial T^0} \otimes \frac{\partial }{\partial \tau }\right) u(T,\tau ) \end{aligned}$$

holds true. This equality suggested the authors in [1] to propose the approximation

$$\begin{aligned} \frac{\partial }{\partial t} \approx \frac{\partial ^0}{\partial T^0} \otimes \frac{\partial }{\partial \tau }, \end{aligned}$$

for the standard time derivative, which will be investigated and further developed throughout this work. Approximation (14) can thus be written in matrix form as

$$\begin{aligned} {{\,\mathrm{\mathbf {E}}\,}}_{N_t} \approx {{{\,\mathrm{\mathbf {E}}\,}}_{T^0, \tau }} ={{\,\mathrm{\mathbf {E}}\,}}_{m+1} \otimes {{\,\mathrm{\mathbf {I}}\,}}_{M} = \begin{pmatrix} \,{{\,\mathrm{\mathbf {E}}\,}}_{m+1} &{} {{\,\mathrm{\mathbf {0}}\,}}&{} {{\,\mathrm{\mathbf {0}}\,}}\, \\ \,{{\,\mathrm{\mathbf {0}}\,}}&{} \ddots &{} {{\,\mathrm{\mathbf {0}}\,}}\, \\ \,{{\,\mathrm{\mathbf {0}}\,}}&{} {{\,\mathrm{\mathbf {0}}\,}}&{} {{\,\mathrm{\mathbf {E}}\,}}_{m+1}\, \\ \end{pmatrix}_{M}, \end{aligned}$$

where now the subscript M refers to the number of blocks constituting matrix \({{\,\mathrm{\mathbf {E}}\,}}_{T^0, \tau }\), while matrix \({{\,\mathrm{\mathbf {E}}\,}}_{m+1}\), sized according to discretization at the micro-scale, is defined as in (13), after replacing \(\Delta t\) with \(\Delta \tau \), and replicated throughout the subintervals \(\Omega _{i+1}\) by means of the Kronecker product with the discrete identity operator \({{\,\mathrm{\mathbf {I}}\,}}_M\).Footnote 2

However, definition (15) leads to have some entries along the first sub-diagonal which are identically null. This happens essentially when switching from a block to the subsequent one, namely, when moving from the last internal dof associated with the micro-scale in a certain subinterval, \(\Omega _{i+1}\), to the first dof associated with the macro-scale of the subinterval \(\Omega _{i+2}\), resulting in a loss of continuity between the fine and the coarse time grids. An effective, yet computationally demanding, remedy to this issue is based on enforcing the continuity in all the macrodofs, either by using a penalized formulation or by employing Lagrange multipliers, as detailed in [1].

In this work, we propose to exploit the properties of the tensor product to recover the equality in (15). To this aim, we introduce the decomposition

$$\begin{aligned} \begin{aligned} {{\,\mathrm{\mathbf {E}}\,}}_{N_t}&= \frac{1}{\Delta \tau } \begin{pmatrix} 1 &{} 0 &{} 0 &{} \cdots &{} \cdots &{} 0\\ -1 &{} 1 &{} 0 &{} 0 &{} \cdots &{} 0 \\ 0 &{} \ddots &{}\ddots &{} \ddots &{} \ddots &{} 0\\ \vdots &{} \ddots &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ 0 &{} \cdots &{} 0 &{} -1 &{} 1 &{} 0\\ 0 &{} \cdots &{} \cdots &{} 0 &{} -1 &{} 1 \end{pmatrix}_{m+1} \otimes \quad \begin{pmatrix} 1 &{} 0 &{} \cdots &{} \cdots &{} 0\\ 0 &{} 1 &{} \ddots &{} \ddots &{} \vdots \\ \vdots &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ \vdots &{} \ddots &{} \ddots &{} 1 &{} 0\\ 0 &{} \cdots &{} \cdots &{} 0 &{} 1 \end{pmatrix}_{M} \\&\quad + \frac{1}{\Delta \tau } \begin{pmatrix} 0 &{} 0 &{} 0 &{} \cdots &{} 0 &{} -1 \\ 0 &{} 0 &{} 0 &{} 0 &{} \cdots &{} 0 \\ 0 &{} \ddots &{}\ddots &{} \ddots &{} \ddots &{} 0\\ \vdots &{} \ddots &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ 0 &{} \cdots &{} 0 &{} 0 &{} 0 &{} 0\\ 0 &{} 0 &{} \cdots &{} 0 &{} 0 &{} 0 \end{pmatrix}_{m+1} \otimes \quad \begin{pmatrix} 0 &{} 0 &{} \cdots &{} \cdots &{} 0\\ 1 &{} 0 &{} \ddots &{} \ddots &{} \vdots \\ 0 &{} 1 &{} \ddots &{} \ddots &{} \vdots \\ \vdots &{} \ddots &{} \ddots &{} \ddots &{} 0\\ 0 &{} \cdots &{} 0 &{} 1 &{} 0 \end{pmatrix}_{M} \end{aligned} \end{aligned}$$

which, in a compact form, reads as

$$\begin{aligned} {{\,\mathrm{\mathbf {E}}\,}}_{N_t} = {{\,\mathrm{\mathbf {E}}\,}}_{m+1} \otimes {{\,\mathrm{\mathbf {I}}\,}}_{M} + {{\,\mathrm{\mathbf {C}}\,}}_{m+1} \otimes {{\,\mathrm{\mathbf {L}}\,}}_{M} \end{aligned}$$

where matrices \({{\,\mathrm{\mathbf {C}}\,}}_{m+1}\) and \({{\,\mathrm{\mathbf {L}}\,}}_M\) are defined as

$$\begin{aligned} {\displaystyle {{\left( {{\,\mathrm{\mathbf {C}}\,}}_{m+1}\right) }_{ij}= -\frac{1}{\Delta \tau } \left\{ \begin{array}{cl} 1 &{} \text{ if } i=1, j=m+1\\ 0 &{} \text{ otherwise }, \end{array} \right. } \qquad {\left( {{\,\mathrm{\mathbf {L}}\,}}_M\right) }_{ij} =\delta _{i,j+1},} \end{aligned}$$

respectively with \({\displaystyle \delta _{ij}}\) the Kronecker symbol. The decomposition in (17) allows us to reconstruct the correct time derivative operator while preserving the macro-micro decomposition characterizing the two-scale time derivative operator. This method embraces the PGD formalism while reducing significantly the computational cost, since no extra computational effort is required to enforce continuity at each dof associated with the macroscale.

Remark 0.3

The multiscale approach proposed in this paper exhibits two main benefits:

  1. 1.

    The possibility of describing in an efficient way physical phenomena with the fine scale resolution;

  2. 2.

    A description richness equal to \(N_t = M (m+1)\) accomplished with a computational complexity of the order of \(M+m+1\), thus yielding considerably reduced memory allocation requirements to store time operators.

Coming back to the approximation of the heat equation in (10), a classical discrete PGD approximation, based on a space–time separated form, reads:

$$\begin{aligned} \begin{aligned} \textit{Find}\, \mathbf {U}_H {=} \sum _{ k = 1 }^{N_U} {{\,\mathrm{\mathbf {u}}\,}}_1^k \otimes {{\,\mathrm{\mathbf {u}}\,}}_2^k \textit{ such that } {{\,\mathrm{\mathcal {A}}\,}}_H \mathbf {U}_H = {{\,\mathrm{\mathcal {B}}\,}}_H \end{aligned}, \end{aligned}$$

where \(N_U\) denotes the number of the PGD modes, index 1 refers to the space dependence, index 2 is associated with the time, \({{\,\mathrm{\mathcal {B}}\,}}_H\) is a suitable discrete separated approximation of the source term f(tx) evaluated at some discrete points, \({{\,\mathrm{\mathcal {A}}\,}}_H\) is a discrete separated representation of the differential operators in (10), built by exploiting the tensorial identity

$$\begin{aligned} \frac{\partial }{\partial t} - k \frac{\partial ^2 }{\partial {x}^2}&= \left( \frac{\partial }{\partial t} \otimes \frac{\partial ^0}{\partial x^0}\right) - k \left( \frac{\partial ^0}{\partial t^0} \otimes \frac{\partial ^2 }{\partial {x}^2}\right) , \end{aligned}$$

and assembled according to the discretization adopted for the space (e.g., finite differences, finite elements) and for the time. With the same notation as in (14), we identify the partial derivatives of order zero with the corresponding identity operator. For instance, let us assume to discretize (10) by employing the implicit Euler scheme for the time and a centered finite difference approximation for the space derivative, with \(N_x\) the number of spatial dofs and \(N_t\) the number of discrete times. Then, the operator \(\mathcal {A}_H\) can be separated as

$$\begin{aligned} {{\,\mathrm{\mathcal {A}}\,}}_H = \sum _{ k = 1 }^2 {{\,\mathrm{\mathbf {A}}\,}}_1^k \otimes {{\,\mathrm{\mathbf {A}}\,}}_2^k \text { with } {{\,\mathrm{\mathbf {A}}\,}}_1^{1} = {{\,\mathrm{\mathbf {I}}\,}}_{N_x},\ {{\,\mathrm{\mathbf {A}}\,}}_2^1 = {{\,\mathrm{\mathbf {E}}\,}}_{N_t},\ {{\,\mathrm{\mathbf {A}}\,}}_1^2 = -k {{\,\mathrm{\mathbf {D}}\,}}_{N_x},\ {{\,\mathrm{\mathbf {A}}\,}}_2^2 = {{\,\mathrm{\mathbf {I}}\,}}_{N_t}, \end{aligned}$$

where \({{\,\mathrm{\mathbf {E}}\,}}_{N_t}\) denotes the matrix associated with the implicit Euler scheme, \({{\,\mathrm{\mathbf {I}}\,}}_{N_x}\) and \({{\,\mathrm{\mathbf {I}}\,}}_{N_t}\) are the identity matrices in space and time, respectively and \({{\,\mathrm{\mathbf {D}}\,}}_{N_x}\) is the matrix of the discrete Laplacian. Figure 3 shows the sparsity pattern associated with four matrices \({{\,\mathrm{\mathbf {A}}\,}}_i^k\).

Fig. 3
figure 3

Sparsity pattern of discrete PGD operators associated with the separated representation (21), for \(N_x = 101\) and \(N_t = 1000\)

Now, in order to apply the new PGD formulation based on a two-scale time discretization to problem (10), we have to recast the differential operators in (20) into a multiscale framework, by adding a further temporal independent variable. This leads us to deal with a framework characterized by two dimensions in time and one dimension in space. For this purpose, we adopt the approximation

$$\begin{aligned} \frac{\partial }{\partial t} - k \frac{\partial ^2 }{\partial {x}^2}&= \left( \frac{\partial }{\partial t} \otimes \frac{\partial ^0}{\partial x^0}\right) - k \left( \frac{\partial ^0}{\partial t^0} \otimes \frac{\partial ^2 }{\partial {x}^2}\right) \\&\approx \left( \frac{\partial ^0}{\partial T^0} \otimes \frac{\partial }{\partial \tau } \otimes \frac{\partial ^0}{\partial x^0}\right) - k \left( \frac{\partial ^0}{\partial T^0} \otimes \frac{\partial ^0}{\partial \tau ^0} \otimes \frac{\partial ^2 }{\partial {x}^2}\right) , \end{aligned}$$

and we enforce the continuity between the macro and the micro time partitions by resorting to the two-scale decomposition in (17), so that the operator \({{\,\mathrm{\mathcal {A}}\,}}_H\) in (19) can be separated as

$$\begin{aligned} {{\,\mathrm{\mathcal {A}}\,}}_H = \sum _{ k = 1 }^3 {{\,\mathrm{\mathbf {A}}\,}}_1^k \otimes {{\,\mathrm{\mathbf {A}}\,}}_2^k \otimes {{\,\mathrm{\mathbf {A}}\,}}_3^k, \end{aligned}$$

where, analogously as in (19), subscript 1 identifies the space dependence, while subscripts 2 and 3 refer to the time microscale and to the time macroscale, respectively. The spatial operators are defined in a straightforward way as

$$\begin{aligned} {{\,\mathrm{\mathbf {A}}\,}}_1^1 = {{\,\mathrm{\mathbf {A}}\,}}_1^2 = {{\,\mathrm{\mathbf {I}}\,}}_{N_x}, \quad {{\,\mathrm{\mathbf {A}}\,}}_1^3 = - k {{\,\mathrm{\mathbf {D}}\,}}_{N_x}, \end{aligned}$$

whereas the two-scale time discretization leads us to adopt the modified tensorial decomposition in (16),

$$\begin{aligned} \mathbf {E}_{N_t} = \mathbf {A}_2^1 \otimes \mathbf {A}_3^1 + \mathbf {A}_2^2 \otimes \mathbf {A}_3^2, \end{aligned}$$

with \({{\,\mathrm{\mathbf {A}}\,}}_2^1 = {{\,\mathrm{\mathbf {E}}\,}}_{m+1}\) the matrix characterizing the implicit Euler discretization at the microscale; \({{\,\mathrm{\mathbf {A}}\,}}_3^1 = {{\,\mathrm{\mathbf {A}}\,}}_3^3= {{\,\mathrm{\mathbf {I}}\,}}_{M}\) the discrete identity matrix associated with the subintervals \(\Omega _{i+1}\); \({{\,\mathrm{\mathbf {A}}\,}}_2^2 = {{\,\mathrm{\mathbf {C}}\,}}_{m+1}\) the correction matrix, sized according to the microscale, with a unique non-null element in the upper-right corner; \({{\,\mathrm{\mathbf {A}}\,}}_3^2 = {{\,\mathrm{\mathbf {L}}\,}}_{M}\) the lower shift matrix, sized according to the macroscale, with the first subdiagonal of elements all equal to one; \({{\,\mathrm{\mathbf {A}}\,}}_2^3 = {{\,\mathrm{\mathbf {I}}\,}}_{m+1}\) the discrete identity matrix associated with the microscale. Figure 4 gathers the sparsity pattern of the nine matrices involved in the separated representation (22).

Concerning the right-hand side in (19), operator \({{\,\mathrm{\mathcal {B}}\,}}_H\) coincides with a separated representation, with respect to the spatial scale and the two temporal ones, of the source term f(tx) in (10), evaluated at some discrete points, and computed through a HOSVD [24].

Fig. 4
figure 4

Sparsity pattern of the discrete PGD operators associated with the separated representation (22), for \(N_x = 101\), \(m + 1 = 100\) and \(M = 10\)

Remark 0.4

A cross comparison between Figs. 3 and 4 highlights that the two-scale PGD formulation of problem (10) does not affect the spatial discretization. On the contrary, the matrices associated with the two-scale time discretization are much smaller with respect to the ones characterizing the separated representation in (21), with a consequent reduction in terms of memory allocation (in particular, the storage requirement for the time matrices reduces from \(3(m+1)M - 1\) to \(3(m+1 + M) - 1\), which means of a factor about equal to \(M^{-1}\), for \(M \ll m + 1\)). Notice that the time decomposition in Fig. 4 suits the time grid in Fig. 3, being \(M(m+1) = N_t = 1000\).

Multiscale resolution of transient elastodynamic problems

This section generalizes the multiscale PGD formulation detailed on the heat equation in the previous section to a more challenging setting represented by an elastodynamic problem in a multiscale transient regime. In this setting, different strategies based on the separation of the space and time are investigated in [23]. Here, the authors propose a multi-field Proper Generalized Decomposition which adopts standard finite elements to discretize the space, to be combined with several discretization schemes in time, such as the Newmark scheme [25], a single-field time discontinuous Galerkin method, a two-fields time continuous and discontinuous Galerkin approach.

To simplify the discussion, we focus on a transient elastodynamic problem in a one-dimensional spatial domain which models, for instance, the traction-compression waves travelling along a linear elastic medium, \(\Omega = (0,L)\), during time interval \(I = [0,T)\). The scalar displacement field is denoted by \(u=u(x,t)\), for \(x\in \Omega \) and \(t \in I\). The medium is subject to a displacement, \(u^d=u^d(x,t)\), and to an external force, \(f^d=f^d (x, t)\), applied to portions, \(\partial \Omega _u \times I\) and \(\partial \Omega _f \times I\), of the boundary of the space–time cylinder, respectively, with \(\partial \Omega _f \cup \partial \Omega _u = \partial \Omega \) and \({\mathop {\partial \Omega _f}\limits ^{\circ }} \cap {\mathop {\partial \Omega _u}\limits ^{\circ }} = \emptyset \) (notice that, in the specific context at hand, \(\partial \Omega _u\) and \(\partial \Omega _f\) reduce to the endpoints of the domain \(\Omega \), dealing with a one-dimensional setting). The initial state is described by the displacement field, \(u_0=u_0 (x)\), and by the velocity field, \(v_0=v_0 (x)\), at time \(t=0\). Finally, the medium is characterized by a density, \(\rho \), an elasticity modulus, E, and a section, A. Thus, the strong formulation of the considered transient elastodynamic problem reads: find \(u : \Omega \times I \rightarrow \mathbb {R}\), such that

$$\begin{aligned} \left\{ \begin{array}{ll} \displaystyle \rho \frac{\partial ^2 u}{\partial {t}^2} = E \frac{\partial ^2 u}{\partial {x}^2}\quad &{} \text {in } \Omega \times I, \\ u = u^d &{} \text {on } \partial \Omega _u \times I, \\ \displaystyle \frac{\partial u}{\partial x} = \frac{f^d}{E A} &{} \text {on } \partial \Omega _f \times I, \\ u(x, 0) = u_0(x) &{} \text {on } \Omega \times \{0\}, \\ \displaystyle \frac{\partial u}{\partial t} (x, 0) (x, 0) = v_0(x) &{} \text {on } \Omega \times \{0\}. \end{array} \right. \end{aligned}$$

To simplify the notation, in the following we adopt the convention \(\dot{u}\) and \(\ddot{u}\) to denote the first- and the second-order time derivative, \(\displaystyle \frac{\partial u}{\partial t}\) and \(\displaystyle \frac{\partial ^2 u}{\partial {t}^2}\), of u respectively.

We employ a standard centered finite difference scheme to approximate the space, after discretizing \(\Omega \) with \(N_x\) dofs, so that the associated semi-discrete formulation is: find \({{\,\mathrm{\mathbf {u}}\,}}: I \rightarrow \mathbb {R}^{ {N_{x}} }\), such that

$$\begin{aligned} \left\{ \begin{array}{l} {{\,\mathrm{\mathbf {M}}\,}}\ddot{{{\,\mathrm{\mathbf {u}}\,}}} (t) + {{\,\mathrm{\mathbf {K}}\,}}{{\,\mathrm{\mathbf {u}}\,}}(t) = {{\,\mathrm{\mathbf {F}}\,}}(t), \\ {{\,\mathrm{\mathbf {u}}\,}}(0) = {{\,\mathrm{\mathbf {u}}\,}}_0, \\ \dot{{{\,\mathrm{\mathbf {u}}\,}}}(0) = {{\,\mathrm{\mathbf {v}}\,}}_0, \end{array} \right. \end{aligned}$$

where \({{\,\mathrm{\mathbf {M}}\,}}=\displaystyle \frac{\rho }{E} {{\,\mathrm{\mathbf {I}}\,}}_{N_x}\) and \({{\,\mathrm{\mathbf {K}}\,}}= - {{\,\mathrm{\mathbf {D}}\,}}_{N_x}\) denote the mass and the stiffness matrix, respectively, with \({{\,\mathrm{\mathbf {I}}\,}}_{N_x}\) and \({{\,\mathrm{\mathbf {D}}\,}}_{N_x}\) the identity and discrete Laplacian operators, \({{\,\mathrm{\mathbf {u}}\,}}_0\) and \({{\,\mathrm{\mathbf {v}}\,}}_0\) are the vectors sampling the initial data, \(u_0\) and \(v_0\), at the spatial dofs, and where the boundary data have been properly included in the right-hand side \({{\,\mathrm{\mathbf {F}}\,}}\).

To discretize the time, we subdivide the whole time window, I, by means of \((N_t + 1)\) uniformly distributed times, \(t_i\), such that \(t_0=0\), \(t_{N_t} = T\), and \(t_i - t_{i-1} = \Delta t\), for \(i = 1,\dots , N_t\). Following [23], we apply the Newmark scheme to (24), so that we have to solve the fully discretized problem: find \({{\,\mathrm{\mathbf {u}}\,}}\in \mathbb {R}^{ {N_{x}} \times {N_t} }\), such that

$$\begin{aligned} \begin{aligned} \left( {{\,\mathrm{\mathbf {K}}\,}}\otimes {{\,\mathrm{\mathbf {N}}\,}}_1 + {{\,\mathrm{\mathbf {M}}\,}}\otimes {{\,\mathrm{\mathbf {N}}\,}}_2 \right) : {{\,\mathrm{\mathbf {u}}\,}}=&\left( {{\,\mathrm{\mathbf {I}}\,}}_{N_x} \otimes {{\,\mathrm{\mathbf {N}}\,}}_1 \right) : {{\,\mathrm{\mathbf {F}}\,}}+ \left( {{\,\mathrm{\mathbf {M}}\,}}{{\,\mathrm{\mathbf {u}}\,}}_0 \right) \otimes {{\,\mathrm{\mathbf {N}}\,}}_3 + \left( {{\,\mathrm{\mathbf {M}}\,}}{{\,\mathrm{\mathbf {v}}\,}}_0 \right) \otimes {{\,\mathrm{\mathbf {N}}\,}}_4 \\&+\left( {{\,\mathrm{\mathbf {F}}\,}}(t_0) - {{\,\mathrm{\mathbf {K}}\,}}{{\,\mathrm{\mathbf {u}}\,}}_0 \right) \otimes {{\,\mathrm{\mathbf {N}}\,}}_5, \end{aligned} \end{aligned}$$

where  :  denotes the two times contracted product between tensorsFootnote 3,

$$\begin{aligned} {{\,\mathrm{\mathbf {N}}\,}}_1&= \begin{pmatrix} \beta &{} 0 &{} \cdots &{} \cdots &{} 0\\ a &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ b &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ 0 &{} \ddots &{} \ddots &{} \ddots &{} 0 \\ \cdots &{} 0 &{} b &{} a &{} \beta \end{pmatrix}_{N_t},\qquad {{\,\mathrm{\mathbf {N}}\,}}_2 = \frac{1}{\Delta t^2} \begin{pmatrix} 1 &{} 0 &{} \cdots &{} \cdots &{} 0\\ -2 &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ 1 &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ 0 &{} \ddots &{} \ddots &{} \ddots &{} 0 \\ \cdots &{} 0 &{} 1 &{} -2 &{} 1 \end{pmatrix}_{N_t},\nonumber \\ {{\,\mathrm{\mathbf {N}}\,}}_3&= \frac{1}{\Delta t^2} \begin{pmatrix} 1 \\ -1 \\ 0 \\ \vdots \\ 0 \end{pmatrix}_{N_t},\nonumber \\ {{\,\mathrm{\mathbf {N}}\,}}_4&= \frac{1}{\Delta t} \begin{pmatrix} 1 \\ 0 \\ \vdots \\ \vdots \\ 0 \end{pmatrix}_{N_t},\qquad {{\,\mathrm{\mathbf {N}}\,}}_5 = \begin{pmatrix} \frac{1}{2} - \beta \\ \frac{1}{2} + \beta - \gamma \\ 0 \\ \vdots \\ 0 \end{pmatrix}_{N_t}, \end{aligned}$$

with \(0 \le \gamma \le 1\) and \(0 \le \beta \le \frac{1}{2}\) the parameters involved by the Newmark algorithm, \(a = 1/2 - 2 \beta + \gamma \), \(b =1/2 + \beta - \gamma \), \({{\,\mathrm{\mathbf {F}}\,}}(t_0)\) is the right-hand side in (24) evaluated at the initial time \(t_0\), and \({{\,\mathrm{\mathbf {F}}\,}}\) collects all the vectors \({{\,\mathrm{\mathbf {F}}\,}}(t_i)\) for \(i = 1, \dots , N_t\), accounting for the exterior force and the imposed displacement (we refer the interested reader to the reference paper [23] where the explicit computations leading to linear system (25) can be found).

Formulation (25) is instrumental to provide the discrete PGD approximation for problem (23) based on a standard space–time separation, which reads

$$\begin{aligned} \textit{Find } \mathbf {U}_E {=} \sum _{ k = 1 }^{N_U} {{\,\mathrm{\mathbf {u}}\,}}_1^k \otimes {{\,\mathrm{\mathbf {u}}\,}}_2^k \textit{ such that } {{\,\mathrm{\mathcal {A}}\,}}_E \mathbf {U}_E = {{\,\mathrm{\mathcal {B}}\,}}_E, \end{aligned}$$


$$\begin{aligned} {{\,\mathrm{\mathcal {A}}\,}}_E = \sum _{ k = 1 }^2 {{\,\mathrm{\mathbf {A}}\,}}_1^k \otimes {{\,\mathrm{\mathbf {A}}\,}}_2^k, \quad \text {with}\quad {{\,\mathrm{\mathbf {A}}\,}}_1^{1} = {{\,\mathrm{\mathbf {M}}\,}},\quad {{{\,\mathrm{\mathbf {A}}\,}}_2^1 = {{\,\mathrm{\mathbf {N}}\,}}_2, \quad {{\,\mathrm{\mathbf {A}}\,}}_1^2 = {{\,\mathrm{\mathbf {K}}\,}}, \quad {{\,\mathrm{\mathbf {A}}\,}}_2^2 = {{\,\mathrm{\mathbf {N}}\,}}_1}, \end{aligned}$$

the same notation as in (19) being adopted for the subscripts identifying the space and the time, respectively, while \({{\,\mathrm{\mathcal {B}}\,}}_E\) simplifies to

$$\begin{aligned} {{\,\mathrm{\mathcal {B}}\,}}_E = {{\,\mathrm{\mathbf {b}}\,}}_1 \otimes {{\,\mathrm{\mathbf {b}}\,}}_2,\quad \text {with} \quad {{\,\mathrm{\mathbf {b}}\,}}_1 = \frac{\rho }{E} {{\,\mathrm{\mathbf {v}}\,}}_0,\quad {{\,\mathrm{\mathbf {b}}\,}}_2 = {{\,\mathrm{\mathbf {N}}\,}}_4 \end{aligned}$$

after assuming \({{\,\mathrm{\mathbf {F}}\,}}= {{\,\mathrm{\mathbf {0}}\,}}\) (i.e., no external forces) and \({{\,\mathrm{\mathbf {u}}\,}}_0 = {\varvec{0}}\) (i.e., a vanishing initial displacement).

The discrete operators involved in the definition of \({{\,\mathrm{\mathcal {A}}\,}}_E\) have the sparsity pattern shown in Fig. 5, when choosing \(\Omega = (0,1)\) and \(I = [0,100)\).

We now generalize the two-scale temporal discretization for a PGD approximation introduced in the previous section to the elastodynamic problem (23). For this purpose, the tensor decomposition correction proposed in (16) for the implicit Euler discrete operator, \({{\,\mathrm{\mathbf {E}}\,}}_{N_t}\), is here extended to the Newmark discrete operators, \({{\,\mathrm{\mathbf {N}}\,}}_1\) and \({{\,\mathrm{\mathbf {N}}\,}}_2\), in (26), so that it holds

$$\begin{aligned} {{\,\mathrm{\mathbf {N}}\,}}_1= & {} \begin{pmatrix} \beta &{} 0 &{} 0 &{} \cdots &{} \cdots &{} 0\\ a &{} \beta &{} 0 &{} 0 &{} \cdots &{} 0 \\ b &{} \ddots &{}\ddots &{} \ddots &{} \ddots &{} 0\\ \vdots &{} \ddots &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ 0 &{} \cdots &{} b &{} a &{} \beta &{} 0\\ 0 &{} \cdots &{} \cdots &{} b &{} a &{} \beta \end{pmatrix}_{m+1} \otimes \begin{pmatrix} 1 &{} 0 &{} \cdots &{} \cdots &{} 0\\ 0 &{} 1 &{} \ddots &{} \ddots &{} \vdots \\ \vdots &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ \vdots &{} \ddots &{} \ddots &{} 1 &{} 0\\ 0 &{} \cdots &{} \cdots &{} 0 &{} 1 \end{pmatrix}_{M} \nonumber \\&\qquad + \begin{pmatrix} 0 &{} 0 &{} \cdots &{} 0 &{} b &{} a \\ 0 &{} 0 &{} \ddots &{} 0 &{} \ddots &{} b \\ 0 &{} \ddots &{}\ddots &{} \ddots &{} \ddots &{} 0\\ \vdots &{} \ddots &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ 0 &{} \cdots &{} 0 &{} 0 &{} 0 &{} 0\\ 0 &{} 0 &{} \cdots &{} 0 &{} 0 &{} 0 \end{pmatrix}_{m+1} \otimes \begin{pmatrix} 0 &{} 0 &{} \cdots &{} \cdots &{} 0\\ 1 &{} 0 &{} \ddots &{} \ddots &{} \vdots \\ 0 &{} 1 &{} \ddots &{} \ddots &{} \vdots \\ \vdots &{} \ddots &{} \ddots &{} \ddots &{} 0\\ 0 &{} \cdots &{} 0 &{} 1 &{} 0 \end{pmatrix}_{M}, \end{aligned}$$
$$\begin{aligned} {{\,\mathrm{\mathbf {N}}\,}}_2= & {} \frac{1}{\Delta \tau ^2} \begin{pmatrix} 1 &{} 0 &{} 0 &{} \cdots &{} \cdots &{} 0\\ -2 &{} 1 &{} 0 &{} 0 &{} \cdots &{} 0 \\ 1 &{} \ddots &{}\ddots &{} \ddots &{} \ddots &{} 0\\ \vdots &{} \ddots &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ 0 &{} \cdots &{} 1 &{} -2 &{} 1 &{} 0\\ 0 &{} \cdots &{} \cdots &{} 1 &{} -2 &{} 1 \end{pmatrix}_{m+1} \otimes \begin{pmatrix} 1 &{} 0 &{} \cdots &{} \cdots &{} 0\\ 0 &{} 1 &{} \ddots &{} \ddots &{} \vdots \\ \vdots &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ \vdots &{} \ddots &{} \ddots &{} 1 &{} 0\\ 0 &{} \cdots &{} \cdots &{} 0 &{} 1 \end{pmatrix}_{M} \nonumber \\&\qquad + \frac{1}{\Delta \tau ^2} \begin{pmatrix} 0 &{} 0 &{} \cdots &{} 0 &{} 1 &{} -2 \\ 0 &{} 0 &{} \ddots &{} 0 &{} \ddots &{} 1 \\ 0 &{} \ddots &{}\ddots &{} \ddots &{} \ddots &{} 0\\ \vdots &{} \ddots &{} \ddots &{} \ddots &{} \ddots &{} \vdots \\ 0 &{} \cdots &{} 0 &{} 0 &{} 0 &{} 0\\ 0 &{} 0 &{} \cdots &{} 0 &{} 0 &{} 0 \end{pmatrix}_{m+1} \otimes \begin{pmatrix} 0 &{} 0 &{} \cdots &{} \cdots &{} 0\\ 1 &{} 0 &{} \ddots &{} \ddots &{} \vdots \\ 0 &{} 1 &{} \ddots &{} \ddots &{} \vdots \\ \vdots &{} \ddots &{} \ddots &{} \ddots &{} 0\\ 0 &{} \cdots &{} 0 &{} 1 &{} 0 \end{pmatrix}_{M}, \end{aligned}$$
Fig. 5
figure 5

Sparsity pattern of discrete PGD operators associated with the separated representation (28), for \(N_x = 51\) and \(N_t = 2000\)

\(m+1\) and M denoting the number of the temporal micro-dofs and of the time macro subintervals as in “A two-time scale separated representation within the PGD method” section, with \(N_t=M(m+1)\). Decompositions (29) and (30) can be rewritten in a compact form as

$$\begin{aligned} {{\,\mathrm{\mathbf {N}}\,}}_l = {{\,\mathrm{\mathbf {N}}\,}}_{l,m+1} \otimes {{\,\mathrm{\mathbf {I}}\,}}_M + {{\,\mathrm{\mathbf {C}}\,}}_{l,m+1} \otimes {{\,\mathrm{\mathbf {L}}\,}}_M\quad \text {with} \quad l = 1,2, \end{aligned}$$

where matrices \({{\,\mathrm{\mathbf {N}}\,}}_{1,m+1}\) and \({{\,\mathrm{\mathbf {N}}\,}}_{2,m+1}\) are defined exactly as \({{\,\mathrm{\mathbf {N}}\,}}_{1}\) and \({{\,\mathrm{\mathbf {N}}\,}}_{2}\), respectively except for the size (equal to \(m+1\) instead of \(N_t\)); \({{\,\mathrm{\mathbf {I}}\,}}_M\) is the discrete identity matrix associated with the macroscale; \({{\,\mathrm{\mathbf {L}}\,}}_M\) is the lower shift matrix defined as in (18); the correction matrices \({{\,\mathrm{\mathbf {C}}\,}}_{1,m+1}\) and \({{\,\mathrm{\mathbf {C}}\,}}_{2,m+1}\) are given by

$$\begin{aligned} {\left( {{\,\mathrm{\mathbf {C}}\,}}_{1,m+1}\right) }_{ij}&= {\left\{ \begin{array}{cl} a &{} \quad \text{ if } i=1, j=m+1\\ b &{} \quad \text{ if } i=1, j=m \text{ or } i=2, j=m+1, \\ 0 &{} \quad \text{ otherwise }, \end{array} \right. }\\ {\left( {{\,\mathrm{\mathbf {C}}\,}}_{2,m+1}\right) }_{ij}&= {\frac{1}{\Delta \tau ^2} \left\{ \begin{array}{cl} - 2 &{} \quad \text{ if } i=1, j=m+1\\ 1 &{} \quad \text{ if } i=1, j=m \text{ or } i=2, j=m+1,\\ 0 &{} \quad \text{ otherwise }. \end{array} \right. } \end{aligned}$$

The tensorial decompositions in (31) ensure the continuity between the macro and the micro time scales, analogously to decomposition (17). This allows us to extend the temporal continuity between different scales to \({{\,\mathrm{\mathcal {A}}\,}}_E\) in (27), after separating this operator in terms of the coordinates x, T and \(\tau \), and by exploiting decompositions (31), so that we have

$$\begin{aligned} {{\,\mathrm{\mathcal {A}}\,}}_E = \sum _{ k = 1 }^4 {{\,\mathrm{\mathbf {A}}\,}}_1^k \otimes {{\,\mathrm{\mathbf {A}}\,}}_2^k \otimes {{\,\mathrm{\mathbf {A}}\,}}_3^k, \end{aligned}$$

subscript 1 referring to the space dependence, while 2 and 3 to the temporal micro- and macroscale, respectively as in the previous section. In particular, the spatial contributions coincide with matrices \({{\,\mathrm{\mathbf {M}}\,}}\) and \({{\,\mathrm{\mathbf {K}}\,}}\) in (24), being

$$\begin{aligned} {{\,\mathrm{\mathbf {A}}\,}}_1^1 = {{\,\mathrm{\mathbf {A}}\,}}_1^2 = {{\,\mathrm{\mathbf {M}}\,}}= \frac{\rho }{E} {{\,\mathrm{\mathbf {I}}\,}}_{N_x},\quad {{\,\mathrm{\mathbf {A}}\,}}_1^3 = {{\,\mathrm{\mathbf {A}}\,}}_1^4 = {{\,\mathrm{\mathbf {K}}\,}}= - {{\,\mathrm{\mathbf {D}}\,}}_{N_x}. \end{aligned}$$

The operators associated with the time microscale are

$$\begin{aligned} {{\,\mathrm{\mathbf {A}}\,}}_2^1={{\,\mathrm{\mathbf {N}}\,}}_{2,m+1},\quad {{\,\mathrm{\mathbf {A}}\,}}_2^2={{\,\mathrm{\mathbf {C}}\,}}_{2,m+1},\quad {{\,\mathrm{\mathbf {A}}\,}}_2^3={{\,\mathrm{\mathbf {N}}\,}}_{1,m+1},\quad {{\,\mathrm{\mathbf {A}}\,}}_2^4={{\,\mathrm{\mathbf {C}}\,}}_{1,m+1}, \end{aligned}$$

while the ones related to the temporal macroscale are

$$\begin{aligned} {{\,\mathrm{\mathbf {A}}\,}}_3^1={{\,\mathrm{\mathbf {A}}\,}}_3^3={{\,\mathrm{\mathbf {I}}\,}}_M,\quad {{\,\mathrm{\mathbf {A}}\,}}_3^2={{\,\mathrm{\mathbf {A}}\,}}_3^4={{\,\mathrm{\mathbf {L}}\,}}_M. \end{aligned}$$

In particular, the time microscale is characterized by the Toeplitz matrices, \({{\,\mathrm{\mathbf {A}}\,}}_2^1\) and \({{\,\mathrm{\mathbf {A}}\,}}_2^3\), and by the correction matrices, \({{\,\mathrm{\mathbf {A}}\,}}_2^2\) and \({{\,\mathrm{\mathbf {A}}\,}}_2^4\), with only three not null elements; the diagonal matrices \({{\,\mathrm{\mathbf {A}}\,}}_3^1\) and \({{\,\mathrm{\mathbf {A}}\,}}_3^3\) and the lower shift matrices \({{\,\mathrm{\mathbf {A}}\,}}_3^2\) and \({{\,\mathrm{\mathbf {A}}\,}}_3^4\) identify the time macroscale. The sparsity pattern associated with the 12 operators in (32) is shown in Fig. 6, for \(\Omega =(0,1)\) and \(I=[0, 100)\).

The right-hand side in (27) has to be separated, as operator \({{\,\mathrm{\mathcal {A}}\,}}_E\), in terms of the spatial scale and of the two temporal ones, so that we have

$$\begin{aligned} {{\,\mathrm{\mathcal {B}}\,}}_E = {{\,\mathrm{\mathbf {b}}\,}}_1 \otimes {{\,\mathrm{\mathbf {b}}\,}}_2 \otimes {{\,\mathrm{\mathbf {b}}\,}}_3,\quad \text {with} \quad {{\,\mathrm{\mathbf {b}}\,}}_1 = \frac{\rho }{E} {{\,\mathrm{\mathbf {v}}\,}}_0,\quad {{\,\mathrm{\mathbf {b}}\,}}_2 = \frac{1}{\Delta \tau } \begin{pmatrix} 1 \\ 0 \\ \vdots \\ 0 \end{pmatrix}_{m+1}, \quad {{\,\mathrm{\mathbf {b}}\,}}_3 = \begin{pmatrix} 1 \\ 0 \\ \vdots \\ 0 \end{pmatrix}_{M} . \end{aligned}$$
Fig. 6
figure 6

Sparsity pattern of the discrete PGD operators associated with the separated representation (32), for \(N_x = 51\), \(m + 1 = 400\) and \(M = 5\)

Remark 0.5

As expected, it turns out that the temporal multiscale PGD discrete formulation does not affect the spatial representation, the sparsity pattern of matrices \({{\,\mathrm{\mathbf {A}}\,}}_1^1\) and \({{\,\mathrm{\mathbf {A}}\,}}_1^2\) in Fig. 5 being preserved by matrices \({{\,\mathrm{\mathbf {A}}\,}}_1^1\)\({{\,\mathrm{\mathbf {A}}\,}}_1^2\) and \({{\,\mathrm{\mathbf {A}}\,}}_1^3\)\({{\,\mathrm{\mathbf {A}}\,}}_1^4\) of Fig. 6, respectively. On the contrary, the multiscale time discretization yields matrices with a considerably lower size, albeit in a larger number, with a remarkable saving in terms of memory allocation (notice that the decomposition adopted in the two-scale discretization suits the time grid in Fig. 5, being \(N_t = M (m+1) = 2000\)).

Numerical simulations

In this section we assess in more detail the PGD approximation combining the two-scale Newmark scheme with the centered finite difference method. To this aim, we consider a beam with constant section \(A = 1\), in a traction and compression regime, where an initial velocity, \(v_0\), is prescribed.

Fig. 7
figure 7

Space–time solutions for \(\kappa = 25, 100, 400, 500\) (left–right, top–bottom)

Simulations are performed by considering \(\Omega = (0,1)\) over the time domain \(I = [0,100)\), under the following assumptions:

  • Average constant acceleration (middle point rule) for Newmark scheme, i.e.,

    $$\begin{aligned} \beta = \frac{1}{4},\quad \gamma = \frac{1}{2} \implies a = \frac{1}{2},\quad b = \frac{1}{4}; \end{aligned}$$
  • Material parameters: \(\kappa =\displaystyle \frac{\rho }{E} \in K= \{ 25, 100, 400, 500\}\);

  • Sinusoidal initial velocity:

    $$\begin{aligned} v_0 (x)= {\left\{ \begin{array}{ll} \displaystyle \frac{1}{100} \sin \left( \frac{\pi x}{0.3}\right) ^2 &{} \text {for}\, x < 0.3\\[3mm] 0 &{} \text {otherwise}; \end{array}\right. } \end{aligned}$$
  • Discretization parameters: \(N_x =51\), \(m+1 = 400\), \(M = 5\).

Figure 7 collects the space–time contour plot for the propagation of the elastic wave, for each \(\kappa \in K\). The values in K have been selected in order to obtain solutions with a different level of detail in terms of behaviour at the microscale. Indeed, quantity \(\kappa \) can be easily related to the speed of the stress wave along the beam, after rewriting the differential equation in (23) as

$$\begin{aligned} \frac{1}{c^{2}}\displaystyle {\frac{\partial ^{2}u}{\partial t^{2}}}={\frac{\partial ^{2}u}{\partial x^{2}}}, \end{aligned}$$

with \( c = \sqrt{E/\rho } = \sqrt{1/\kappa } \in C = \left\{ \frac{1}{5}, \frac{1}{10}, \frac{1}{20}, \frac{1}{10\sqrt{5}} \right\} \). In particular, the time taken by the wave to travel along the whole beam (i.e., to propagate from the left- to the right-endpoint) is equal to \(\Delta t = 1/c \in \{5, 10, 20, 10\sqrt{5}\}\). Now, since we have set the number of the macro subintervals to \(M = 5\), it turns out that the microscale time variable \(\tau \) varies in the interval [0, 20). As a consequence, we register two complete wave paths (i.e., two round trips where three reflections take place) for \(\kappa = 25\), a single complete wave path (with a unique reflection) when \(\kappa = 100\), and a single one-way path for \(\kappa = 400\). On the contrary, when \(\kappa = 500\), the wave propagates too slow with respect to the microscale adopted, causing a delay between macro-dofs and reflection. This discrepancy is evident, for instance, by the low accuracy characterizing the contour plot in the bottom-right panel of Fig. 7.

Fig. 8
figure 8

PGD modes—\(\kappa = 25\)

Fig. 9
figure 9

PGD modes—\(\kappa = 100\)

Fig. 10
figure 10

PGD modes—\(\kappa = 400\)

Fig. 11
figure 11

Error decay for successive PGD enrichments for \(\kappa = 100\) (left) and \(\kappa = 500\) (right)

These comments find a further confirmation in the trend characterizing the PGD modes associated with the temporal micro- and macro-scales, and with the spatial one, collected in Figs.8, 9 and 10, respectively for the first three values of \(\kappa \). In particular, for \(\kappa = 25, 100\), the information about the periodicity of the solution are already rich enough at the microscale, which allows us to capture the complete wave path (single and double, respectively), whereas the modes over the macroscale are almost constant (only information about wave amplitude are gathered). On the contrary, when \(\kappa = 400\), the microscale follows only a one-way migration and the information about the wave reflection is recovered at the macro level through more informative macroscale modes.

To sum up, we can state that the choice of the macroscale (and, consequently, of the microscale) is crucial to properly manage the periodicity of the solution. A rough selection of M and of \(m+1\) may lead to an inaccurate solution, unless a sufficiently large number of temporal modes is adopted for the PGD reconstruction. Convergence of the PGD procedure can be also deteriorated by a not proper choice of parameters M and \(m+1\). This issue is highlighted by Fig. 11 which shows the trend of the \(L^2(\Omega )\)-norm of the relative error associated with the PGD approximation as a function of the number of the PGD enrichment iterations. As a reference, we adopt the solution to (24)–(25) coinciding with a centered finite difference discretization (in space) combined with the Newmark scheme (in time). In particular, the slow decay of the PGD error in the right panel, for \(\kappa = 500\), can be ascribed to the decomposition adopted at the macro- and at the micro-scale, which does not match the periodicity of the wave propagation.


The present work successfully accomplished addressing problems exhibiting different time scales within a multi-time separated Proper Generalized Decomposition. The classical one-dimensional time is converted into a multidimensional temporal variable, where different time coordinates correspond to different levels of resolution. This strategy leads to a considerable reduction in terms of computational complexity. Moreover, the issue related to the continuity enforcement between different scales, that motivated several works in the past, is here addressed in a very simple and efficient way, by writing the tensor decomposition in order to reproduce the tensor form of the single time scale discretization. The proposed method is numerically verified first on the one-dimensional heat problem and successively generalized to the wave propagation in elastodynamics.

As a first extension to this work, we are planning to apply the method here developed to visco-elastodynamic equations in a multiscale framework, and, successively, to the non-linear setting of the visco-elastic–plastic model. In this context, our main interest is for the response of visco-elastic–plastic materials subject to long-term cyclic fatigue loadings [26,27,28] and, in particular, under Very High Cycle Fatigue regimes [29]. Separated space–time representations and hyper-reduction of mechanical models have already been successfully applied in former studies to elastic-plastic problems [30, 31], as well as to non-linear visco-elastic systems [5, 32,33,34]. The idea is to extend the representations provided in this literature to a time multiscale framework, by further tensorization of the time coordinate, following the approach proposed in this paper. Moreover, some theoretical issues characterizing the multi-time PGD method here introduced, such as the impact of non-periodicity in time caused by irreversible plastic deformations, deserve to be addressed with a more thorough analysis.

Availability of data and materials

Interested reader can contact authors.


  1. Even though we only focus on tensor-based methods, we refer to the recent textbooks [10,11,12] for the latest developments in Model Order Reduction with several applications to multiscale and multiphysics problems.

  2. We observe that symbol \(\otimes \) refers to a revision of the standard Kronecker product, being meant

    $$\begin{aligned} {{\,\mathrm{\mathbf {A}}\,}}\otimes {{\,\mathrm{\mathbf {B}}\,}}= \begin{pmatrix} B_{1,1} {{\,\mathrm{\mathbf {A}}\,}}&{} B_{1,2} {{\,\mathrm{\mathbf {A}}\,}}&{} \cdots &{} B_{1,n}{{\,\mathrm{\mathbf {A}}\,}}\\ B_{2,1} {{\,\mathrm{\mathbf {A}}\,}}&{} B_{2,2} {{\,\mathrm{\mathbf {A}}\,}}&{} \cdots &{} B_{2,n}{{\,\mathrm{\mathbf {A}}\,}}\\ \vdots &{} \vdots &{} \ddots &{} \vdots \\ B_{m,1} {{\,\mathrm{\mathbf {A}}\,}}&{} B_{m,2} {{\,\mathrm{\mathbf {A}}\,}}&{} \cdots &{} B_{m,n} {{\,\mathrm{\mathbf {A}}\,}}\end{pmatrix} \quad \text {and} \quad {{\,\mathrm{\mathbf {a}}\,}}\otimes {{\,\mathrm{\mathbf {b}}\,}}= \begin{pmatrix} b_1 {{\,\mathrm{\mathbf {a}}\,}}\\ \vdots \\ b_m {{\,\mathrm{\mathbf {a}}\,}}\end{pmatrix}, \end{aligned}$$

    Footnote 3 continued

    respectively. This is a common choice in the PGD community to preserve the same order of the variables in the separated form [23].

  3. The two times contracted product : between second or fourth order tensors is defined as \({{\,\mathrm{\mathbf {A}}\,}}: {{\,\mathrm{\mathbf {B}}\,}}= \displaystyle \sum _{i,j} A_{ij} B_{ij}.\)


  1. Ammar A, Chinesta F, Cueto E, Doblare M. Proper generalized decomposition of time-multiscale models. Int J Numer Methods Eng. 2012;90:569–96.

    Article  MathSciNet  Google Scholar 

  2. Néron D, Ladevèze P. Proper generalized decomposition for multiscale and multiphysics problems. Arch Comput Methods Eng. 2010;17(4):351–72.

    Article  MathSciNet  Google Scholar 

  3. Passieux JC, Ladevèze P, Néron D. A scalable time-space multiscale domain decomposition method: adaptive time scale separation. Comput Mech. 2010;46(4):621–33.

    Article  MathSciNet  Google Scholar 

  4. Dureisseix D, Ladevèze P, Schrefler B. A LATIN computational strategy for multiphysics problems–application to poroelasticity. Int J Numer Methods Eng. 2003;56:1489–510.

    Article  Google Scholar 

  5. Fritzen F, Hassani MR. Space-time model order reduction for nonlinear viscoelastic systems subjected to long-term loading. Meccanica. 2018;53:1333–55.

    Article  MathSciNet  Google Scholar 

  6. Maday Y, Turinici G. A parareal in time procedure for the control of partial differential equations. C R Math. 2002;335(4):387–92.

    Article  MathSciNet  Google Scholar 

  7. Maday Y, Riahi, M, Salomon J. Parareal in time intermediate targets methods for optimal control problems. In: Control and optimization with PDE constraints. Internat Ser Numer Math. Basel: Springer. 2013. p. 79-92.

  8. Badias A, Gonzalez D, Alfaro I, Chinesta F, Cueto E. Local proper generalized decomposition. Int J Numer Methods Eng. 2017;112:1715–32.

    Article  MathSciNet  Google Scholar 

  9. Ibáñez R, Ammar A, Cueto E, Huerta A, Duval JL, Chinesta F. Multiscale proper generalized decomposition based on the partition of unity. Int J Numer Methods Eng. 2019;120(6):727–47.

    Article  MathSciNet  Google Scholar 

  10. Benner P, Schilders W, Grivet-Talocia S, Quarteroni A, Rozza G, Miguel Silveira L. Model order reduction applications. Berlin: De Gruyter; 2020.

    MATH  Google Scholar 

  11. Benner P, Schilders W, Grivet-Talocia S, Quarteroni A, Rozza G, Miguel Silveira L. Model order reduction: snapshot-based methods and algorithms. Berlin: De Gruyter; 2020.

    MATH  Google Scholar 

  12. Benner P, Schilders W, Grivet-Talocia S, Quarteroni A, Rozza G, Miguel Silveira L. Model order reduction: system- and data-driven methods and algorithms. Berlin: De Gruyter; 2020.

    MATH  Google Scholar 

  13. Ammar A. The proper generalized decomposition: a powerful tool for model reduction. Int J Mater Form. 2010;3:89–102.

    Article  Google Scholar 

  14. Ammar A, Chinesta F, Díez P, Huerta A. An error estimator for separated representations of highly multidimensional models. Comput Methods Appl Mech Eng. 2010;199:1872–80.

    Article  MathSciNet  Google Scholar 

  15. Chinesta F, Keunings R, Leygue A. The proper generalized decomposition for advanced numerical simulations. A primer. Springerbriefs in applied sciences and technology. Cham: Springer; 2014.

  16. Chinesta F, Ammar A, Cueto E. Recent advances and new challenges in the use of the proper generalized decomposition for solving multidimensional models. Arch Comput Methods Eng. 2010;17(4):327–50.

    Article  MathSciNet  Google Scholar 

  17. Chinesta F, Cueto E. PGD-based modeling of materials. Structures and processes. ESAFORM Bookseries on material forming. Cham: Springer; 2014.

    Google Scholar 

  18. Perotto S, Carlino MG, Ballarin F. Model reduction by separation of variables: a comparison between hierarchical model reduction and proper generalized decomposition. In: Sherwin SJ, Moxey D, Peirò J, Vincent PE, Schwab C, editors. Spectral and high order methods for partial differential equations ICOSAHOM 2018, vol. 134. Series: Lect. Notes Comput. Sci. Eng. Cham: Springer; 2020. p. 61–77.

  19. Chinesta F, Ammar A, Lemarchand F, Beauchene P, Boust F. Alleviating mesh constraints: model reduction, parallel time integration and high resolution homogenization. Comput Methods Appl Mech Eng. 2008;197(5):400–13.

    Article  MathSciNet  Google Scholar 

  20. Chinesta F, Ladevèze P, Cueto E. A short reviewinmodel order reduction based on proper generalized decomposition. Arch Comput Methods Eng. 2011;18(4):395–404.

    Article  Google Scholar 

  21. Ammar A, Chinesta F, Falcó A. On the convergence of a greedy rank-one update algorithm for a class of linear systems. Arch Comput Methods Eng. 2010;17(4):473–86.

    Article  MathSciNet  Google Scholar 

  22. de Silva V, Lim LH. Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM J Matrix Anal Appl. 2006;30(3):1084–127.

    Article  MathSciNet  Google Scholar 

  23. Boucinha L, Gravouil A, Ammar A. Space-time proper generalized decompositions for the resolution of transient elastodynamic models. Comput Methods Appl Mech Eng. 2013;255:67–88.

    Article  MathSciNet  Google Scholar 

  24. Lathauwer L, De Moor B. A multi-linear singular value decomposition. J Soc Ind Appl Math. 2000;21:1253–78.

    MATH  Google Scholar 

  25. Newmark NM. A method of computation for structural dynamics. J Eng Mech. 1959;85:67–94.

    Google Scholar 

  26. Oskay C, Fish J. Multiscale modeling of fatigue for ductile materials. Int J Multiscale Comp Eng. 2004;2:329–54.

    Article  Google Scholar 

  27. Oskay C, Fish J. Fatigue life prediction using 2-scale temporal asymptotic homogenization. Int J Numer Methods Eng. 2004;61:329–59.

    Article  MathSciNet  Google Scholar 

  28. Cognard J-Y, Ladevèze P. A large time increment approach for cyclic viscoplasticity. Int J Plast. 1993;9(3):141–57.

    Article  Google Scholar 

  29. Furuya Y, Hirukawa H, Takeuchi E. Gigacycle fatigue in high strength steels. Sci Technol Adv Mater. 2019;20(1):643–56.

    Article  Google Scholar 

  30. Bergheau J-M, Zuchiatti S, Roux J-C, Feulvarch É, Tissot S, Perrin G. The proper generalized decomposition as a space-time integrator for elastoplastic problems. Meccanica. 2016;344:759–68.

    Google Scholar 

  31. Nasri MA, Aguado JV, Ammar A, Cueto E, Chinesta F, Morel F, Robert C, El Arem S. Separated representations of incremental elastoplastic simulations. Key Eng Mater. 2015;651–653:1285–93.

    Article  Google Scholar 

  32. Ryckelynck D, Benziane D. Hyper-reduction framework for model calibration in plasticity-induced fatigue. Adv Model Simul Eng Sci. 2016;3:10.

    Article  Google Scholar 

  33. Cremonesi M, Néron D, Guidault P, Ladevèze P. A PGD-based homogenization technique for the resolution of nonlinear multiscale problems. Comput Methods Appl Mech Eng. 2013;267:275–92.

    Article  MathSciNet  Google Scholar 

  34. Ladevèze P, Nouy A. On a multiscale computational strategy with time and space homogenization for structural mechanics. Comput Methods Appl Mech Eng. 2003;192(28–30):3061–87.

    Article  MathSciNet  Google Scholar 

Download references


The authors acknowledge the support of the ESI Group through its research chair at ENSAM ParisTech and through the project 2019-0060 “Simulated Reality” at the University of Zaragoza. The support of the Spanish Ministry of Science through Grant number CICYT-DPI2017-85139-C2-1-R and by the Regional Government of Aragon and the European Social Fund, are also gratefully acknowledged. This work has been also partially supported by European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Actions, Grant agreement 872442 (ARIA) and by the research project GNCS-INdAM 2020.

Author information

Authors and Affiliations



All the authors participated in the definition of techniques and algorithms. All authors read and approved the final manuscript.

Corresponding author

Correspondence to Angelo Pasquale.

Ethics declarations

Competing interests

The authors declare that they have no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pasquale, A., Ammar, A., Falcó, A. et al. A separated representation involving multiple time scales within the Proper Generalized Decomposition framework. Adv. Model. and Simul. in Eng. Sci. 8, 26 (2021).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: