dc.contributor.author |
Al'pin Y. |
|
dc.contributor.author |
George A. |
|
dc.contributor.author |
Ikramov K. |
|
dc.date.accessioned |
2018-09-17T20:27:15Z |
|
dc.date.available |
2018-09-17T20:27:15Z |
|
dc.date.issued |
2000 |
|
dc.identifier.issn |
0024-3795 |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/133503 |
|
dc.description.abstract |
The CIS problem is formulated as follows. Let p be a fixed integer, 1≤p<n. For given n×n compex matrices A and B, can one verify whether A and B have a common invariant subspace of dimension p by a procedure employing a finite number of arithmetical operations? We describe an algorithm solving the CIS problem for p=2. Unlike the algorithm proposed earlier by the second and third authors, the new algorithm does not impose any restrictions on A and B. Moreover, when A and B generate a semisimple algebra, the algorithm is able to solve the CIS problem for any p, 1<p<n. |
|
dc.relation.ispartofseries |
Linear Algebra and Its Applications |
|
dc.subject |
2-generated matrix algebra |
|
dc.subject |
Common invariant subspace |
|
dc.subject |
Radical |
|
dc.subject |
Rational algorithm |
|
dc.subject |
Shemesh's theorem |
|
dc.subject |
Socle |
|
dc.title |
Solving the two-dimensional CIS problem by a rational algorithm |
|
dc.type |
Article |
|
dc.relation.ispartofseries-issue |
1-3 |
|
dc.relation.ispartofseries-volume |
312 |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.relation.startpage |
115 |
|
dc.source.id |
SCOPUS00243795-2000-312-13-SID0034421619 |
|