Birmingham

Triangularization of matrix polynomials in their most
general form
Leo Taslaman
The University of Manchester
September 10, 2012
Joint work with Fran coise Tisseur
Leo Taslaman The University of Manchester () Triangularization of matrix polynomials September 10, 2012 1 / 18
Triangularization
(Schur form) For any square A, there exists an unitary Q such that
QAQ
is triangular.
(Generalized Schur form) For any square A + B, there exist unitary
Q and Z such that Q(A + B)Z
is triangular.
What can be said about triangularization for higher order matrix
polynomials A
+ A
1
1
+ + A
0
?
Triangularization
QAQ
is triangular.
is triangular.
polynomials A
+ A
1
1
+ + A
0
?
Triangularization
QAQ
is triangular.
is triangular.
polynomials A
+ A
1
1
+ + A
0
?
A link to the previous talk
I
+ A
1
1
+ + A
0
Equivalence
I
+ T
1
1
+ + T
0
. .
Triangular
_Linearization
I
n
_
A
0
I A
1
I A
2
.
.
.
.
.
.
I A
1
_
_
Similarity
I
n
_
T
0
I T
1
I T
2
.
.
.
.
.
.
I T
1
_
_
Objectives for this talk
We will show that any square P() over an algebraically closed eld is
strongly equivalent to a triangular matrix polynomial of the same
degree.
Similarly, over R, we show strong equivalence to a quasi-triangular
matrix polynomial of the same degree.
Inverse problems.
A conjecture.
degree.
Inverse problems.
A conjecture.
degree.
Inverse problems.
A conjecture.
degree.
Inverse problems.
A conjecture.
Denitions
Consider an n n matrix polynomial over a eld F, that is is a matrix
_
_
p
11
() . . . p
1n
()
.
.
.
.
.
.
.
.
.
p
n1
() . . . p
nn
()
_
_
, p
ij
() F[],
or equivalently, a polynomial
P() = A
+ A
1
1
+ + A
0
, A
i
F
nn
.
We assume that A
= 0 and is called the degree. The reversal is dened

as
revP() = A
0
+ A
1
1
+ + A
.
Denitions
_
_
p
11
() . . . p
1n
()
.
.
.
.
.
.
.
.
.
p
n1
() . . . p
nn
()
_
_
, p
ij
() F[],
P() = A
+ A
1
1
+ + A
0
, A
i
F
nn
.
We assume that A

as
revP() = A
0
+ A
1
1
+ + A
.
Denitions
_
_
p
11
() . . . p
1n
()
.
.
.
.
.
.
.
.
.
p
n1
() . . . p
nn
()
_
_
, p
ij
() F[],
P() = A
+ A
1
1
+ + A
0
, A
i
F
nn
.
We assume that A
= 0 and is called the degree.

The reversal is dened
as
revP() = A
0
+ A
1
1
+ + A
.
Denitions
_
_
p
11
() . . . p
1n
()
.
.
.
.
.
.
.
.
.
p
n1
() . . . p
nn
()
_
_
, p
ij
() F[],
P() = A
+ A
1
1
+ + A
0
, A
i
F
nn
.
We assume that A

as
revP() = A
0
+ A
1
1
+ + A
.
Smith form
Any P() can be reduced to a unique Smith form by the elementary
transformations:
1
Permutation of rows/columns.
2
Multiply a row/column by a nonzero element in F.
3
Add one row/column to another row/column.
If P() and Q() have the same Smith form we say that they are
equivalent and write P() Q().
Smith form
Any P() can be reduced to a unique Smith form by the elementary
transformations:
1
Permutation of rows/columns.
2
Multiply a row/column by a nonzero element in F.
3
Add one row/column to another row/column.
If P() and Q() have the same Smith form we say that they are
equivalent and write P() Q().
Smith form a closer look
_
_
d
1
.
.
.
0
r ,nr
d
r
0
nr ,r
0
nr ,nr
_
_
, d
1
| |d
r
are monic polynomials,
and d
i
=
1i
1

2i
2

ki
k
. The
i
s are distinct and irreducible over F[].
ti
j
is a nite elementary divisor.
If F is algebraically closed, the
i
s are linear and display the nite
eigenvalues. The
ij
s are the corresponding partial multiplicities.
If F = R the
i
s are linear or quadratic.
_
_
d
1
.
.
.
0
r ,nr
d
r
0
nr ,r
0
nr ,nr
_
_
, d
1
| |d
r
and d
i
=
1i
1

