Abstract. Numerical simulation of large-scale dynamical systems plays a fundamental role in studying a wide range of complex physical phenomena; however, the inherent large-scale nature of the models often leads to unmanageable demands on computational resources. Model reduction aims to reduce this computational burden by generating reduced models that are faster and cheaper to simulate, yet accurately represent the original large-scale system behavior. Model reduction of linear, nonparametric dynamical systems has reached a considerable level of maturity, as reflected by several survey papers and books. However, parametric model reduction has emerged only more recently as an important and vibrant research area, with several recent advances making a survey paper timely. Thus, this paper aims to provide a resource that draws together recent contributions in different communities to survey the state of the art in parametric model reduction methods. Parametric model reduction targets the broad class of problems for which the equations governing the system behavior depend on a set of parameters. Examples include parameterized partial differential equations and large-scale systems of parameterized ordinary differential equations. The goal of parametric model reduction is to generate low-cost but accurate models that characterize system response for different values of the parameters. This paper surveys state-of-the-art methods in projection-based parametric model reduction, describing the different approaches within each class of methods for handling parametric variation and providing a comparative discussion that lends insights to potential advantages and disadvantages in applying each of the methods. We highlight the important role played by parametric model reduction in design, control, optimization, and uncertainty quantification-settings that require repeated model evaluations over different parameter values.
The optimal H 2 model reduction problem is of great importance in the area of dynamical systems and simulation. In the literature, two independent frameworks have evolved focusing either on solution of Lyapunov equations on the one hand or interpolation of transfer functions on the other, without any apparent connection between the two approaches. In this paper, we develop a new unifying framework for the optimal H 2 approximation problem using best approximation properties in the underlying Hilbert space. This new framework leads to a new set of local optimality conditions taking the form of a structured orthogonality condition. We show that the existing Lyapunovand interpolation-based conditions are each equivalent to our conditions and so are equivalent to each other. Also, we provide a new elementary proof of the interpolation-based condition that clarifies the importance of the mirror images of the reduced system poles. Based on the interpolation framework, we describe an iteratively corrected rational Krylov algorithm for H 2 model reduction. The formulation is based on finding a reduced order model that satisfies interpolation-based firstorder necessary conditions for H 2 optimality and results in a method that is numerically effective and suited for large-scale problems. We illustrate the performance of the method with a variety of numerical experiments and comparisons with existing methods.
Balanced truncation is one of the most common model reduction schemes. In this note, we present a survey of balancing related model reduction methods and their corresponding error norms, and also introduce some new results. Five balancing methods are studied: (1) Lyapunov balancing, (2) stochastic balancing, (3) bounded real balancing, (4) positive real balancing and (5) frequency weighted balancing. For positive real balancing, we introduce a multiplicative-type error bound. Moreover, for a certain subclass of positive real systems, a modified positive-real balancing scheme with an absolute error bound is proposed. We also develop a new frequency-weighted balanced reduction method with a simple bound on the error system based on the frequency domain representations of the system gramians. Two numerical examples are illustrated to verify the efficiency of the proposed methods.
An overview of model reduction methods and a comparison of the resulting algorithms is presented. These approaches are divided into two broad categories, namely SVD based and moment matching based methods. It turns out that the approximation error in the former case behaves better globally in frequency while in the latter case the local behavior is better.
This paper introduces a new framework for constructing the Discrete Empirical Interpolation Method (DEIM) projection operator. The interpolation node selection procedure is formulated using the QR factorization with column pivoting, and it enjoys a sharper error bound for the DEIM projection error. Furthermore, for a subspace U given as the range of an orthonormal U, the DEIM projection does not change if U is replaced by UΩ with arbitrary unitary matrix Ω. In a large-scale setting, the new approach allows modifications that use only randomly sampled rows of U, but with the potential of producing good approximations with corresponding probabilistic error bounds. Another salient feature of the new framework is that robust and efficient software implementation is easily developed, based on readily available high performance linear algebra packages.
Abstract. We provide a unifying projection-based framework for structure-preserving interpolatory model reduction of parameterized linear dynamical systems, i.e., systems having a structured dependence on parameters that we wish to retain in the reduced-order model. The parameter dependence may be linear or nonlinear and is retained in the reduced-order model. Moreover, we are able to give conditions under which the gradient and Hessian of the system response with respect to the system parameters is matched in the reduced-order model. We provide a systematic approach built on established interpolatory H 2 optimal model reduction methods that will produce parameterized reduced-order models having high fidelity throughout a parameter range of interest. For single input/single output systems with parameters in the input/output maps, we provide reduced-order models that are optimal with respect to an H 2 ⊗ L 2 joint error measure. The capabilities of these approaches are illustrated by several numerical examples from technical applications. 1. Introduction. Numerical simulation has steadily increased in importance across virtually all scientific and engineering disciplines. In many application areas, experiments have been largely replaced by numerical simulation in order to save costs in design and development. High accuracy simulation requires high fidelity mathematical models which in turn induce dynamical systems of very large dimension. The ensuing demands on computational resources can be overwhelming and efficient model utilization becomes a necessity. It often is both possible and prudent to produce a lower dimension model that approximates the response of the original one to high accuracy. There are many model reduction strategies in use that are remarkably effective in the creation of compact, efficient, and high fidelity dynamical system models. Such a reduced model can then be used reliably as an efficient surrogate to the original system, replacing it as a component in larger simulations, for example, or in allied contexts that involve design optimization or the development of low-order, fast controllers suitable for real time applications.Typically, a reduced-order model will represent a specific instance of the physical system under study and as a consequence will have high fidelity only for small variations around that base system instance. Significant modifications to the physical model such as geometric variations, changes in material properties, or alterations in
Abstract. In this paper, we investigate interpolatory projection framework for model reduction of descriptor systems. With a simple numerical example, we first illustrate that employing subspace conditions from the standard state space settings to descriptor systems generically leads to unbounded H 2 or H∞ errors due to the mismatch of the polynomial parts of the full and reducedorder transfer functions. We then develop modified interpolatory subspace conditions based on the deflating subspaces that guarantee a bounded error. For the special cases of index-1 and index-2 descriptor systems, we also show how to avoid computing these deflating subspaces explicitly while still enforcing interpolation. The question of how to choose interpolation points optimally naturally arises as in the standard state space setting. We answer this question in the framework of the H 2 -norm by extending the Iterative Rational Krylov Algorithm (IRKA) to descriptor systems. Several numerical examples are used to illustrate the theoretical discussion.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.