A numerical algorithm for block-diagonal decomposition of matrix *-algebras with general irreducible components
- 222 Downloads
An algorithm is proposed for finding the finest simultaneous block-diagonalization of a finite number of square matrices, or equivalently the irreducible decomposition of a matrix *-algebra given in terms of its generators. This extends the approach initiated by Murota–Kanno–Kojima–Kojima. The algorithm, composed of numerical-linear algebraic computations, does not require any algebraic structure to be known in advance. The main ingredient of the algorithm is the Schur decomposition and its skew-Hamiltonian variant for eigenvalue computation.
KeywordsMatrix *-algebra Block-diagonalization Group symmetry Schur decomposition Skew-Hamiltonian Schur decomposition
Unable to display preview. Download preview PDF.
- 2.Benner, P., Kressner, D., Mehrmann, V.: Skew-Hamiltonian and Hamiltonian eigenvalue problems: Theory, algorithms and applications. In: Drmač, Z., Marušić, M., Tutek, Z. (eds.) Proc. Conf. Appl. Math. Sci. Comput., pp. 3–39. Springer, Brijoni, Croatia (2005)Google Scholar
- 4.Murota, K., Kanno, Y., Kojima, M., Kojima, S.: A numerical algorithm for block-diagonal decomposition of matrix *-algebras with application to semidefinite programming. Jpn. J. Ind. Appl. Math. 27, (2010, in press) (Original version: “A numerical algorithm for block-diagonal decomposition of matrix *-algebras,” METR 2007-52, University of Tokyo, September 2007)Google Scholar
- 5.Narayanan S.: Space Structures: Principles and Practice. Multi-Science Publishing, UK (2008)Google Scholar