1983
DOI: 10.1109/tac.1983.1103195
|View full text |Cite
|
Sign up to set email alerts
|

On the structure of balanced and other principal representations of SISO systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
77
0

Year Published

1992
1992
2012
2012

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 133 publications
(78 citation statements)
references
References 4 publications
1
77
0
Order By: Relevance
“…which by subtraction yields This shows that Theorem 2.1 is a generalization of the previous results as in [1], [4], [5] (see (1.1)). …”
Section: G(r)supporting
confidence: 74%
“…which by subtraction yields This shows that Theorem 2.1 is a generalization of the previous results as in [1], [4], [5] (see (1.1)). …”
Section: G(r)supporting
confidence: 74%
“…The difficulty (pointed out earlier) of working with two Lyapunov equations separately, as proposed in [48], has led to the consideration of a different approach which is based upon the notion of a cross grammian that was introduced in [28]. The cross grammian .…”
Section: Svd-krylov-based Approximation Methodsmentioning
confidence: 99%
“…Since any balanced realization of a SISO-system can be shown to be signsymmetric with respect to the entries in A, B and C (cf. [14] and [6]), we can describe a procedure to compute a positive reduced order model of a SISO-system, by just comparing signs in the sign-symmetric realization. In the worst case, this procedure only allows for the scalar approximation mentioned above, but in practical examples, it yields positive approximations also of higher order with an acceptable error bound.…”
Section: {ẋ (T) = Ax(t) + Bu(t) Y(t) = Cx(t) + Du(t)mentioning
confidence: 99%