Solving the two-dimensional CIS problem by a rational algorithm (Q1573665)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1485560
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the two-dimensional CIS problem by a rational algorithm |
scientific article; zbMATH DE number 1485560 |
Statements
Solving the two-dimensional CIS problem by a rational algorithm (English)
0 references
26 June 2001
0 references
The common invariant subspace (CIS) problem is discussed. Let \(1\leq p< n\) be a fixed integer, and \(A\) and \(B\) are complex matrices. Can one verify whether \(A\) and \(B\) have a common invariant subspace of dimension \(p\) in a finite number of steps? An algorithm is given which solves the problem for \(p=2\). No restrictions are imposed 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\).
0 references
common invariant subspace
0 references
rational algorithm
0 references
2-generated matrix algebra
0 references
radical
0 references
socle
0 references
Shemesh's theorem
0 references
0.8443616
0 references
0.83664596
0 references
0.82976884
0 references
0.82762295
0 references
0.8255997
0 references
0.8255838
0 references
0 references
