• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Efficient 𝐻₂-Based Parametric Model Reduction via Greedy Search

Cooper, Jon Carl 19 January 2021 (has links)
Dynamical systems are mathematical models of physical phenomena widely used throughout the world today. When a dynamical system is too large to effectively use, we turn to model reduction to obtain a smaller dynamical system that preserves the behavior of the original. In many cases these models depend on one or more parameters other than time, which leads to the field of parametric model reduction. Constructing a parametric reduced-order model (ROM) is not an easy task, and for very large parametric systems it can be difficult to know how well a ROM models the original system, since this usually involves many computations with the full-order system, which is precisely what we want to avoid. Building off of efficient 𝐻-infinity approximations, we develop a greedy algorithm for efficiently modeling large-scale parametric dynamical systems in an 𝐻₂-sense. We demonstrate the effectiveness of this greedy search on a fluid problem, a mechanics problem, and a thermal problem. We also investigate Bayesian optimization for solving the optimization subproblem, and end with extending this algorithm to work with MIMO systems. / Master of Science / In the past century, mathematical modeling and simulation has become the third pillar of scientific discovery and understanding, alongside theory and experimentation. Mathematical models are used every day, and are essential to modern engineering problems. Some of these mathematical models depend on quantities other than just time, parameters such as the viscosity of a fluid or the strength of a spring. These models can sometimes become so large and complicated that it can take a very long time to run simulations with the models. In such a case, we use parametric model reduction to come up with a much smaller and faster model that behaves like the original model. But when these large models vary highly with the parameters, it can also become very expensive to reduce these models accurately. Algorithms already exist for quickly computing reduced-order models (ROMs) with respect to one measure of how "good" the ROM is. In this thesis we develop an algorithm for quickly computing the ROM with respect to a different measure - one that is more closely tied to how the models are simulated.
2

Model Reduction of Power Networks

Safaee, Bita 08 June 2022 (has links)
A power grid network is an interconnected network of coupled devices that generate, transmit and distribute power to consumers. These complex and usually large-scale systems have high dimensional models that are computationally expensive to simulate especially in real time applications, stability analysis, and control design. Model order reduction (MOR) tackles this issue by approximating these high dimensional models with reduced high-fidelity representations. When the internal description of the models is not available, the reduced representations are constructed by data. In this dissertation, we investigate four problems regarding the MOR and data-driven modeling of the power networks model, particularly the swing equations. We first develop a parametric MOR approach for linearized parametric swing equations that preserves the physically-meaningful second-order structure of the swing equations dynamics. Parameters in the model correspond to variations in operating conditions. We employ a global basis approach to develop the parametric reduced model. We obtain these local bases by $mathcal{H}_2$-based interpolatory model reduction and then concatenate them to form a global basis. We develop a framework to enrich this global basis based on a residue analysis to ensure bounded $mathcal{H}_2$ and $mathcal{H}_infty$ errors over the entire parameter domain. Then, we focus on nonlinear power grid networks and develop a structure-preserving system-theoretic model reduction framework. First, to perform an intermediate model reduction step, we convert the original nonlinear system to an equivalent quadratic nonlinear model via a lifting transformation. Then, we employ the $mathcal{H}_2$-based model reduction approach, Quadratic Iterative Rational Krylov Algorithm (Q-IRKA). Using a special subspace structure of the model reduction bases resulting from Q-IRKA and the structure of the underlying power network model, we form our final reduction basis that yields a reduced model of the same second-order structure as the original model. Next, we focus on a data-driven modeling framework for power network dynamics by applying the Lift and Learn approach. Once again, with the help of the lifting transformation, we lift the snapshot data resulting from the simulation of the original nonlinear swing equations such that the resulting lifted-data corresponds to a quadratic nonlinearity. We then, project the lifted data onto a lower dimensional basis via a singular value decomposition. By employing a least-squares measure, we fit the reduced quadratic matrices to this reduced lifted data. Moreover, we investigate various regularization approaches. Finally, inspired by the second-order sparse identification of nonlinear dynamics (SINDY) method, we propose a structure-preserving data-driven system identification method for the nonlinear swing equations. Using the special structure on the right-hand-side of power systems dynamics, we choose functions in the SINDY library of terms, and enforce sparsity in the SINDY output of coefficients. Throughout the dissertation, we use various power network models to illustrate the effectiveness of our approaches. / Doctor of Philosophy / Power grid networks are interconnected networks of devices responsible for delivering electricity to consumers, e.g., houses and industries for their daily needs. There exist mathematical models representing power networks dynamics that are generally nonlinear but can also be simplified by linear dynamics. Usually, these models are complex and large-scale and therefore take a long time to simulate. Hence, obtaining models of much smaller dimension that can capture the behavior of the original systems with an acceptable accuracy is a necessity. In this dissertation, we focus on approximation of power networks model through the swing equations. First, we study the linear parametric power network model whose operating conditions depend on parameters. We develop an algorithm to replace the original model with a model of smaller dimension and the ability to perform in different operating conditions. Second, given an explicit representation of the nonlinear power network model, we approximate the original model with a model of the same structure but smaller dimension. In the cases where the mathematical models are not available but only time-domain data resulting from simulation of the model is at hand, we apply an already developed framework to infer a model of a small dimension and a specific nonlinear structure: quadratic dynamics. In addition, we develop a framework to identify the nonlinear dynamics while maintaining their original physically-meaningful structure.

Page generated in 0.1237 seconds