365 research outputs found
An Iterative Model Reduction Scheme for Quadratic-Bilinear Descriptor Systems with an Application to Navier-Stokes Equations
We discuss model reduction for a particular class of quadratic-bilinear (QB)
descriptor systems. The main goal of this article is to extend the recently
studied interpolation-based optimal model reduction framework for QBODEs
[Benner et al. '16] to a class of descriptor systems in an efficient and
reliable way. Recently, it has been shown in the case of linear or bilinear
systems that a direct extension of interpolation-based model reduction
techniques to descriptor systems, without any modifications, may lead to poor
reduced-order systems. Therefore, for the analysis, we aim at transforming the
considered QB descriptor system into an equivalent QBODE system by means of
projectors for which standard model reduction techniques for QBODEs can be
employed, including aforementioned interpolation scheme. Subsequently, we
discuss related computational issues, thus resulting in a modified algorithm
that allows us to construct \emph{near}--optimal reduced-order systems without
explicitly computing the projectors used in the analysis. The efficiency of the
proposed algorithm is illustrated by means of a numerical example, obtained via
semi-discretization of the Navier-Stokes equations
Control refinement for discrete-time descriptor systems: a behavioural approach via simulation relations
The analysis of industrial processes, modelled as descriptor systems, is
often computationally hard due to the presence of both algebraic couplings and
difference equations of high order. In this paper, we introduce a control
refinement notion for these descriptor systems that enables analysis and
control design over related reduced-order systems. Utilising the behavioural
framework, we extend upon the standard hierarchical control refinement for
ordinary systems and allow for algebraic couplings inherent to descriptor
systems.Comment: 8 pages, 3 figure
Bounded real lemmas for positive descriptor systems
A well known result in the theory of linear positive systems is the existence of positive definite diagonal matrix (PDDM) solutions to some well known linear matrix inequalities (LMIs). In this paper, based on the positivity characterization, a novel bounded real lemma for continuous positive descriptor systems in terms of strict LMI is first established by the separating hyperplane theorem. The result developed here provides a necessary and sufficient condition for systems to possess H?H? norm less than ? and shows the existence of PDDM solution. Moreover, under certain condition, a simple model reduction method is introduced, which can preserve positivity, stability and H?H? norm of the original systems. An advantage of such method is that systems? matrices of the reduced order systems do not involve solving of LMIs conditions. Then, the obtained results are extended to discrete case. Finally, a numerical example is given to illustrate the effectiveness of the obtained results
Towards Time-Limited -Optimal Model Order Reduction
In order to solve partial differential equations numerically and accurately,
a high order spatial discretization is usually needed. Model order reduction
(MOR) techniques are often used to reduce the order of spatially-discretized
systems and hence reduce computational complexity. A particular class of MOR
techniques are -optimal methods such as the iterative rational
Krylov subspace algorithm (IRKA) and related schemes. However, these methods
are used to obtain good approximations on a infinite time-horizon. Thus, in
this work, our main goal is to discuss MOR schemes for time-limited linear
systems. For this, we propose an alternative time-limited -norm
and show its connection with the time-limited Gramians. We then provide
first-order optimality conditions for an optimal reduced order model (ROM) with
respect to the time-limited -norm. Based on these optimality
conditions, we propose an iterative scheme, which, upon convergence, aims at
satisfying these conditions approximately. Then, we analyze how far away the
obtained ROM due to the proposed algorithm is from satisfying the optimality
conditions. We test the efficiency of the proposed iterative scheme using
various numerical examples and illustrate that the newly proposed iterative
method can lead to a better reduced-order compared to the unrestricted IRKA in
the finite time interval of interest
- …