Publisher DOI: | 10.1016/j.laa.2011.02.040 | Title: | Multi-level substructuring combined with model order reduction methods | Language: | English | Authors: | Blömeling, Frank | Keywords: | Domain decomposition; Model reduction methods; Multi-level substructuring | Issue Date: | 16-Sep-2011 | Publisher: | American Elsevier Publ. | Source: | Linear Algebra and Its Applications 10 (436): 3864-3882 (2012) | Abstract (english): | In many fields of engineering problems linear time-invariant dynamical systems (LTI systems) play an outstanding role. They result for instance from discretizations of the unsteady heat equation and they are also used in optimal control problems. Often the order of LTI systems is a limiting factor, since it becomes easily very large. As a consequence these systems cannot be treated efficiently without model reduction algorithms. In this paper a new approach for the combination of model order reduction methods and recent multi-level substructuring (MLS) techniques is presented. Similar multi-level substructuring methods have already been applied successfully to huge eigenvalue problems up to several millions of degrees of freedom. However, the presented approach does not make use of a modal analysis like former algorithms. Instead the original system is decomposed in smaller LTI systems which are treated with recent model reduction methods. Furthermore, the error which is induced by this substructuring approach is analysed and numerical examples based on the Oberwolfach benchmark collection are given in this paper. |
URI: | http://hdl.handle.net/11420/3362 | ISSN: | 0024-3795 | Journal: | Institute: | Mathematik E-10 | Document Type: | Article |
Appears in Collections: | Publications without fulltext |
Show full item record
Page view(s)
203
Last Week
1
1
Last month
2
2
checked on May 29, 2023
SCOPUSTM
Citations
4
Last Week
0
0
Last month
0
0
checked on Jun 30, 2022
Google ScholarTM
Check
Add Files to Item
Note about this record
Cite this record
Export
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.