2i
2

ki
k
. The
i
ti
j
i
eigenvalues. The
ij
If F = R the
i
_
_
d
1
.
.
.
0
r ,nr
d
r
0
nr ,r
0
nr ,nr
_
_
, d
1
| |d
r
and d
i
=
1i
1

2i
2

ki
k
. The
i
ti
j
i
eigenvalues. The
ij
If F = R the
i
_
_
d
1
.
.
.
0
r ,nr
d
r
0
nr ,r
0
nr ,nr
_
_
, d
1
| |d
r
and d
i
=
1i
1

2i
2

ki
k
. The
i
ti
j
i
eigenvalues. The
ij
If F = R the
i
Elementary divisors at innity and strong equivalence
The elementary divisors at innity of P() are the elementary divisors
at 0 of revP().
If P() Q() and all the elementary divisors at innity coincide, we
say that P() and Q() are strongly equivalent.
Elementary divisors at innity and strong equivalence
The elementary divisors at innity of P() are the elementary divisors
at 0 of revP().
If P() Q() and all the elementary divisors at innity coincide, we
say that P() and Q() are strongly equivalent.
Example
Example
Consider
P() =
_
_
1 0 0
0 2 0
0 0 0
_
_
.
The reversal is
revP() =
_
_
0 0
0 1 2 0
0 0 0
_
_
_
_
1 0 0
0 (
1
2
) 0
0 0 0
_
_
so P() has an elementary divisor at innity.
Another example
Example
Consider another matrix polynomial Q() equivalent to P()
Q() =
_
_
1 0
0 2 0
0 0 0
_
_
_
_
1 0 0
0 2 0
0 0 0
_
_
= P().
The reversal is
revQ() =
_
_
0 1
0 1 2 0
0 0 0
_
_
_
_
1 0 0
0
1
2
0
0 0 0
_
_
so Q() has an no elementary divisors at innity.
Conclusion: Elementary transformations preserve equivalence but not in
general strong equivalence.
Another example
Example
Consider another matrix polynomial Q() equivalent to P()
Q() =
_
_
1 0
0 2 0
0 0 0
_
_
_
_
1 0 0
0 2 0
0 0 0
_
_
= P().
The reversal is
revQ() =
_
_
0 1
0 1 2 0
0 0 0
_
_
_
_
1 0 0
0
1
2
0
0 0 0
_
_
so Q() has an no elementary divisors at innity.
Conclusion: Elementary transformations preserve equivalence but not in
general strong equivalence.
M obius transformations of matrix polynomials
Theorem (Mackey, Mackey, Mehl and Mehrmann 2012)
Let P() =
i =0
i
A
i
F[]
nn
. If m() =
a+b
c+d
is invertible, then
m(
0
) is an eigenvalue of P() ( allowed) i
0
is an eigenvalue of
Q() = (c + d)
i =0
_
a + b
c + d
_
i
A
i
,
with the same partial multiplicity sequence.
Q() has the same zero-structure as P().
If we can triangularize any matrix polynomial with only nite
eigenvalues, then we can triangularize any matrix polynomial.
M obius transformations of matrix polynomials
Theorem (Mackey, Mackey, Mehl and Mehrmann 2012)
Let P() =
i =0
i
A
i
F[]
nn
. If m() =
a+b
c+d
is invertible, then
m(
0
) is an eigenvalue of P() ( allowed) i
0
is an eigenvalue of
Q() = (c + d)
i =0
_
a + b
c + d
_
i
A
i
,
with the same partial multiplicity sequence.
Q() has the same zero-structure as P().
If we can triangularize any matrix polynomial with only nite
eigenvalues, then we can triangularize any matrix polynomial.
Unwinding the Smith form over an algebraically closed eld
Consider P() of degree with only nite eigenvalues.
We can deate a degree polynomial from the Smith form:
_
_
d
1
.
.
.
d
r 1
d
r
_
d
1

.
.
.
.
.
.
d
r 1

