  


A Numerical Algorithm for BlockDiagonal Decomposition of Matrix *Algebras, Part II: General Algorithm
Takanori Maehara(maeharamisojiro.t.utokyo.ac.jp) Abstract: An algorithm is proposed for finding the finest simultaneous blockdiagonalization 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 in Part I by MurotaKannoKojimaKojima. The algorithm, composed of numericallinear 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 skewHamiltonian variant for eigenvalue computation. Keywords: matrix *algebra, blockdiagonalization, group symmetry, Schur decomposition, skewHamiltonian Schur decomposition Category 1: Linear, Cone and Semidefinite Programming (Semidefinite Programming ) Category 2: Applications  Science and Engineering Citation: METR 200826, Department of Mathematical Informatics, University of Tokyo, Japan, May 2008 (revised in May 2009). Download: [PDF] Entry Submitted: 05/11/2009 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  