An algorithmic approach to simultaneous triangularization (Q1020928)
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 5561705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithmic approach to simultaneous triangularization |
scientific article; zbMATH DE number 5561705 |
Statements
An algorithmic approach to simultaneous triangularization (English)
0 references
4 June 2009
0 references
The problem of determining whether or not a set of matrices, denoted by \(S\), admits a simultaneous triangularization is a long studied problem. This paper presents an algorithm to solve this problem. In order to apply this algorithm, one must have an algorithm for computing a common eigenvector for a set of matrices. To this end, one can run the \textit{D. Shemesh} algorithm [Linear Algebra Appl. 62, 11--18 (1984; Zbl 0556.15006)] for all pairs of matrices in \(S\) and bisect the results.
0 references
simultaneous triangularization
0 references
Lie algebra
0 references
common eigenvector
0 references
Shemesh algorithm
0 references
0 references
0.808157742023468
0 references
0.7804358601570129
0 references
0.7744576334953308
0 references
0.7735727429389954
0 references
0.7727462649345398
0 references
