Abstract
The finest simultaneous block-diagonalization for a given set of square matrices has been studied independently in the area of independent component analysis (ICA) and semidefinite programming. A new algorithm for this problem, which finds the finest decomposition with a capability of coping with numerical errors, has recently been proposed by the present authors. In this paper we indicate the use of the algorithm for ICA by describing its main features and comparing the method with the other existing methods.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
