1984
DOI: 10.1080/00207178408933239
|View full text |Cite
|
Sign up to set email alerts
|

All optimal Hankel-norm approximations of linear multivariable systems and theirL,-error bounds†

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

10
1,319
2
19

Year Published

1996
1996
2010
2010

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 2,673 publications
(1,350 citation statements)
references
References 13 publications
10
1,319
2
19
Order By: Relevance
“…A mathematically precise version of this statement is possible, using the results of [6,9] on the errors obtained using balanced truncation.…”
Section: Previous Workmentioning
confidence: 99%
“…A mathematically precise version of this statement is possible, using the results of [6,9] on the errors obtained using balanced truncation.…”
Section: Previous Workmentioning
confidence: 99%
“…where the invertibility of (J 22 −D 22 ) is due to Corollary 4.5 below, and we have omitted integration constants C(ζ 1 ). The Fredholm alternative for (3.8) then yields…”
Section: Strong Confinement Limitmentioning
confidence: 99%
“…with the shorthand Q = C∇ 2 H. Moore [21] has shown that, if W c , W o 0 (positive definiteness = complete controllability/observability), there exists a coordinate transformation x → T x such that the two Gramians become equal and diagonal: 1 1 T is a so-called contragredient transformation; see [22] for details.…”
Section: Balancing Transformationsmentioning
confidence: 99%
“…When dealing with high-order models, it is reasonable to look for an approximate stable model ẋ m (t) = A m x m (t) + B m u(t) y m (t) = C m x m (t), (1.2) in which A m ∈ R m×m , B m , C T m ∈ R m×s and x m (t), y m (t) ∈ R m , with m n. Hence, the reduction problem consists in approximating the triplet {A, B, C} by another one {Â,B,Ĉ} of small size. Several approaches in this area have been used as Padé approximation [15,33,34], balanced truncation [29,37], optimal Hankel norm [16,17] and Krylov subspace methods [3,6,11,12,21,22]. These approaches require the solution of coupled Lyapunov matrix equations [1,13,25,27] having the form A P + P A T + B B T = 0 A T Q + Q A + C T C = 0, (1.3) where P, Q are the controllability and the observability Grammians of the system (1.1).…”
Section: Introductionmentioning
confidence: 99%