2011
DOI: 10.2316/journal.201.2011.1.201-2245
|View full text |Cite
|
Sign up to set email alerts
|

Model Reduction for Discrete-Time Switched Linear Time-Delay Systems via the H∞ Robust Stability

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 0 publications
0
8
0
Order By: Relevance
“…Considerable attention has been dedicated in recent years to the problem of MOR for linear switched systems. A class of methods that involves matching of generalized Markov parameters (known also as time domain Krylov methods) has been discussed in [4,3]; H ∞ type of reduction methods were developed in [43,11,44]. We mention some publications that are focused on the reduction of discrete LSS, such as [41] and [12].…”
Section: Introductionmentioning
confidence: 99%
“…Considerable attention has been dedicated in recent years to the problem of MOR for linear switched systems. A class of methods that involves matching of generalized Markov parameters (known also as time domain Krylov methods) has been discussed in [4,3]; H ∞ type of reduction methods were developed in [43,11,44]. We mention some publications that are focused on the reduction of discrete LSS, such as [41] and [12].…”
Section: Introductionmentioning
confidence: 99%
“…Notice that computational neuroscience often involves models of ever increasing computational complexity [35], our team has already invested significant efforts in reduction of model complexity. Another orientation work may be considered, in parallel to the studied stability constraints here, in investigating a reduction of model order [36,37], while guaranteeing its stability and maintaining desired nonlinear dynamic response.…”
Section: Discussionmentioning
confidence: 99%
“…The disadvantage of these methods is that often there are no error bounds or the reduced order model need not be well-posed. Examples of such papers include [8], [9], [10], [11], [12], [13]. Note that to the best of our knowledge, the only algorithm which always yields a well-posed linear switched system of the same type as the original one and for which there exists an analytic error bound is the one of [13].…”
Section: Methods Based On Local Gramiansmentioning
confidence: 99%