2 results
Search Results
Now showing 1 - 2 of 2
- ItemAn H2-type error bound for time-limited balanced truncation(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2017) Redmann, Martin; Kürschner, PatrickWhen solving partial differential equations numerically, usually a high order spatial discretization is needed. Model order reduction (MOR) techniques are often used to reduce the order of spatially-discretized systems and hence reduce computational complexity. A particular MOR technique to obtain a reduced order model (ROM) is balanced truncation (BT). However, if one aims at finding a good ROM on a certain finite time interval only, time-limited BT (TLBT) can be a more accurate alternative. So far, no error bound on TLBT has been proved. In this paper, we close this gap in the theory by providing an H2 error bound for TLBT with two different representations. The performance of the error bound is then shown in several numerical experiments.
- ItemTowards time-limited H2-optimal model order reduction(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2017) Goyal, Pawan; Redmann, MartinIn 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 H2-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 H2-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 H2-norm. Based on these optimality conditions, we propose an iterative scheme which upon convergences aims at satisfying these conditions. Then, we analyze how far away the obtained ROM 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 unrestricted IRKA in the time interval of interest.