p
_
_
where deg(p) = , and diag(
d
1
, . . . ,
d
n
) is in Smith form [Matrix
polynomials by GLR, Thm 1.7].
... and nally
T() =
_
_
t
1
. . .
.
.
.
.
.
.
.
.
.
.
.
.
t
k
. . .
. . .
.
.
.
.
.
.
_
where deg(t
i
) < for i = 1 : k, and all on the diagonal are of degree .
T() is triangular, of degree and equivalent to P().
Problem: We may have added eigenvalues at innite.
Have developed a technique to remove unwanted innite eigenvalues.
... and nally
T() =
_
_
t
1
. . .
.
.
.
.
.
.
.
.
.
.
.
.
t
k
. . .
. . .
.
.
.
.
.
.
_
where deg(t
i
... and nally
T() =
_
_
t
1
. . .
.
.
.
.
.
.
.
.
.
.
.
.
t
k
. . .
. . .
.
.
.
.
.
.
_
where deg(t
i
... and nally
T() =
_
_
t
1
. . .
.
.
.
.
.
.
.
.
.
.
.
.
t
k
. . .
. . .
.
.
.
.
.
.
_
where deg(t
i
Quasi-triangularization over R
We use a real Mobius transformation and deal with innite
elementary divisors as in the algebraically closed case.
We cannot always deate
_
_
d
1
.
.
.
d
r 1
d
r
_
d
1

.
.
.
.
.
.
d
r 1

p
_
_
where deg p = .
Theorem (T., Tisseur and Zaballa 2012)
If we cannot deate a degree polynomial over R[], then we can
consecutive deate two polynomias of degrees + 1 and 1 respectively.
_
_
d
1
.
.
.
d
r 1
d
r
_
d
1

.
.
.
.
.
.
d
r 1

p
_
_
where deg p = .
_
_
d
1
.
.
.
d
r 1
d
r
_
d
1

.
.
.
.
.
.
d
r 1

p
_
_
where deg p = .
Forming 2 2-blocks on the diagonal
We get a triangular matrix polynomial with diagonal entries of degrees ,
1 and + 1.
Consider a diagonal block where deg(d
i
) = 1 and deg(d
i +1
) = + 1
_
d
i

0 d
i +1
_
_
d
i
d
i
+
0 d
i +1
_
_
d
i
d
i
+
d
i
q
_
. .
degree
where deg(q)
Forming 2 2-blocks on the diagonal
We get a triangular matrix polynomial with diagonal entries of degrees ,
1 and + 1.
Consider a diagonal block where deg(d
i
) = 1 and deg(d
i +1
) = + 1
_
d
i

0 d
i +1
_
_
d
i
d
i
+
0 d
i +1
_
_
d
i
d
i
+
d
i
q
_
. .
degree
where deg(q)
Inverse problems
We have build matrix polynomials from the Smith form having the
desired elementary divisors at innity. This solves some inverse
polynomial eigenvalue problems.
Any Smith form such that nonreal elementary divisors comes in
complex conjugate pairs, is admissible by a real n n matrix
polynomial of minimal degree.
Inverse problems
We have build matrix polynomials from the Smith form having the
desired elementary divisors at innity. This solves some inverse
polynomial eigenvalue problems.
Any Smith form such that nonreal elementary divisors comes in
complex conjugate pairs, is admissible by a real n n matrix
polynomial of minimal degree.
A conjecture
Nonreal elementary divisors of a regular self-adjoint matrix polynomial
A
+ A
1
1
+ + A
0
, A
i
= A
i
,
comes in complex conjugate pairs. Hence any regular self-adjoint matrix
polynomial is strongly equivalent to a real one.
Conjecture
Any regular real matrix polynomial is strongly equivalent to a regular
self-adjoint matrix polynomial, and vice versa.
References
D. S. Mackey, N. Mackey, C. Mehl and V. Mehrmann, Mobius
transformations of matrix polynomials. Technical report, 2012. In
preparation.
L. Taslaman, F. Tisseur and I. Zaballa Triangularizing matrix
polynomials. Technical report, 2012. In preparation.

Birmingham

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Birmingham

Uploaded by

Copyright:

Available Formats

Triangularization of matrix polynomials in their most

= 0 and is called the degree. The reversal is dened

= 0 and is called the degree. The reversal is dened

= 0 and is called the degree.

= 0 and is called the degree. The reversal is dened

You might also like