The proper generalized decomposition (PGD) requires separability of the input data (e.g. physical properties, source term, boundary conditions, initial state). In many cases the input data is not expressed in a separated form and it has to be replaced by some separable approximation. These approximations constitute a new error source that, in some cases, may dominate the standard ones (discretization, truncation...) and control the final accuracy of the PGD solution. In this work the relation between errors in the separated input data and the errors induced in the PGD solution is discussed. Error estimators proposed for homogenized problems and oscillation terms are adapted to asses the behaviour of the PGD errors resulting from approximated input data. The PGD is stable with respect to error in the separated data, with no critical amplification of the perturbations. Interestingly, we identified a high sensitiveness of the resulting accuracy on the selection of the sampling grid used to compute the separated data. The separation has to be performed on the basis of values sampled at integration points: sampling at the nodes defining the functional interpolation results in an important loss of accuracy. For the case of a Poisson problem separated in the spatial coordinates (a complex diffusivity function requires a separable approximation), the final PGD error is linear with the truncation error of the separated data. This relation is used to estimate the number of terms required in the separated data, that has to be in good agreement with the truncation error accepted in the PGD truncation (tolerance for the stoping criteria in the enrichment procedure). A sensible choice for the prescribed accuracy of the PGD solution has to be kept within the limits set by the errors in the separated input data.
The Proper Generalized Decomposition (PGD) [1, 2] is an a priori reduced basis technique designed to deal efficiently with highly-dimensional Boundary Value Problems (BVP). Differently from other discretisation techniques such as Finite Elements or Finite Differences, PGD avoids the exponential growth of the number of degrees of freedom with the number of dimensions. This is achieved by means of a separated representation of the solution. A separable functionf with rank q, separated on n dimensions has the form,
The key benefit of the use of a separable solution is to transform the multidimensional integrals arising in the weak form of the problem into products of single (or lower) dimensional integrals. This can be done as the integral of a separated function \(s(x,y,z)=f(x) g(y) h(z)\) can be written as,
The evaluation of 3 one-dimensional integrals of the right hand side requires smaller computational effort compared with its left hand side. The key idea is to apply the same separation strategy to the integrals arising in the weak form. A more detailed explanation of this procedure is given in Sect. “Problem statement and PGD solution for separated space dimensions”. However, as indicated in Eq. (2), not only the solution of the problem but all the functions involved in the operators must be separable. The typical functions present are material properties (thermal diffusivity, viscosity, density, etc.), initial or boundary conditions, and source terms, among others. In practice these functions usually do not admit an exact separable representation. The example used in this work consists in a Poisson problem including a non separable diffusivity function. Diffusivity could be defined by empirical laws or a fitting function of laboratory measurements; its expression then will be hardly separable. In those cases, in order to apply PGD it is usual to replace the non-separable function by a separable approximation to it. Section “Separation of the input data” presents one procedure to obtain separable approximations of known functions based on singular value decomposition.
Section “Results” shows results of a Poisson problem including the following non-separable diffusivity function:
The separation procedures usually work with discrete (mesh based) versions of the function. Therefore, this separation introduces two new sources of errors that are not present in the traditional Finite Element approach. First, a truncation error is introduced due to the finite number of terms (\(n_k\)) used to describe \(k^{\text {sep}}\). Second, an interpolation error in the spatial representation of the functions \(G^l_{x}(x)\) and \(G^l_{y}(y)\) similar to the usual FE error is also included. The goal of this work is to study the relation between these errors and the accuracy of the PGD solution. This relation can be useful to determine the number of terms \(n_k\) required to achieve a certain accuracy by PGD. Moreover, this relation can also be used as stopping criteria for the PGD enrichment process, because the PGD solution will be at most as accurate as \(k^{\text {sep}}\).
Motivation examples
Next sections present the effects of the separation of the input data in the case of an academic Poisson problem. Although, the motivation of this study comes after the authors faced PGD convergence problems in some more complex examples. Two of these problems are briefly described next.
The first example was found while solving a BVP with parameterized geometry. In that case the shape of the domain, or the location of internal interfaces, depend on a set of parameters. Figure 1 shows a parameter dependant geometry for an airfoil and the objective is to find the air flow around it. The method applied was proposed in [3] and later extended in [4]. It is based on the idea of having a reference domain \(\mathcal {T}\) and a mapping function that relates all possible geometries to the reference domain. In practice, this mapping introduces some Jacobians depending on the parameters to the equation and, therefore, the dependence of the problem on the geometrical parameters becomes explicit. For example, the usual bilinear form for a Poisson problem reads
where \(\hat{\varvec{x}}\) are the reference coordinates. The matrix \(\mathbf D ({\varvec{\mu }})\), including all the Jacobians, accounts for the geometrical parameterization. The analytical expression of \(\mathbf D ({\varvec{\mu }})\) is known, but it is not separable. An approximation to it is therefore utilized in practice. The discretization used in the separation of D was found of to be of key importance in order keep the convergence of PGD. The truncation errors are also relevant and ultimately may control the final convergence that PGD could attain.
Fig. 1
Motivation example: flow around a geometrically parameterized airfoil. The solution of parameterized geometries involves the separation of the Jacobians and, therefore, a truncation error in introduced in the operators
A second example arises in a scheme proposed in [5] for the real-time integration of solid dynamics equations. The scheme combines Proper Orthogonal Decomposition (POD) and PGD approaches and it is based upon a parametric formulation depending on the initial conditions. It implements a direct time integrator that can be seen as a sort of black-box: it that takes the resulting displacement field of the current time step as input and (via POD) provides the result for the subsequent time step. In order to reduce the high dimensionality produced by the large amount of parameters describing the initial displacement field a reduced basis is obtained using PGD. This step introduces again a truncation error that will affect the final convergence of the proposed scheme. Figure 2 shows two results with 3 and 8 terms in the approximation of the input data (initial conditions). Note that the solution including only 3 terms presents phase errors that disappear for the 8 terms solution.
Fig. 2
Motivation example: real-time integration of solid dynamics. The initial conditions of the problem are separated. Left and right panel show the solution of the problem when the input data is separated with 3 and 8 terms, respectively. In the former case there is an error in the amplitude and also in the phase, while in the later the error is only in the amplitude and the phase is corrected
A priori estimates for FE
Different sources of errors are present in the solution provided by PGD (see for example [6–8]. If u is the analytical solution of the BVP and \(u_{H,M}\) is the solution of PGD characterized by a mesh size H and a number of terms M, the PGD error is then defined by \(e:=u-u_{H,M}\). This error can be divided into several sources: first, an interpolation error, \(e_{FE}= u - u_{H}\), related with the space discretization, where \(u_H\) is the standard FE solution of the problem. Second, a truncation error \(e_M:=u_{H} - u_{H,M}\) that comes from the finite number of terms computed by PGD. The PGD error e, therefore, can be written as
where the contribution of each type of error becomes explicit. Figure 3 shows schematically the relation between these errors. When the input data separation is required and functions are replaced by separable approximations, another source of errors is introduced. The replacement of function k by \(k^\text {sep}\) is assumed to affect similarly to the FE solution and the PGD solution (i.e. the truncation error is assumed to be independent of the error introduced by FE). If the error affects the source term, error estimators proposed for data oscillation could be used, for example [9].
Fig. 3
Error sources in the PGD solution The approximation introduced by data separation affects the PGD and the FE solutions
The standard error estimates for FE read
$$\begin{aligned} e_H = \Vert u-u_H\Vert \le C H^{\alpha }, \end{aligned}$$
for some value of alpha depending on the norm chosen, the element type and the regularity of the solution. For the sake of simplicity and in concordance with the proper measure for error expected in the separated approximation, in the following the norm under consideration, denoted by \(\Vert \cdot \Vert \), is the L\(_{2}\) norm.
Fig. 4
Spatial distribution of errors (\(\Vert k^\text {sep} - k\Vert \)) of the separated k function including 30 terms. Errors are computed at nodal points of a \(100\times 100\) uniform structured mesh. When compared with k (Fig. 5), errors are a highly oscillatory, small amplitude function
If the diffusivity function k is the one separated, the ideas of homogenization theory (e.g. [10, 11]) can be recalled: k can be understood as \(k = k^\text {sep} + \varepsilon \), being \(\varepsilon \) a highly oscillatory function with small amplitude compared to k. Figure 4 shows the spatial variation of \(\varepsilon \) (computed as \(\Vert k^\text {sep} - k\Vert \)). Note that \(\varepsilon \) can be reduced by increasing the number of terms \(n_k\) in \(k^\text {sep}\). The problem, although, is inverse to the standard homogenization problem: the exact solution here is smooth and the high frequency terms are the errors introduced by the separation. The fact of replacing k by \(k^\text {sep}\) produces the same error as the opposite. Thus, \(k^\text {sep}\) is seen as a de-regularization of k, where the high-frequency terms are truncated. This is the same effect produced in the homogenization, and therefore the error introduced by the homogenization is of the same type of the error produced in using a separated approximation of the material property. Thus, if oscillation terms are included (either by perturbations of k or s) an extra term appears:
being \(\text {Osc} \propto \Vert k - k^\text {sep}\Vert \) in the case in which k is replaced by \(k^\text {sep}\). The truncation error, \(e_M\), introduced by PGD is a function decreasing with the number of terms M, so its norm is bounded by \(\Vert e_M\Vert \le \tilde{C} F(M)\). Note that, as mentioned above, for error affecting the source term s the standard estimates for oscillation terms provide a similar expression for Osc [9].
The final error of the PGD solution, therefore can be stated as
This bound expression shows that if Osc dominates over the truncation error, the error of the PGD solution cannot be reduced. On the other hand, if an estimation for Osc and for \(e^\text {sep}_H\) at enrichment step i are available, (6) can be used as stopping criteria of the enrichment process.
Problem statement and PGD solution for separated space dimensions
In order to study the propagation of the errors within the PGD scheme a boundary value problem governed by a Poisson equation is considered. Its solution u, taking values in \(\Omega \), satisfies,
$$\begin{aligned} - \nabla \cdot \left( k \nabla u\right)&= s&\qquad \text { in } \Omega \end{aligned}$$
(7a)
$$\begin{aligned} \left( k \nabla u\right) \cdot {\varvec{n}}&= g_N&\qquad \text { on } \Gamma _N \end{aligned}$$
(7b)
$$\begin{aligned} u&= u_{D}&\qquad \text { on } \Gamma _D \end{aligned}$$
(7c)
where the source term s, the prescribed values on the Dirichlet boundary \(u_{D}\), the prescribed flux on the Neumann value \(g_{N}\) and the diffusivity k are the data set. The usual variational form for this problem reads: find \(u\in V\) such that
where \(V:= \{u\in \mathcal {H}^1(\Omega ) : u=u_D \text { in }\Gamma _D\}\) and its corresponding test functions space is \(V_0:= \{u\in \mathcal {H}^1(\Omega ) : u=0\text { on }\Gamma _D\}\). The bilinear and linear forms \(a(\cdot ,\cdot )\) and \(\ell (\cdot )\) are given by
$$\begin{aligned} a\left( u,v\right) := \int _{\Omega } \nabla u \cdot (k \nabla v) \,d\Omega \quad \text {and}\quad \ell (v):= \int _{\Omega } s v \,d\Omega + \int _{\Gamma _N} g_N v \,ds. \end{aligned}$$
(9)
Space-separated PGD algorithm
The space-separated PGD algorithm for problem (8) is based on a separated solution \(u^{\text {sep}}(x,y)\) with the form
As usual, \(u^{\text {sep}}\) is inserted in the weak form (8). In this case, the diffusivity function k(x, y) is also replaced by its separable approximation \(k^{\text {sep}}\), see Eq. (4), and therefore the operator \(a(\cdot ,\cdot )\) is somehow redefined. The problem then reads: find \(u^{\text {sep}}\) such that
Using the separability of \(u^{sep}\), \(k^{sep}\) and defining \(v=v_x v_y\) (as explained next), \(a^{sep}(\cdot ,\cdot )\) is written (and solved) in terms of one dimensional integrals as,
Note that if k is not separable, this last step can not be done and the two integrals stay nested.
The definition of \(\ell (\cdot )\) remains unchanged.
Assuming that the initial \(n_u\) terms of \(u^\text {sep}\) are known (that is all functions \(F_x^m\) and \(F_y^m\), for \(m=1\ldots n_u\) are known), each new mode, \(F_x F_y\), added to \(u^\text {sep}\) is obtained by solving the following problem:
To simplify notation, the dependence of each function \(F^m_*\) is kept implicit in the subindex, for example \(F^i_x\) stands for \(F^i_x(x)\).
The PGD solution is constructed one term at a time using the incremental procedure suggested in (10). The addition of a new term involves solving problem (10) with all the previously computed modes in their right hand side. Note that this problem is non linear because of the multiplication of the unknown functions \(F_x\) and \(F_y\). This non linearity is usually handled by an alternate-directions algorithm consisting in first solving for \(F_x\), assuming \(F_y\) is known, and then solving for \(F_y\), assuming \(F_x\) is known. These two (linear) subproblems are iterated until convergence.
The test functions v belong to \(V_0\) and they are written as \(v=\delta {F}_x F_{y} + F_x \delta {F}_{y} \). When solving the first subproblem, \(F_y\) is assumed to be fix and therefore \(\delta F_y\) vanishes. The test function v, then, simplifies to \(v=\delta {F}_x F_{y}\). The first subproblem is stated as,
The second problem is completely symmetric, inverting the dimensions x and y.
Separation of the input data
Several procedures can be applied to obtain separable approximations of known functions. The proper orthogonal decomposition (POD) and the singular value decomposition (SVD) are the most common techniques when the separation is done in two dimensions. Many techniques have been proposed to extend SVD to higher number of dimensions. These techniques are usually called higher-order, as they were originally proposed to decompose higher-order tensors. An overview can be found, for example, at [12]. Some examples are the higher-order SVD (HOSVD) [13], the CANDECOMP/PARAFAC (CP) [14, 15] and the Tucker decomposition [16].
When the number of separated dimensions is two, the POD and the SVD are equivalent and they provide a optimal decomposition in the sense that they provide the minimum number of required to obtain an given accuracy. Unfortunately, for \(n>2\) this property is lost and usually there is no guarantee of the optimality of the separated tensor.
Recently in [17] a method based on PGD was proposed to perform efficiently separation of functions. This approach has the advantages of being equivalent to SVD when the separation is done in two-dimensions and it is trivial to extend it to higher dimensions. This technique produced decompositions having lower rank than HOSVD for all tested cases and it does not require to specify the order of the separated function before starting the process (as CP does).
The application of SVD to obtain a two-dimensional separable approximation is explained next: consider a discrete approximation of a function f(x, y) supported on a finite element (FE) mesh, that is, f is determined by a set of nodal values \(f_i\) for \(i=1, \ldots , n_t\). In this case the dimensions in which the function will be separated are the cartesian axis x and y. The form of the approximation is,
where the set of function \(F^m(x)\) and \(G^m(y)\) are to be determined. A scalar \(\alpha ^m\) holding the amplitude of each term is added in order to normalize \(F^m\) and \(G^m\). These functions are also supported in a FE mesh with the corresponding dimensionality; in this example both are 1D meshes.
Let \(\mathbf M \in \mathcal {R}^{m\times n}\) be a matrix with rank r and coefficients \(f(x_i,y_i)\), where \(x_i\) and \(y_i\) are the nodal locations. The SVD provides a factorisation \(\mathbf M \) in the form
$$\begin{aligned} \mathbf M = \mathbf U \cdot \mathbf S \cdot \mathbf V ^T \end{aligned}$$
(12)
where the columns of \(\mathbf U \in \mathcal {R}^{m \times m}\) are called the left-singular-vectors and denoted here as \(\mathbf U _i\). The columns of \(\mathbf V \in \mathcal {R}^{n \times n}\) are called the right-singular-vectors and denoted \(\mathbf V _j\). The matrix \(\mathbf S \in \mathcal {R}^{m \times n}\) is rectangular and diagonal and holds the singular values of \(\mathbf M \) sorted from larger (\(\mathbf S _{11}\)) to smaller. Matrices \(\mathbf U \) and \(\mathbf V \) are both unitary, in the sense that their transpose its equal to their right inverse.
The factorisation provided be SVD allows to construct a separated representation of the matrix \(\mathbf M \) as,
$$\begin{aligned} \mathbf M = \sum _{i=1}^{r} \mathbf S _{ii} \cdot \mathbf U _i \cdot \mathbf V _i^T. \end{aligned}$$
(13)
In practice, the rank of the separated tensor is kept as low as possible as the computational effort is usually proportional to the number of terms in it. Therefore, it is usual to truncate the sum and discard all terms with amplitud smaller than a given threshold. That is, the terms corresponding to the largest eigenvalues are kept and terms with smaller eigenvalues are discarded.
As an example the function \(k(x,y) = \sin \left( \frac{1}{2} (x+y)^2\right) + 2\) introduced in (3) is separated using SVD to obtain \(k^{\text {sep}}(x,y)\) as defined in (4). This function is chosen because it does not admits an exact separated representation (Fig. 5). Figure 5 shows the function k(x, y) (top right), the amplitude of the initial terms in the separated version of k, that is, the diagonal coefficients of the matrix \(\mathbf S \) (top left), and the functions \(F^m\) and \(G^m\) for the four initial terms of \(k^{\text {sep}}(x,y)\). Note that with the initial 25 terms the function k is approximated to machine precision. The meshes corresponding to F and G, both have 402 nodes.
Fig. 5
Separation of the diffusivity function using SVD. Top left panel shows the analytic diffusivity function k. Top right panel show the relative weight of the initial 30 terms of the separated functions; the relative weight is computed as the sum of the amplitude of all previous terms, divided by largest amplitude. Lower panels show the functions F and G corresponding to the initial four terms
Influence of the sampling points
The first idea is sampling the input data (material parameters, source terms\(\ldots \)) on the nodes of the grid used for the space and parametric discretization. As it is shown in the next section, this choice is not particularly sensible because the values of these functions are required at the integration points of the FE mesh used to solve the weak form of the equation. This extends not only to the spatial coordinates but also to the parametric coordinates because the parametric modes are approximated in a least squares sense (Galerkin L\(_{2}\) projection). Thus, separation has to be performed on the basis of values sampled at integration points: sampling at the nodes defining the functional interpolation results in an important loss of accuracy.
Results
The behaviour of the PGD scheme with respect to errors in the input data is studied next via a series of numerical experiments. The problem (7) is solved using PGD as described above in a square domain with size \([0,4]\times [0,4]\). It is closed with Dirichlet boundary conditions on the top and bottom sides with values one and zero respectively and homogeneous Neumann in the lateral sides. The separated diffusivity function (4) is used. The mesh is structured and regular and has 100 elements in each dimension.
The relative errors shown in convergence curves are computed as the \(H_1\) norm of the relative difference between the PGD solution and a reference Finite Element solution computed over the same mesh. Note that the FE solution is computed using the exact analytic expression for the diffusivity k.
Input data sampling
The diffusivity function (3) is separated using the SVD approach described in Sect. “Separation of the input data”. To do that, the spatial grid to sample the function k(x, y) needs to be selected. The first choice taken here is to evaluate k in the same mesh that will be later used in the discretization of u. In this case, it is a regular grid with \(101\times 101\) nodes. This is an overkill mesh to represent the function k (see first panel of Fig. 5). The \(k^\text {sep}\) separated function described with 26 terms has an maximum nodal relative error of the order of machine tolerance (\(10^{-14}\)).
When \(k^\text {sep}\) is introduced into the weak form and the problem is solved via PGD, the solution obtained is rather inaccurate having relative errors of order \(10^{-2}\) (Fig. 6). This poor behaviour comes from the fact that the diffusivity function was sampled at the nodes but it is required by PGD (and by FE) at the integration points. The values of \(k^\text {sep}\) used in the integrals are interpolated spatially and therefore an “H-like” error is introduced. This error is not related with the truncation on the number of terms used in \(k^\text {sep}\), but is only dependent on the grid chosen to sample k.
Fig. 6
Evolution of the error of the PGD solution with the number of terms for a \(k^\text {sep}\) function with discretized on the nodes. The separated diffusivity function is discretized on a grid that coincides with the nodal points used to describe the solution \(u^\text {sep}\)
In the example above, despite the nodal values of \(k^\text {sep}\) have errors that could be negligible, the interpolated values at the mid points of the elements have relative error of order \(10^{-2}\), coinciding with the maximum accuracy that PGD could provide.
To overcome this limit the grid used to sample \(k^\text {sep}\) is modified so that the grid nodes coincide with the integration points that will be used later by the integrals of PGD. Figure 7 shows an example of such a mesh for a quadrature of 4 points per element in each direction x and y. Same as in the previous grid, the nodal values of \(k^\text {sep}\) have errors comparable of machine tolerance but, in this case, the spatial interpolation is completely avoided. When this new \(k^\text {sep}\) is used, the limit imposed by the interpolation disappears and PGD recovers it normal convergence.
Fig. 7
Grid for the discretization of \(k^\text {sep}\) coinciding with the location of the integration points. Left mesh for \(u^\text {sep}\) in gray lines and location of integration points. Right mesh for \(u^\text {sep}\) in thick gray lines and mesh for \(k^\text {sep}\) in thin red lines
Accuracy of \(k^\text {sep}\)
A second set of tests is done to evaluate the relation between the accuracy of PGD and the truncation error of \(k^\text {sep}\). To do that, the problem is solved several times using different truncated versions of \(k^\text {sep}\) for \(n_k=5, 6, 7, \ldots , 11, 12, 14\). Note that all \(n_k\) are smaller than 26 (26 terms were required to get machine tolerance at the nodes) and therefore we do not expect the errors to vanish at the nodes. The grid for \(k^\text {sep}\) is taken coinciding with the integration points. Figure 8 shows the different convergence curves of the error on the PGD solution as a function of the number of terms. Recall that the errors are computed against the FE solution having the exact k function. All curves present a final flattening and a convergence to an error that is imposed by truncation error of \(k^\text {sep}\). In other words, at some point, the error Osc (that does not depends on the number of terms) dominates in (6) and therefore the PGD error cannot decrease. The better the description of \(k^\text {sep}\) (that is, the larger \(n_k\) and the smaller the Osc term), the smaller the final error achieved by PGD. For this example and when Osc dominates, the relation between the PGD error and \(k^\text {sep}\) truncation error is linear with slope close to one (as shown in Fig. 9).
Fig. 8
Evolution of the error of the PGD solution with the number of terms. Errors are relative and computed against a FE solution. Each curve corresponds with a PGD solution including a different accuracy of \(k^\text {sep}\)
Fig. 9
Dependence of the final PGD error as a function of the errors introduced by \(k^\text {sep}\) in the range where the separation error is dominant a linear dependence (having slope equal to one) is obtained
Previous results were done using a very smooth diffusivity function k. To test the robustness of the result, the accuracy study is repeated using a new discontinuous function \(k_2\) defined as
The separated version of \(k_2\), shown in Fig. 10 requires more terms than the smooth k to reach nodal machine precision. The results are consistent with the previous and the final convergence of the PGD solution is controlled by the accuracy of \(k_2^{sep}\). Figure 11 shows convergence curves for \(k_2^{sep}\) having 10, 20, 30, 35 and 40 terms.
Fig. 10
Separation of the discontinuous diffusivity function using SVD. Top left panel shows the analytic diffusivity function \(k_2\). Top right panel show the relative weight of the initial 45 terms of the separated function; the relative weight is computed as the sum of the amplitude of all previous terms, divided by largest amplitude. Lower panels show the functions F and G corresponding to the initial four terms
Fig. 11
Dependence of the final PGD error as a function of the errors introduced by the discontinuous diffusivity function \(k_2^\text {sep}\)
Conclusions
The stability of PGD with respect to errors in the input data was studied by means of numerical experiments. These errors are in practice present due to the need of approximate input data by truncated separable expressions. Moreover, separation requires discretization introducing into the input data a “spatial” h-like error.
Results show that PGD is stable (it does not amplify errors). In the tested case of a boundary value problem governed by the Poisson equation, the errors introduced on the diffusivity function are linear with the final error that PGD commits. The grid in which the separated data is represented is crucial to the accuracy of PGD; to minimize interpolation error, the mesh for the input data should coincide with the integration points used for the solution of u.
The relation between the errors in the input data and the final error of PGD can be used to decide the accuracy required in the input data to get a certain accuracy on the PGD solution. In the example presented in this work, as the relation between these errors is linear, it is straightforward to determine, given the desired accuracy in the final solution, which is the accuracy required at the nodal values in the input data.
This relation can also be used as stoping criteria for the enrichment process of the PGD solution. If some error indicator is available (see for example [6]), the limit imposed by the separated input data can be used as the tolerance to end the enrichment process. In the case that no formal error indicator is computed, the relative amplitude of the last computed term, \(\alpha _n / \Vert u^{PGD}\Vert \), can be compared with the tolerance imposed by the separation of the input data. Note that this is an heuristic stopping criteria that cannot be translated into an estimation on error on the solution. Although, it provides a reference value for the tolerance as the relative amplitude of the terms is not expected to be much smaller than it.
Declarations
Authors' contributions
All authors discussed the content of the article based on their previous experiences using PGD. SD and PD prepare and run the numerical examples based on the Poisson problem. EC and DG prepare and run the numerical examples based on the XXX problem. All authors read and approved the final manuscript.
Acknowledgements
This work has been partially supported by the Spanish Ministry of Science and Competitiveness, through Grant Number CICYT- DPI2014-51844-C2-2-R and DPI2014-51844-C2-1-R and by the Generalitat de Catalunya, Grant Number 2014-SGR-1471.
Competing interests
The authors declare that they have no competing interests.
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors’ Affiliations
(1)
Laboratori de Calcul Numeric (LaCaN), E.T.S. de Ingenieros de Caminos, Canales y Puertos, Universitat Politecnica de Catalunya
(2)
Aragon Institute of Engineering Research, Universidad de Zaragoza
References
Ammar A, Mokdad B, Chinesta F, Keunings R. A new family of solvers for some classes of multidimensional partial differential equations encountered in kinetic theory modelling of complex fluids. J Non Newton Fluid Mech. 2006;139:153–76.View ArticleMATHGoogle Scholar
Ammar A, Mokdad B, Chinesta F, Keunings R. A new family of solvers for some classes of multidimensional partial differential equations encountered in kinetic theory modeling of complex fluids. Part II: transient simulation using space-time separated representations. J Non Newton Fluid Mech. 2007;144:98–121.View ArticleMATHGoogle Scholar
Ammar A, Huerta A, Chinesta F, Cueto E. Parametric solutions involving geometry: a step towards efficient shape optimization. Comput Methods Appl Mech Eng. 2014;268:178–93.MathSciNetView ArticleMATHGoogle Scholar
Zlotnik S, Díez P, Modesto D, Huerta A. Proper generalized decomposition of a geometrically parametrized heat problem with geophysical applications. Int J Numer Meth Eng. 2015;103(10):737–58. doi:10.1002/nme.4909.MathSciNetView ArticleGoogle Scholar
González D, Cueto E, Chinesta F. Real-time direct integration of reduced solid dynamics equations. Int J Numer Meth Eng. 2014;99(9):633–53.MathSciNetView ArticleGoogle Scholar
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.MathSciNetView ArticleMATHGoogle Scholar
Bouclier R, Louf F, Chamoin L. Real-time validation of mechanical models coupling PGD and constitutive relation error. Comput Mech. 2013;52(4):861–83.Google Scholar
Nadal E, Leygue A, Chinesta F, Beringhier M, Ródenas JJ, Fuenmayor FJ. A separated representation of an error indicator for the mesh refinement process under the proper generalized decomposition framework. Comput Mech. 2015;55(2):251–66.MathSciNetView ArticleMATHGoogle Scholar
Morin P, Nochetto RH, Siebert KG. Data oscillation and convergence of adaptive FEM. SIAM J Numer Anal. 2000;38(2):466–88.MathSciNetView ArticleMATHGoogle Scholar
Abdulle A. On a priori error analysis of fully discrete heterogeneous multiscale FEM. Multiscale Modeling and Simulation. SIAM Interdiscip J. 2005;4(2):447–59.Google Scholar
Ming P, Zhang P. Analysis of the heterogeneous multiscale method for elliptic homogenization problems. J Am Math Soc. 2005;18(1):121–56.Google Scholar
De Lathauwer L, De Moor B, Vandewalle J. A multilinear singular value decomposition. SIAM J Matrix Anal Appl. 2000;21(4):1253–78.MathSciNetView ArticleMATHGoogle Scholar
Carroll JD, Chang J-J. Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition. Psychometrika. 1970;35(3):283–319.View ArticleMATHGoogle Scholar
Harshman RA. Foundations of the PARAFAC procedure: models and conditions for an “explanatory” multimodal factor analysis. UCLA Work Pap phon. 1970;16:1–84.Google Scholar
