数学
块(置换群论)
线性代数
基质(化学分析)
算法
数值线性代数
集合(抽象数据类型)
域代数上的
半定规划
数值分析
应用数学
数学优化
组合数学
计算机科学
纯数学
数学分析
材料科学
几何学
复合材料
程序设计语言
作者
Takanori Maehara,Kazuo Murota
摘要
An algorithm is given for the problem of finding the finest simultaneous block-diagonalization of a given set of square matrices. This problem has been studied independently in the area of semidefinite programming and independent component analysis. The proposed algorithm considers the commutant algebra of the matrix -algebra generated by the given matrices. It is simpler than other existing methods, and has the capability of controlling numerical errors. Some numerical examples are presented to demonstrate its merits.
科研通智能强力驱动
Strongly Powered by AbleSci AI