196,161 research outputs found
Variational inequality formulation of an inverse elasticity problem
We present some systematic approaches to the mathematical formulation and numerical resolution of an optimal control problem in linear elasticity. The objective of the optimization is to match a desired displacement by controlling the Young's modulus so as to minimize a quadratic functional. Theoretical results are presented in the general framework of linear elastic theory which lead to a variational inequality. Also, we define and analyze a finite element approximation of the optimality system and a gradient method for the solution of the discrete variational inequality. Finally, numerical experiments for the simulation of a simplified model for the `sag bending process' in the manufacturing of automobile windscreens are discussed
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
A Distributed Control Approach for the Boundary Optimal Control of the Steady MHD Equations
Abstract. A new approach is presented for the boundary optimal control of the MHD equations in which the boundary control problem is transformed into an extended distributed control problem. This can be achieved by considering boundary controls in the form of lifting functions which extend from the boundary into the interior. The optimal solution is then sought by exploring all possible extended functions. This approach gives robustness to the boundary control algorithm which can be solved by standard distributed control techniques over the interior of the domain
A localized reduced-order modeling approach for PDEs with bifurcating solutions
Reduced-order modeling (ROM) commonly refers to the construction, based on a few solutions (referred to as snapshots) of an expensive discretized partial differential equation (PDE), and the subsequent application of low-dimensional discretizations of partial differential equations (PDEs) that can be used to more efficiently treat problems in control and optimization, uncertainty quantification, and other settings that require multiple approximate PDE solutions. Although ROMs have been successfully used in many settings, ROMs built specifically for the efficient treatment of PDEs having solutions that bifurcate as the values of input parameters change have not received much attention. In such cases, the parameter domain can be subdivided into subregions, each of which corresponds to a different branch of solutions. Popular ROM approaches such as proper orthogonal decomposition (POD), results in a global low-dimensional basis that does not respect the often large differences in the PDE solutions corresponding to different subregions. In this work, we develop and test a new ROM approach specifically aimed at bifurcation problems. In the new method, the k-means algorithm is used to cluster snapshots so that within cluster snapshots are similar to each other and are dissimilar to those in other clusters. This is followed by the construction of local POD bases, one for each cluster. The method also can detect which cluster a new parameter point belongs to, after which the local basis corresponding to that cluster is used to determine a ROM approximation. Numerical experiments show the effectiveness of the method both for problems for which bifurcation cause continuous and discontinuous changes in the solution of the PDE
Analysis and approximation of the velocity tracking problem for Navier-Stokes flows with distributed control
We consider the mathematical formulation, analysis, and the numerical solution of a time-dependent optimal control problem associated with the tracking of the velocity of a Navier-Stokes flow in a bounded two-dimensional domain through the adjustment of a distributed control. The existence of optimal solutions is proved and the first-order necessary conditions for optimality are used to derive an optimality system of partial differential equations whose solutions provide optimal states and controls. Semidiscrete-in-time and fully discrete space-time approximations are defined and their convergence to the exact optimal solutions is shown. A gradient method for the solution of the fully discrete equations is examined, as are its convergence properties. Finally, the results of some illustrative computational experiments are presented
Velocity tracking problem for Navier-Stokes flows with bounded distributed controls
We present some systematic approaches to the mathematical analysis and numerical approximation of the time dependent optimal control problem of tracking the velocity for Navier-Stokes flows in bounded two-dimensional domains with bounded distributed controls. We study the existence of optimal solutions and derive an optimality system from which optimal solutions may be determined. We also define and analyze semidiscrete-in-time and fully space-time discrete approximations of the optimality system and a gradient method for the solution of the fully discrete system. The results of some computational experiments are provided
The velocity tracking problem for Navier-Stokes flows with boundary control
We present some systematic approaches to the mathematical formulation and numerical approximation of the time-dependent optimal control problem of tracking the velocity for Navier-Stokes flows in a bounded, two-dimensional domain with boundary control. We study the existence of optimal solutions and derive an optimality system from which optimal solutions may be determined. We also define and analyze semidiscrete-in-time and full space-time discrete approximations of the optimality system and a gradient method for the solution of the fully discrete system. The results of some computational experiments are provided
Analysis and approximation for linear feedback control for tracking the velocity in Navier-Stokes flows
Some systematic approaches to the mathematical formulation and numerical resolution of the linear feedback control problem for tracking the velocity in Navier-Stokes flows in a bounded two-dimensional domain with bounded distributed control are presented. Semidiscrete-in-time and full space-time discrete approximations are also studied. Some computational results are presented and compared with analogous results from optimal control theory
On a shape control problem for the stationary Navier-Stokes equations
An optimal shape control problem for the stationary Navier-Stokes system is considered. An incompressible, viscous flow in a two-dimensional channel is studied to determine the shape of part of the boundary that minimizes the viscous drag. The adjoint method and the Lagrangian multiplier method are used to derive the optimality system for the shape gradient of the design functional
A Deep Learning Approach for Detection and Localization of Leaf Anomalies
The detection and localization of possible diseases in crops are usually automated by resorting to supervised deep learning approaches. In this work, we tackle these goals with unsupervised models, by applying three different types of autoencoders to a specific open-source dataset of healthy and unhealthy pepper and cherry leaf images. CAE, CVAE and VQ-VAE autoencoders are deployed to screen unlabeled images of such a dataset, and compared in terms of image reconstruction, anomaly removal, detection and localization. The vector-quantized variational architecture turns out to be the best performing one with respect to all these targets
- …
