1,720,987 research outputs found
Model Order Reduction for Nonlinear and Time-Dependent Parametric Optimal Flow Control Problems
Full text linkThe goal of this thesis is to provide an overview of the latest advances on reduced order methods for parametric optimal control governed by partial differential equations. Historically, parametric optimal control problems are a powerful and elegant mathematical framework to fill the gap between collected data and model equations to make numerical simulations more reliable and accurate for forecasting purposes. For this reason, parametric optimal control problems are widespread in many research and industrial fields. However, their computational complexity limits their actual applicability, most of all in a parametric nonlinear and time-dependent framework. Moreover, in the forecasting setting, many simulations are required to have a more comprehensive knowledge of very complex systems and this should happen in a small amount of time. In this context, reduced order methods might represent an asset to tackle this issue. Thus, we employed space-time reduced techniques to deal with a wide range of equations. We propose a space-time proper orthogonal decomposition for nonlinear (and linear) time-dependent (and steady) problems and a space-time Greedy with a new error estimation for parabolic governing equations. First of all, we validate the proposed techniques through many examples, from
the more academic ones to a test case of interest in coastal management exploiting the Shallow Waters Equations model.
Then, we will focus on the great potential of optimal control techniques in several advanced applications. As a first example, we will show some deterministic and stochastic environmental applications, adapting the reduced model to the latter case to reach even faster numerical simulations. Another application concerns the role of optimal control in steering bifurcating phenomena arising in nonlinear governing equations. Finally, we propose a neural network-based paradigm to deal with the optimality system for parametric prediction
Dynamical low-rank approximation strategies for nonlinear feedback control problems
No full textThis paper addresses the stabilization of dynamical systems in the infinite horizon optimal control setting using nonlinear feedback control based on State-Dependent Riccati Equations (SDREs). While effective, the practical implementation of such feedback strategies is often constrained by the high dimensionality of state spaces and the computational challenges associated with solving SDREs, particularly in parametric scenarios. To mitigate these limitations, we introduce the Dynamical Low-Rank Approximation (DLRA) methodology, which provides an efficient and accurate framework for addressing high-dimensional feedback control problems. DLRA dynamically constructs a low-dimensional representation that evolves with the problem, enabling the simultaneous resolution of multiple parametric instances in real-time. We propose two novel algorithms to enhance numerical performances: the cascade-Newton-Kleinman method and Riccati-based DLRA (R-DLRA). The cascade-Newton-Kleinman method accelerates convergence by leveraging Riccati solutions from the nearby parameter or time instance, supported by a theoretical sensitivity analysis. R-DLRA integrates Riccati information into the DLRA basis construction to improve the quality of the solution. These approaches are validated through nonlinear one-dimensional and two-dimensional test cases showing transport-like behavior, demonstrating that R-DLRA outperforms standard DLRA and Proper Orthogonal Decomposition-based model order reduction in both speed and accuracy, offering a superior alternative to Full Order Model solutions
Deflation-based certified greedy algorithm and adaptivity for bifurcating nonlinear PDEs
Full text linkThis work deals with tailored reduced order models for bifurcating nonlinear parametric partial differential equations, where multiple coexisting solutions arise for a given parametric instance. Approaches based on proper orthogonal decomposition have been widely investigated in the literature, but they usually rely on some a-priori knowledge about the bifurcating model and lack any error estimation. On the other hand, standard certified reduced basis techniques fail to represent correctly the branching behavior, since the error estimator is no longer reliable. The main goal of the contribution is to overcome these limitations by introducing two novel algorithms: (i) the adaptive-greedy, detecting the bifurcation point starting from scarce information over the parametric space, and (ii) the deflated-greedy, certifying multiple coexisting branches simultaneously. The former approach takes advantage of the features of the reduced manifold to detect the bifurcation, while the latter exploits the deflation and continuation methods to discover the bifurcating solutions and enrich the reduced space. We test the two strategies for the Coanda effect held by the Navier–Stokes equations in a sudden-expansion channel. The accuracy of the approach and the error certification are compared with vanilla-greedy and proper orthogonal decomposition.EPF
Stabilized weighted reduced order methods for parametrized advection-dominated optimal control problems governed by partial differential equations with random inputs
No full textIn this work, we analyze Parametrized Advection-Dominated distributed Optimal Control Problems with random inputs in a Reduced Order Model (ROM) context. All the simulations are initially based on a finite element method (FEM) discretization; moreover, a space-time approach is considered when dealing with unsteady cases. To overcome numerical instabilities that can occur in the optimality system for high values of the P & eacute;clet number, we consider a Streamline Upwind Petrov-Galerkin technique applied in an optimize-then-discretize approach. We combine this method with the ROM framework in order to consider two possibilities of stabilization: Offline-Only stabilization and Offline-Online stabilization. Moreover we consider random parameters and we use a weighted Proper Orthogonal Decomposition algorithm in a partitioned approach to deal with the issue of uncertainty quantification. Several quadrature techniques are used to derive weighted ROMs: tensor rules, isotropic sparse grids, Monte-Carlo and quasi Monte-Carlo methods. We compare all the approaches analyzing relative errors between the FEM and ROM solutions and the computational efficiency based on the speedup-index
A Streamline upwind Petrov-Galerkin Reduced Order Method for Advection-Dominated Partial Differential Equations under Optimal Control
Full text linkIn this paper we will consider distributed Linear-Quadratic Optimal Control
Problems dealing with Advection-Diffusion PDEs for high values of the P\'eclet
number. In this situation, computational instabilities occur, both for steady
and unsteady cases. A Streamline Upwind Petrov-Galerkin technique is used in
the optimality system to overcome these unpleasant effects. We will apply a
finite element method discretization in an optimize-then-discretize approach.
Concerning the parabolic case, a stabilized space-time framework will be
considered and stabilization will also occur in both bilinear forms involving
time derivatives. Then we will build Reduced Order Models on this
discretization procedure and two possible settings can be analyzed: whether or
not stabilization is needed in the online phase, too. In order to build the
reduced bases for state, control, and adjoint variables we will consider a
Proper Orthogonal Decomposition algorithm in a partitioned approach. It is the
first time that Reduced Order Models are applied to stabilized parabolic
problems in this setting. The discussion is supported by computational
experiments, where relative errors between the FEM and ROM solutions are
studied together with the respective computational times.Comment: 27 pages, 36 figures, 4 table
A Data-Driven Partitioned Approach for the Resolution of Time-Dependent Optimal Control Problems with Dynamic Mode Decomposition
Full text link
Variational multiscale evolve and filter strategies for convection-dominated flows
Full text linkThe evolve-filter (EF) model is a filter-based numerical stabilization for under-resolved convection-dominated flows. EF is a simple, modular, and effective strategy for both full-order models (FOMs) and reduced-order models (ROMs). It is well-known, however, that when the filter radius is too large, EF can be overdiffusive and yield inaccurate results. To alleviate this, EF is usually supplemented with a relaxation step. The relaxation parameter, however, is very sensitive with respect to the model parameters. In this paper, we propose a novel strategy to alleviate the EF overdiffusivity. Specifically, we leverage the variational multiscale (VMS) framework to separate the large resolved scales from the small resolved scales in the evolved velocity, and we use the filtered small scales to correct the large scales. Furthermore, in the new VMS-EF strategy, we use two different approaches to decompose the evolved velocity: the VMS Evolve-Filter-Filter-Correct (VMS-EFFC) and the VMS Evolve-Postprocess-Filter-Correct (VMS-EPFC) algorithms. The new VMS-based algorithms yield significantly more accurate results than the standard EF in both the FOM and the ROM simulations of a flow past a cylinder at Reynolds number Re = 1000
- …
