1979
DOI: 10.1007/978-3-0348-6293-6
|View full text |Cite
|
Sign up to set email alerts
|

Minimal Factorization of Matrix and Operator Functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

5
285
0
2

Year Published

1984
1984
2004
2004

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 448 publications
(300 citation statements)
references
References 0 publications
5
285
0
2
Order By: Relevance
“…We note that ]Ct, ]Cr, and s do not have eigenvalues on the imaginary axis. This follows from the invertibility of I~ -R(A) R(),) t and Corollary 2.7 in [13]; for/Q and Er this also follows immediately from the special form of the matrices ]Q and ]C~ in (7.4) and the fact that A has no eigenvalues on the imaginary axis. Hence the matrices (~ -i]Cl) -1, (A -iK:~) -1, and (A -ig) -1 in (7.2), (7.3), (7.5), and (7.6) all exist for A e R.…”
Section: Tr(a)-i [Tr(a*)t]-l=in-ieo Bt](a-ie)-i [~]mentioning
confidence: 83%
See 2 more Smart Citations
“…We note that ]Ct, ]Cr, and s do not have eigenvalues on the imaginary axis. This follows from the invertibility of I~ -R(A) R(),) t and Corollary 2.7 in [13]; for/Q and Er this also follows immediately from the special form of the matrices ]Q and ]C~ in (7.4) and the fact that A has no eigenvalues on the imaginary axis. Hence the matrices (~ -i]Cl) -1, (A -iK:~) -1, and (A -ig) -1 in (7.2), (7.3), (7.5), and (7.6) all exist for A e R.…”
Section: Tr(a)-i [Tr(a*)t]-l=in-ieo Bt](a-ie)-i [~]mentioning
confidence: 83%
“…[8,27]). When the reflection coefficients are rational, we apply state space methods [13] to solve the Marchenko equations and the inverse problem explicitly. For rational reflection coefficients, this approach provides us with a systematic inversion method for inverse scattering problems on the line, which is different from previous methods such as those used in [9].…”
Section: Dz(xa) [ P(x) Ai~ -V(x) L Z(xa) ' Dx -;Z~ -V(x) -P(x) P(mentioning
confidence: 99%
See 1 more Smart Citation
“…In this section we prove a number of results on observable, controllable and minimal GR-nodes in the multivariable non-commutative setting, which generalize some well known statements for one-variable nodes (see [15]). Let us introduce the k-th truncated observability matrix O k and the k-th truncated controllability matrix C k of a GR-node (2.6) by…”
Section: Preliminariessupporting
confidence: 60%
“…Moreover pr Iγ −Π (α) is similar to β ′ , and pr Π (α) is similar to β ′′ . The uniqueness of Π is proved in the same way as in [15,Theorem 4.8]. The uniqueness of the GR-node similarity follows from Theorem 3.5.…”
Section: 1])mentioning
confidence: 84%