Let A be an n × n matrix. It is a relatively simple process to construct a homogeneous ideal (generated by quadrics) whose associated projective variety parametrizes the one-dimensional invariant subspaces of A. Given a finite collection of n × n matrices, one can similarly construct a homogeneous ideal (again generated by quadrics) whose associated projective variety parametrizes the one-dimensional subspaces which are invariant subspaces for every member of the collection. Grobner basis techniques then provide a finite, rational algorithm to determine how many points are on this variety. In other words, a finite, rational algorithm is given to determine both the existence and quantity of common one-dimensional invariant subspaces to a set of matrices. This is then extended, for each d, to an algorithm to determine both the existence and quantity of common d-dimensional invariant subspaces to a set of matrices. © 2004 Published by Elsevier Inc.
[1]
Joe W. Harris,et al.
Algebraic Geometry: A First Course
,
1995
.
[2]
Common invariant subspaces of two matrices
,
1999
.
[3]
M. Tsatsomeros.
A criterion for the existence of common invariant subspaces of matrices
,
2001
.
[4]
D. Eisenbud,et al.
Direct methods for primary decomposition
,
1992
.
[5]
Dan Shemesh,et al.
Common eigenvectors of two matrices
,
1984
.
[6]
David A. Cox,et al.
Ideals, Varieties, and Algorithms
,
1997
.
[7]
K. Brown,et al.
Graduate Texts in Mathematics
,
1982
.