2016
DOI: 10.3934/naco.2016.6.73
|View full text |Cite
|
Sign up to set email alerts
|

Projection-based model reduction for time-varying descriptor systems: New results

Abstract: We have presented a Krylov-based projection method for model reduction of linear time-varying descriptor systems in [13] which was based on earlier ideas in the work of J. Philips [17] and others. This contribution continues that work by presenting more details of linear time-varying descriptor systems and new results coming from real fields of application. The idea behind the proposed procedure is based on a multipoint rational approximation of the monodromy matrix of the corresponding differential-algebraic … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 26 publications
0
5
0
Order By: Relevance
“…In this example, the reduced system matrices of k = 4 are constructed at each time step using the two‐sided Lanczos moment matching algorithm 63 . More compact representation of the projection can be built considering that the projection matrices span over the union of all the projection subspaces 32 ; however, its application is beyond the scope of this article.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In this example, the reduced system matrices of k = 4 are constructed at each time step using the two‐sided Lanczos moment matching algorithm 63 . More compact representation of the projection can be built considering that the projection matrices span over the union of all the projection subspaces 32 ; however, its application is beyond the scope of this article.…”
Section: Resultsmentioning
confidence: 99%
“…Many of the reduction methods can be extended to the reduction of time‐varying systems, for a review see Reference 32 and the references therein. Balanced truncation methods, with a priori stability guarantee, are generalized to linear time‐varying systems 33‐36 .…”
Section: Introductionmentioning
confidence: 99%
“…To ease the computational complexity, we can convert the linear time‐varying system () into its equivalent LTI form. This reformulation also allows us to extend theory dedicated to time‐invariant systems to the LTV setting [4–6]. It is important to note that this type of LTI conversion is possible for a system which has near linear response but is nonlinear in nature (sometimse called weakly nonlinear).…”
Section: Introductionmentioning
confidence: 99%
“…It is important to note that this type of LTI conversion is possible for a system which has near linear response but is nonlinear in nature (sometimse called weakly nonlinear). That means systems have small periodic perturbation [5–7].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation