proper generalized decomposition based dynamic data driven inverse identification

dynamic data-driven application systems—dddas—appear as a new paradigm in the field of applied sciences and engineering, and in particular in simulation-based engineering sciences. by dddas we mean a set of techniques that allow the linkage of simulation tools with measurement devices for real-time control of systems and processes. one essential feature of dddas is the ability to dynamically incorporate additional data into an executing application, and in reverse, the ability of an application to dynamically control the measurement process. dddas need accurate and fast simulation tools using if possible off-line computations to limit as much as possible the on-line computations. with this aim, efficient solvers can be constructed by introducing all the sources of variability as extra-coordinates in order to solve the model off-line only once. this way, its most general solution is obtained and therefore it can be then considered in on-line purposes. so to speak, we introduce a physics-based meta-modeling technique without the need for prior computer experiments. however, such models, that must be solved off-line, are defined in highly multidimensional spaces suffering the so-called curse of dimensionality. we proposed recently a technique, the proper generalized decomposition—pgd—able to circumvent the redoubtable curse of dimensionality. the marriage of dddas concepts and tools and pgd off-line computations could open unimaginable possibilities in the field of dynamic data-driven application systems. in this work we explore some possibilities in the context of on-line parameter estimation.