Name
Abstract | ||
|---|---|---|
When 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 output error bound for TLBT with two different representations. The performance of the error bound is then shown in several numerical experiments. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.sysconle.2018.08.004 | Systems & Control Letters |
Keywords | Field | DocType |
Model reduction,Linear systems,Time-limited balanced truncation,Time-limited Gramians,Error bound | Discretization,Applied mathematics,Mathematical optimization,Model order reduction,Balanced truncation,Partial differential equation,Mathematics,Finite time,Computational complexity theory | Journal |
Volume | ISSN | Citations |
121 | 0167-6911 | 1 |
PageRank | References | Authors |
0.38 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Redmann | 1 | 3 | 1.54 |
| Patrick Kürschner | 2 | 37 | 5.29 |