Scholarly Works, Interdisciplinary Center for Applied Mathematics (ICAM)http://hdl.handle.net/10919/471082020-06-01T02:49:48Z2020-06-01T02:49:48ZComputing Functional Gains for Designing More Energy-Efficient Buildings Using a Model Reduction FrameworkAkhtar, ImranBorggaard, Jeffrey T.Burns, Johnhttp://hdl.handle.net/10919/864942020-01-30T14:35:15Z2018-11-23T00:00:00ZAkhtar, Imran; Borggaard, Jeffrey T.; Burns, John
2018-11-23T00:00:00ZWe discuss developing efficient reduced-order models (ROM) for designing energy-efficient buildings using computational fluid dynamics (CFD) simulations. This is often the first step in the reduce-then-control technique employed for flow control in various industrial and engineering problems. This approach computes the proper orthogonal decomposition (POD) eigenfunctions from high-fidelity simulations data and then forms a ROM by projecting the Navier-Stokes equations onto these basic functions. In this study, we develop a linear quadratic regulator (LQR) control based on the ROM of flow in a room. We demonstrate these approaches on a one-room model, serving as a basic unit in a building. Furthermore, the ROM is used to compute feedback functional gains. These gains are in fact the spatial representation of the feedback control. Insight of these functional gains can be used for effective placement of sensors in the room. This research can further lead to developing mathematical tools for efficient design, optimization, and control in building management systems.Model Reduction for DAEs with an Application to Flow ControlBorggaard, Jeffrey T.Gugercin, Serkanhttp://hdl.handle.net/10919/819222020-01-30T14:35:19Z2015-01-01T00:00:00ZBorggaard, Jeffrey T.; Gugercin, Serkan
King, R.
2015-01-01T00:00:00ZLearning-based Robust Stabilization for Reduced-Order Models of 2D and 3D Boussinesq EquationsBenosman, M.Borggaard, Jeffrey T.San, O.Kramer, B.http://hdl.handle.net/10919/776712020-01-30T14:35:16ZBenosman, M.; Borggaard, Jeffrey T.; San, O.; Kramer, B.
A new wavelet family based on second-order LTI-systemsAbuhamdia, TTaheri, SBurns, Jhttp://hdl.handle.net/10919/751882020-01-30T14:35:27Z2016-01-01T00:00:00ZAbuhamdia, T; Taheri, S; Burns, J
2016-01-01T00:00:00ZLocal improvements to reduced-order models using sensitivity analysis of the proper orthogonal decompositionHay, A.Borggaard, Jeffrey T.Pelletier, D.http://hdl.handle.net/10919/496342020-01-30T14:35:23Z2009-06-01T00:00:00ZHay, A.; Borggaard, Jeffrey T.; Pelletier, D.
2009-06-01T00:00:00ZThe proper orthogonal decomposition (POD) is the prevailing method for basis generation in the model reduction of fluids. A serious limitation of this method, however, is that it is empirical. In other words, this basis accurately represents the flow data used to generate it, but may not be accurate when applied 'off-design'. Thus, the reduced-order model may lose accuracy for flow parameters (e.g. Reynolds number, initial or boundary conditions and forcing parameters) different from those used to generate the POD basis and generally does. This paper investigates the use of sensitivity analysis in the basis selection step to partially address this limitation. We examine two strategies that use the sensitivity of the POD modes with respect to the problem parameters. Numerical experiments performed on the flow past a square cylinder over a range of Reynolds numbers demonstrate the effectiveness of these strategies. The newly derived bases allow for a more accurate representation of the flows when exploring the parameter space. Expanding the POD basis built at one state with its sensitivity leads to low-dimensional dynamical systems having attractors that approximate fairly well the attractor of the full-order Navier-Stokes equations for large parameter changes.Shape Sensitivity Analysis in Flow Models Using a Finite-Difference ApproachAkhtar, ImranBorggaard, Jeffrey T.Hay, Alexanderhttp://hdl.handle.net/10919/489162020-01-30T14:35:17Z2010-01-01T00:00:00ZAkhtar, Imran; Borggaard, Jeffrey T.; Hay, Alexander
2010-01-01T00:00:00ZReduced-order models have a number of practical engineering applications for unsteady flows that require either low-dimensional approximations for analysis and control or repeated simulation over a range of parameter values. The standard method for building reduced-order models uses the proper orthogonal decomposition (POD) and Galerkin projection. However, this standard method may be inaccurate when used "off-design" (at parameter values not used to generate the POD). This phenomena is exaggerated when parameter values describe the shape of the flow domain since slight changes in shape can have a significant influence on the flow field. In this paper, we investigate the use of POD sensitivity vectors to improve the accuracy and dynamical system properties of the reduced-order models to problems with shape parameters. To carry out this study, we consider flows past an elliptic cylinder with varying thickness ratios. Shape sensitivities (derivatives of flow variables with respect to thickness ratio) computed by finite difference approximations are used to compute the POD sensitivity vectors. Numerical studies test the accuracy of the new bases to represent flow solutions over a range of parameter values.Issues related to least-squares finite element methods for the stokes equationsDeang, J. M.Gunzburger, M. D.http://hdl.handle.net/10919/481582020-01-30T14:35:24Z1998-10-01T00:00:00ZDeang, J. M.; Gunzburger, M. D.
1998-10-01T00:00:00ZLeast-squares finite element methods have become increasingly popular for the approximate solution of first-order systems of partial differential equations. Here, after a brief review of some existing theories, a number of issues connected with the use of such methods for the velocity-vorticity-pressure formulation of the Stokes equations in two dimensions in realistic settings are studied through a series of computational experiments. Finite element spaces that are not covered by existing theories are considered; included in these are piecewise linear approximations for the velocity. Mixed boundary conditions, which are also not covered by existing theories, are also considered, as is enhancing mass conservation. Next, problems in nonconvex polygonal regions and the resulting nonsmooth solutions are considered with a view toward seeing how accuracy can be improved. A conclusion that can be drawn from this series of computational experiments is that the use of appropriate mesh-dependent weights in the least-squares functional almost always improves the accuracy of the approximations. Concluding remarks concerning three-dimensional problems, the nonlinear Navier-Stokes equations, and the conditioning of the discrete systems are provided.On efficient solutions to the continuous sensitivity equation using automatic differentiationBorggaard, Jeffrey T.Verma, A.http://hdl.handle.net/10919/481562020-01-30T14:35:28Z2000-06-01T00:00:00ZBorggaard, Jeffrey T.; Verma, A.
2000-06-01T00:00:00ZShape sensitivity analysis is a tool that provides quantitative information about the influence of shape parameter changes on the solution of a partial differential equation (PDE). These shape sensitivities are described by a continuous sensitivity equation (CSE). Automatic differentiation (AD) can be used to perform this sensitivity analysis without writing any additional code to solve the sensitivity equation. The approximate solution of the PDE uses a spatial discretization (mesh) that often depends on the shape parameters. Therefore, the straightforward application of AD introduces derivatives of the mesh. There are two drawbacks to this approach. First, extra computational effort (especially memory) is used in these calculations due to mesh sensitivities. Second, this mesh sensitivity information needs to be computed in order to obtain accurate results. In this work, we provide a methodology that avoids mesh sensitivities (and their drawbacks) by defining a modified PDE on a fixed domain (i.e., independent of the shape parameter) such that AD provides the desired approximation of the CSE. Using two examples, we demonstrate significant improvement in the computational effort, both in terms of floating point operations and memory requirements. We explain how these code modifications can be applied to a wide variety of practical problems with minimal changes to the original code. These changes are negligible when compared to the complexity of writing a separate solver for the sensitivity equation.Inexact Kleinman-Newton method for Riccati equationsFeitzinger, F.Hylla, T.Sachs, E. W.http://hdl.handle.net/10919/481442020-01-30T14:35:22Z2009-03-01T00:00:00ZFeitzinger, F.; Hylla, T.; Sachs, E. W.
2009-03-01T00:00:00ZIn this paper we consider the numerical solution of the algebraic Riccati equation using Newton's method. We propose an inexact variant which allows one control the number of the inner iterates used in an iterative solver for each Newton step. Conditions are given under which the monotonicity and global convergence result of Kleinman also hold for the inexact Newton iterates. Numerical results illustrate the efficiency of this method.Mesh independence of Kleinman-Newton iterations for Riccati equations in Hilbert spaceBurns, J. A.Sachs, E. W.Zietsman, L.http://hdl.handle.net/10919/481372020-01-30T14:35:25Z2008-01-01T00:00:00ZBurns, J. A.; Sachs, E. W.; Zietsman, L.
2008-01-01T00:00:00ZIn this paper we consider the convergence of the infinite dimensional version of the Kleinman-Newton algorithm for solving the algebraic Riccati operator equation associated with the linear quadratic regulator problem in a Hilbert space. We establish mesh independence for this algorithm and apply the result to systems governed by delay equations. Numerical examples are presented to illustrate the results.