199 research outputs found
An adaptive POD approximation method for the control of advection-diffusion equations
We present an algorithm for the approximation of a finite horizon optimal
control problem for advection-diffusion equations. The method is based on the
coupling between an adaptive POD representation of the solution and a Dynamic
Programming approximation scheme for the corresponding evolutive
Hamilton-Jacobi equation. We discuss several features regarding the adaptivity
of the method, the role of error estimate indicators to choose a time
subdivision of the problem and the computation of the basis functions. Some
test problems are presented to illustrate the method.Comment: 17 pages, 18 figure
Model order reduction approaches for infinite horizon optimal control problems via the HJB equation
We investigate feedback control for infinite horizon optimal control problems
for partial differential equations. The method is based on the coupling between
Hamilton-Jacobi-Bellman (HJB) equations and model reduction techniques. It is
well-known that HJB equations suffer the so called curse of dimensionality and,
therefore, a reduction of the dimension of the system is mandatory. In this
report we focus on the infinite horizon optimal control problem with quadratic
cost functionals. We compare several model reduction methods such as Proper
Orthogonal Decomposition, Balanced Truncation and a new algebraic Riccati
equation based approach. Finally, we present numerical examples and discuss
several features of the different methods analyzing advantages and
disadvantages of the reduction methods
Model Order Reduction for Rotating Electrical Machines
The simulation of electric rotating machines is both computationally
expensive and memory intensive. To overcome these costs, model order reduction
techniques can be applied. The focus of this contribution is especially on
machines that contain non-symmetric components. These are usually introduced
during the mass production process and are modeled by small perturbations in
the geometry (e.g., eccentricity) or the material parameters. While model order
reduction for symmetric machines is clear and does not need special treatment,
the non-symmetric setting adds additional challenges. An adaptive strategy
based on proper orthogonal decomposition is developed to overcome these
difficulties. Equipped with an a posteriori error estimator the obtained
solution is certified. Numerical examples are presented to demonstrate the
effectiveness of the proposed method
A Reduced Order Approach for the Embedded Shifted Boundary FEM and a Heat Exchange System on Parametrized Geometries
A model order reduction technique is combined with an embedded boundary finite element method with a POD-Galerkin strategy. The proposed methodology is applied to parametrized heat transfer problems and we rely on a sufficiently refined shape-regular background mesh to account for parametrized geometries. In particular, the employed embedded boundary element method is the Shifted Boundary Method (SBM), recently proposed in Main and Scovazzi, J Comput Phys [17]. This approach is based on the idea of shifting the location of true boundary conditions to a surrogate boundary, with the goal of avoiding cut cells near the boundary of the computational domain. This combination of methodologies has multiple advantages. In the first place, since the Shifted Boundary Method always relies on the same background mesh, there is no need to update the discretized parametric domain. Secondly, we avoid the treatment of cut cell elements, which usually need particular attention. Thirdly, since the whole background mesh is considered in the reduced basis construction, the SBM allows for a smooth transition of the reduced modes across the immersed domain boundary. The performances of the method are verified in two dimensional heat transfer numerical examples
Greedy optimal control for elliptic problems and its application to turnpike problems
This is a post-peer-review, pre-copyedit version of an article published in Numerische Mathematik. The final authenticated version is available online at: https://doi.org/10.1007/s00211-018-1005-zWe adapt and apply greedy methods to approximate in an efficient way the optimal controls for parameterized elliptic control problems. Our results yield an optimal approximation procedure that, in particular, performs better than simply sampling the parameter-space to compute controls for each parameter value. The same method can be adapted for parabolic control problems, but this leads to greedy selections of the realizations of the parameters that depend on the initial datum under consideration. The turnpike property (which ensures that parabolic optimal control problems behave nearly in a static manner when the control horizon is long enough) allows using the elliptic greedy choice of the parameters in the parabolic setting too. We present various numerical experiments and an extensive discussion of the efficiency of our methodology for parabolic control and indicate a number of open problems arising when analyzing the convergence of the proposed algorithmsThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 694126-DyCon). Part of this research was done while the second author visited DeustoTech and Univesity of Deusto with the support of the DyCon project. The second author was also partially supported by Croatian Science Foundation under ConDyS Project, IP-2016-06-2468. The work of the third author was partially supported by the Grants MTM2014-52347, MTM2017-92996 of MINECO (Spain) and ICON of the French AN
Comparison of some Reduced Representation Approximations
In the field of numerical approximation, specialists considering highly
complex problems have recently proposed various ways to simplify their
underlying problems. In this field, depending on the problem they were tackling
and the community that are at work, different approaches have been developed
with some success and have even gained some maturity, the applications can now
be applied to information analysis or for numerical simulation of PDE's. At
this point, a crossed analysis and effort for understanding the similarities
and the differences between these approaches that found their starting points
in different backgrounds is of interest. It is the purpose of this paper to
contribute to this effort by comparing some constructive reduced
representations of complex functions. We present here in full details the
Adaptive Cross Approximation (ACA) and the Empirical Interpolation Method (EIM)
together with other approaches that enter in the same category
A Survey of Air-to-Ground Propagation Channel Modeling for Unmanned Aerial Vehicles
In recent years, there has been a dramatic increase in the use of unmanned
aerial vehicles (UAVs), particularly for small UAVs, due to their affordable
prices, ease of availability, and ease of operability. Existing and future
applications of UAVs include remote surveillance and monitoring, relief
operations, package delivery, and communication backhaul infrastructure.
Additionally, UAVs are envisioned as an important component of 5G wireless
technology and beyond. The unique application scenarios for UAVs necessitate
accurate air-to-ground (AG) propagation channel models for designing and
evaluating UAV communication links for control/non-payload as well as payload
data transmissions. These AG propagation models have not been investigated in
detail when compared to terrestrial propagation models. In this paper, a
comprehensive survey is provided on available AG channel measurement campaigns,
large and small scale fading channel models, their limitations, and future
research directions for UAV communication scenarios
The Effort of Increasing Reynolds Number in Projection-Based Reduced Order Methods: From Laminar to Turbulent Flows
We present in this double contribution two different reduced order strategies for incompressible parameterized Navier-Stokes equations characterized by varying Reynolds numbers. The first strategy deals with low Reynolds number (laminar flow) and is based on a stabilized finite element method during the offline stage followed by a Galerkin projection on reduced basis spaces generated by a greedy algorithm. The second methodology is based on a full order finite volume discretization. The latter methodology will be used for flows with moderate to high Reynolds number characterized by turbulent patterns. For the treatment of the mentioned turbulent flows at the reduced order level, a new POD-Galerkin approach is proposed. The new approach takes into consideration the contribution of the eddy viscosity also during the online stage and is based on the use of interpolation. The two methodologies are tested on classic benchmark test cases
Bilevel Parameter Learning for Higher-Order Total Variation Regularisation Models.
We consider a bilevel optimisation approach for parameter learning in higher-order total variation image reconstruction models. Apart from the least squares cost functional, naturally used in bilevel learning, we propose and analyse an alternative cost based on a Huber-regularised TV seminorm. Differentiability properties of the solution operator are verified and a first-order optimality system is derived. Based on the adjoint information, a combined quasi-Newton/semismooth Newton algorithm is proposed for the numerical solution of the bilevel problems. Numerical experiments are carried out to show the suitability of our approach and the improved performance of the new cost functional. Thanks to the bilevel optimisation framework, also a detailed comparison between TGV 2 and ICTV is carried out, showing the advantages and shortcomings of both regularisers, depending on the structure of the processed images and their noise level.King Abdullah University of Science and Technology (KAUST) (Grant ID: KUKI1-007-43), Engineering and Physical Sciences Research Council (Grant IDs: Nr. EP/J009539/1 “Sparse & Higher-order Image Restoration” and Nr. EP/M00483X/1 “Efficient computational tools for inverse imaging problems”), Escuela Politécnica Nacional de Quito (Grant ID: PIS 12-14, MATHAmSud project SOCDE “Sparse Optimal Control of Differential Equations”), Leverhulme Trust (project on “Breaking the non-convexity barrier”), SENESCYT (Ecuadorian Ministry of Higher Education, Science, Technology and Innovation) (Prometeo Fellowship)This is the final version of the article. It first appeared from Springer via http://dx.doi.org/10.1007/s10851-016-0662-
Non-intrusive polynomial chaos method applied to full-order and reduced problems in computational fluid dynamics: A comparison and perspectives
In this work, Uncertainty Quantification (UQ) based on non-intrusive Polynomial Chaos Expansion (PCE) is applied to the CFD problem of the flow past an airfoil with parameterized angle of attack and inflow velocity. To limit the computational cost associated with each of the simulations required by the non-intrusive UQ algorithm used, we resort to a Reduced Order Model (ROM) based on Proper Orthogonal Decomposition (POD)-Galerkin approach. A first set of results is presented to characterize the accuracy of the POD-Galerkin ROM developed approach with respect to the Full Order Model (FOM) solver (OpenFOAM). A further analysis is then presented to assess how the UQ results are affected by substituting the FOM predictions with the surrogate ROM ones
- …