An algorithmic approach to simultaneous triangularization

DOI10.1016/J.LAA.2008.05.037MaRDI QIDQ1020928zbMATH OpenOpenAlexFDO

Authors Chen Dubi

Publication date 4 June 2009

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2008.05.037

zbMATH Keywords

common eigenvectorLie algebraShemesh algorithmsimultaneous triangularization

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)

Review text

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.

Recommendations

• On the simultaneous triangulability of matrices
• Length function and simultaneous triangularization of matrix pairs
• Fast simultaneous orthogonal reduction to triangular matrices
• Common eigenvectors and quasicommutativity of sets of simultaneously triangularizable matrices
• Simultaneous singular value decomposition

Cites work

• A criterion for the existence of common invariant subspaces of matrices
• A Trace Condition Equivalent to Simultaneous Triangularizability
• Common eigenvectors of two matrices
• scientific article; zbMATH DE number 3983386 (Why is no real title available?)
• scientific article; zbMATH DE number 3332584 (Why is no real title available?)
• Lie groups and Lie algebras III. Structure of Lie groups and Lie algebras. Transl. from the Russian by V. Minachin
• Simultaneous triangularization
• Some Theorems on Commutative Matrices
• The common invariant subspace problem: an approach via Gröbner bases
• Triangular realization of rational functions of N complex variables

Cited in

(22)

• Simultaneous triangularization of projector matrices
• Flatness and structural analysis as a constructive framework for private communication
• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
• Characterization of flat outputs of switched linear discrete-time systems: algebraic condition and algorithm
• Nilpotent semigroups for the characterization of flat outputs of switched linear and LPV discrete-time systems
• A simultaneous triangularization result
• Pairs of matrices, one of which commutes with their commutator
• scientific article; zbMATH DE number 5722792 (Why is no real title available?)
• Simultaneous reduction of matrices in the presence of a nonderogatory matrix
• scientific article; zbMATH DE number 515764 (Why is no real title available?)
• Simultaneous Triangularization of the Coefficients of Linear Systems
• Weak simultaneous triangularization - A determinant condition
• Formal derivation of algorithms
• One-parameter family of Neville-Aitken algorithm on q-triangle
• On the simultaneous triangulability of matrices
• Length function and simultaneous triangularization of matrix pairs
• Towards a spectral approach for the design of self-synchronizing stream ciphers
• More free products in the group of N×N unitriangular matrices
• Uniform global stability of switched nonlinear systems in the Koopman operator framework
• Developing an algorithm for triad design
• Simultaneous similarity and triangularization of sets of 2 by 2 matrices

This page was built for publication: An algorithmic approach to simultaneous triangularization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1020928)