English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  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

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-002E-739C-5 Version Permalink: http://hdl.handle.net/21.11116/0000-0002-B34D-E
Genre: Journal Article

Files

show Files
hide Files
:
item_2473547.pdf (Publisher version), 2MB
Name:
item_2473547.pdf
Description:
-
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
© The Author(s) 2018. This article is distributed under the terms of the Creative Commons Attribution 4.0

Locators

show

Creators

show
hide
 Creators:
Kürschner, Patrick1, Author              
Affiliations:
1Computational Methods in Systems and Control Theory, Max Planck Institute for Dynamics of Complex Technical Systems, Max Planck Society, ou_1738141              

Content

show
hide
Free keywords: Mathematics, Numerical Analysis, math.NA,
 Abstract: 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

show
hide
Language(s):
 Dates: 2018
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Method: Peer
 Identifiers: DOI: 10.1007/s10444-018-9608-6
URI: http://arxiv.org/abs/1707.02839
Other: pubdata_escidoc:2473547
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Advances in Computational Mathematics
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Basel : Springer
Pages: - Volume / Issue: 44 (6) Sequence Number: - Start / End Page: 1821 - 1844 Identifier: ISSN: 1019-7168