Sergio Zlotnik

Pedro Diez, Sergio Zlotnik, Antonio Huerta

Design optimization and uncertainty quantification, among other applications of industrial interest, require fast or multiple queries of some parametric model. The Proper Generalized Decomposition (PGD) provides a separable solution, a \emph{computational vademecum} explicitly dependent on the parameters, efficiently computed with a greedy algorithm combined with an alternated directions scheme and compactly stored. This strategy has been successfully employed in many problems in computational mechanics. The application to problems with saddle point structure raises some difficulties requiring further attention. This article proposes a PGD formulation of the Stokes problem. Various possibilities of the separated forms of the PGD solutions are discussed and analyzed, selecting the more viable option. The efficacy of the proposed methodology is demonstrated in numerical examples for both Stokes and Brinkman models.

Ruben Sevilla, Sergio Zlotnik, Antonio Huerta

The main objective of this work is to describe a general and original approach for computing an off-line solution for a set of parameters describing the geometry of the domain. That is, a solution able to include information for different geometrical parameter values and also allowing to compute readily the sensitivities. Instead of problem dependent approaches, a general framework is presented for standard engineering environments where the geometry is defined by means of NURBS. The parameters controlling the geometry are now the control points characterising the NURBS curves or surfaces. The approach proposed here, valid for 2D and 3D scenarios, allows a seamless integration with CAD preprocessors. The proper generalised decomposition (PGD), which is applied here to compute explicit geometrically parametrised solutions, circumvents the curse of dimensionality. Moreover, optimal convergence rates are shown for PGD approximations of incompressible flows.

Marc Rocas, Alberto García-González, Sergio Zlotnik et al.

Uncertainty Quantification (UQ) is a key discipline for computational modeling of complex systems, enhancing reliability of engineering simulations. In crashworthiness, having an accurate assessment of the behavior of the model uncertainty allows reducing the number of prototypes and associated costs. Carrying out UQ in this framework is especially challenging because it requires highly expensive simulations. In this context, surrogate models (metamodels) allow drastically reducing the computational cost of Monte Carlo process. Different techniques to describe the metamodel are considered, Ordinary Kriging, Polynomial Response Surfaces and a novel strategy (based on Proper Generalized Decomposition) denoted by Separated Response Surface (SRS). A large number of uncertain input parameters may jeopardize the efficiency of the metamodels. Thus, previous to define a metamodel, kernel Principal Component Analysis (kPCA) is found to be effective to simplify the model outcome description. A benchmark crash test is used to show the efficiency of combining metamodels with kPCA.

Alberto García-González, Antonio Huerta, Sergio Zlotnik et al.

Methodologies for multidimensionality reduction aim at discovering low-dimensional manifolds where data ranges. Principal Component Analysis (PCA) is very effective if data have linear structure. But fails in identifying a possible dimensionality reduction if data belong to a nonlinear low-dimensional manifold. For nonlinear dimensionality reduction, kernel Principal Component Analysis (kPCA) is appreciated because of its simplicity and ease implementation. The paper provides a concise review of PCA and kPCA main ideas, trying to collect in a single document aspects that are often dispersed. Moreover, a strategy to map back the reduced dimension into the original high dimensional space is also devised, based on the minimization of a discrepancy functional.