Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
  Balanced Truncation Model Order Reduction in Limited Time Intervals for Large Systems

Kürschner, P. (2018). Balanced Truncation Model Order Reduction in Limited Time Intervals for Large Systems. Advances in Computational Mathematics, 44(6), 1821-1844. doi:10.1007/s10444-018-9608-6.

Item is

Basisdaten

einblenden: ausblenden:
Genre: Zeitschriftenartikel

Dateien

einblenden: Dateien
ausblenden: Dateien
:
item_2473547.pdf (Verlagsversion), 2MB
Name:
item_2473547.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Öffentlich
MIME-Typ / Prüfsumme:
application/pdf / [MD5]
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
© The Author(s) 2018. This article is distributed under the terms of the Creative Commons Attribution 4.0

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Kürschner, Patrick1, Autor           
Affiliations:
1Computational Methods in Systems and Control Theory, Max Planck Institute for Dynamics of Complex Technical Systems, Max Planck Society, ou_1738141              

Inhalt

einblenden:
ausblenden:
Schlagwörter: Mathematics, Numerical Analysis, math.NA,
 Zusammenfassung: In this article we investigate model order reduction of large-scale systems
using time-limited balanced truncation, which restricts the well known balanced
truncation framework to prescribed finite time intervals. The main emphasis is
put on the efficient numerical realization of this model reduction approach. We
discuss numerical methods to deal with the involved matrix exponential
functions and the occurring large-scale Lyapunov equations which are solved for
low-rank approximations. Our main tool for this purpose are rational Krylov
subspace methods. We also discuss the eigenvalue decay and numerical rank of
the solutions of the Lyapunov equations. These results, and also numerical
experiments, will show that depending on the final time horizon, the numerical
rank of the Lyapunov solutions in time-limited balanced truncation can be
smaller compared to standard balanced truncation. In numerical experiments we
test the approaches for computing low-rank factors of the occurring Lyapunov
solutions and illustrate that time-limited balanced truncation can generate
reduced order models having a higher accuracy in the considered time region.

Details

einblenden:
ausblenden:
Sprache(n):
 Datum: 2018
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: DOI: 10.1007/s10444-018-9608-6
URI: http://arxiv.org/abs/1707.02839
Anderer: pubdata_escidoc:2473547
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Advances in Computational Mathematics
Genre der Quelle: Zeitschrift
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Basel : Springer
Seiten: - Band / Heft: 44 (6) Artikelnummer: - Start- / Endseite: 1821 - 1844 Identifikator: ISSN: 1019-7168