Model Reduction of Wind Turbine Generator Models for Control Performance Evaluation.
Abstract not provided.
SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Abstract not provided.
Abstract not provided.
Transient simulations of linear viscoelastically damped structures necessitate critical computational resources to directly integrate the full-order finite element model with time-stepping algorithms. Traditional modal reduction techniques are not directly applicable to these systems since viscoelastic materials depend on time and frequency. A more appropriate reduction basis is obtained from the nonlinear, complex eigenvalue problem, whose eigenvectors capture the appropriate kinematics and enable frequency-based mode selection; unfortunately, the computational cost is prohibitive for computing these modes from large-scale engineering models. To address this shortcoming, this work proposes a novel two-tier reduction procedure to reduce the upfront cost of solving the complex, nonlinear eigenvalue problem. The first reduction step reduces the full-order model with real mode shapes linearized about various centering frequencies to capture the kinematics over a full range of viscoelastic material behavior (glassy, rubbery, and glass-transition zones). This tier-one reduction preserves time-temperature superposition and allows the equations to depend parametrically on operating temperature. The second-level reduction then solves the complex, nonlinear eigenmode solutions in the tier-one reduced space about a fixed temperature to further reduce the equations-of-motion. The method is demonstrated on a cantilevered sandwich plate to display its accuracy and efficiency in comparison to full-order model predictions.
Skeletal model reduction based on local sensitivity analysis of time dependent systems is presented in which sensitivities are modeled by forced optimally time dependent (f-OTD) modes. The f-OTD factorizes the sensitivity coefficient matrix into a compressed format as the product of two skinny matrices, i.e. f-OTD modes and f-OTD coefficients. The modes create a low-dimensional, time dependent, orthonormal basis which capture the directions of the phase space associated with most dominant sensitivities. These directions highlight the instantaneous active species, and reaction paths. Evolution equations for the f-OTD modes and coefficients are derived, and the implementation of f-OTD for skeletal reduction is described. For demonstration, skeletal reduction is conducted of the constant pressure ethylene-air burning in a zero-dimensional reactor, and new reduced models are generated. The laminar flame speed, the ignition delay, and the extinction curve as predicted by the models are compared against some existing skeletal models in literature for the same detailed model. Finally, the results demonstrate the capability of f-OTD to eliminate unimportant reactions and species in a systematic, efficient and accurate manner.
Least-squares Petrov–Galerkin (LSPG) model-reduction techniques such as the Gauss–Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible flow problems where standard Galerkin techniques have failed. Furthermore, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform optimal projection associated with residual minimization at the time-continuous level, while LSPG techniques do so at the time-discrete level. This work provides a detailed theoretical and computational comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge–Kutta schemes. We present a number of new findings, including conditions under which the LSPG ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and computationally that decreasing the time step does not necessarily decrease the error for the LSPG ROM; instead, the time step should be ‘matched’ to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible-flow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the LSPG reduced-order model by an order of magnitude.
We developed a domain decomposition model reduction method for linear steady- state convection-diffusion equations with random coefficients. Of particular interest to this effort are the diffusion equation with random diffusivity and the convection-dominated transport equation with random velocity. We investigated two types of random fields, i.e., colored noises and discrete white noises, both of which can lead to high-dimensional parametric dependence in practice. The motivation is to exploit domain decomposition to reduce the parametric dimension of local problems in subdomains, such that an entire parametric map can be approximated with a small number of expensive partial differential equation (PDE) simulations. The new method combines domain decomposition with model reduction and sparse polynomial approximation, so as to simultaneously handle the high dimensionality and irregular behavior of the PDEs under consideration. Here, the advantages of our method lie in three aspects: (i) online-offline decomposition, i.e., the online cost is independent of the size of the triangle mesh; (ii) sparse approximation of operators involving nonaffine high-dimensional random fields; (iii) an effective strategy to capture irregular behaviors, e.g., sharp transitions of the PDE solutions. Two numerical examples are provided to demonstrate the advantageous performance of our method.
Abstract We propose a new approach to generate a reliable reduced model for a parametric elliptic problem, in the presence of noisy data. The reference model reduction procedure is the directional HiPOD method, which combines Hierarchical Model reduction with a standard Proper Orthogonal Decomposition, according to an offline/online paradigm. In this paper we show that directional HiPOD looses in terms of accuracy when problem data are affected by noise. This is due to the interpolation driving the online phase, since it replicates, by definition, the noise trend. To overcome this limit, we replace interpolation with Machine Learning fitting models which better discriminate relevant physical features in the data from irrelevant unstructured noise. The numerical assessment, although preliminary, confirms the potentialities of the new approach.
The increasing complexity of power system has made it difficult to simulate large-scale power system in detail. Therefore, to improve computational efficiency, model reduction techniques has been applied to reduce the external area and focus on the dynamics of the internal area. This paper proposes a measurement-based model reduction method which reduces the external system by replacing external system with ARX equivalents. The modeled transfer function parameters are obtained using system identification approach. Case studies on the NPCC system and EI system are carried out. Results show that the proposed reduction method can effectively retain the dynamic behavior of the study area while mitigating computation burden.
Many physical processes in science and engineering are naturally represented by operators between infinite-dimensional function spaces. The problem of operator learning, in this context, seeks to extract these physical processes from empirical data, which is challenging due to the infinite or high dimensionality of data. An integral component in addressing this challenge is model reduction, which reduces both the data dimensionality and problem size. In this paper, we utilize low-dimensional nonlinear structures in model reduction by investigating Auto-Encoder-based Neural Network (AENet). AENet first learns the latent variables of the input data and then learns the transformation from these latent variables to corresponding output data. Our numerical experiments validate the ability of AENet to accurately learn the solution operator of nonlinear partial differential equations. Furthermore, we establish a mathematical and statistical estimation theory that analyzes the generalization error of AENet. Finally, our theoretical framework shows that the sample complexity of training AENet is intricately tied to the intrinsic dimension of the modeled process, while also demonstrating the robustness of AENet to noise.
Abstract not provided.
Abstract not provided.
In this paper we present a non-intrusive data-driven approach for model reduction of nonlinear systems. The approach considers the particular case of nonlinear partial differential equations (PDEs) that form systems of partial differential–algebraic equations (PDAEs) when lifted to polynomial form. Such systems arise, for example, when the governing equations include Arrhenius reaction terms (e.g., in reacting flow models) and thermodynamic terms (e.g., the Helmholtz free energy terms in a phase-field solidification model). Using the known structured form of the lifted algebraic equations, the approach computes the reduced operators for the algebraic equations explicitly, using straightforward linear algebra operations on the basis matrices. The reduced operators for the differential equations are inferred from lifted snapshot data using operator inference, which solves a linear least squares regression problem. The approach is illustrated for the nonlinear model of solidification of a pure material. The lifting transformations reformulate the solidification PDEs as a system of PDAEs that have cubic structure. The operators of the lifted system for this solidification example have affine dependence on key process parameters, permitting us to learn a parametric reduced model with operator inference. Numerical experiments show the effectiveness of the resulting reduced models in capturing key aspects of the solidification dynamics.
The metriplectic formalism is useful for describing complete dynamical systems which conserve energy and produce entropy. This creates challenges for model reduction, as the elimination of high-frequency information will generally not preserve the metriplectic structure which governs long-term stability of the system. Based on proper orthogonal decomposition, a provably convergent metriplectic reduced-order model is formulated which is guaranteed to maintain the algebraic structure necessary for energy conservation and entropy formation. Further, numerical results on benchmark problems show that the proposed method is remarkably stable, leading to improved accuracy over long time scales at a moderate increase in cost over naive methods.
The field of model order reduction (MOR) is growing in importance due to its ability to extract the key insights from complex simulations while discarding computationally burdensome and superfluous information. We provide an overview of MOR methods for the creation of fast & accurate emulators of memory- and compute-intensive nuclear systems, focusing on eigen-emulators and variational emulators. As an example, we describe how 'eigenvector continuation' is a special case of a much more general and well-studied MOR formalism for parameterized systems. We continue with an introduction to the Ritz and Galerkin projection methods that underpin many such emulators, while pointing to the relevant MOR theory and its successful applications along the way. Here, we believe that this guide will open the door to broader applications in nuclear physics and facilitate communication with practitioners in other fields.
This paper proposes a novel approach for learning a data-driven quadratic manifold from high-dimensional data, then employing this quadratic manifold to derive efficient physics-based reduced-order models. The key ingredient of the approach is a polynomial mapping between high-dimensional states and a low-dimensional embedding. This mapping consists of two parts: a representation in a linear subspace (computed in this work using the proper orthogonal decomposition) and a quadratic component. The approach can be viewed as a form of data-driven closure modeling, since the quadratic component introduces directions into the approximation that lie in the orthogonal complement of the linear subspace, but without introducing any additional degrees of freedom to the low-dimensional representation. Combining the quadratic manifold approximation with the operator inference method for projection-based model reduction leads to a scalable non-intrusive approach for learning reduced-order models of dynamical systems. Further, applying the new approach to transport-dominated systems of partial differential equations illustrates the gains in efficiency that can be achieved over approximation in a linear subspace.
This work combines the Hierarchical Model (HiMod) reduction technique with a standard Proper Orthogonal Decomposition (POD) to solve parametrized partial differential equations for the modeling of advection-diffusion-reaction phenomena in elongated domains (e.g., pipes). This combination leads to what we define as HiPOD model reduction, which merges the reliability of HiMod reduction with the computational efficiency of POD. Two HiPOD techniques are presented and assessed by an extensive numerical verification.
A new framework of simulation of reactive flows is proposed based on a coupling between accurate reduced reaction mechanism and the lattice Boltzmann representation of the flow phenomena. The model reduction is developed in the setting of slow invariant manifold construction, and the simplest lattice Boltzmann equation is used in order to work out the procedure of coupling of the reduced model with the flow solver. Practical details of constructing slow invariant manifolds of a reaction system under various thermodynamic conditions are reported. The proposed method is validated with the two-dimensional simulation of a premixed counterflow flame in the hydrogen-air mixture. (author)
In this paper, we consider the balanced truncation method for model reductions in large-scale linear and time-independent dynamical systems with multi-inputs and multi-outputs. The method is based on the solutions of two large coupled Lyapunov matrix equations when the system is stable or on the computation of stabilizing positive and semi-definite solutions of some continuous-time algebraic Riccati equations when the dynamical system is not stable. Using the rational block Arnoldi, we show how to compute approximate solutions to these large Lyapunov or algebraic Riccati equations. The obtained approximate solutions are given in a factored form and used to build the reduced order model. We give some theoretical results and present numerical examples with some benchmark models.