An Algebraic Approach to Non-Orthogonal General Joint Block Diagonalization
Yunfeng Cai, Chengyu Liu

TL;DR
This paper introduces an algebraic method for solving the non-orthogonal general joint block diagonalization problem by transforming it into a system of linear equations and then applying similarity transformations.
Contribution
It establishes a novel algebraic framework linking joint block diagonalization to linear systems and proposes two numerical methods for solving the problem.
Findings
The proposed methods effectively solve the nogjbd problem.
A necessary and sufficient condition for solution equivalence is provided.
Numerical examples demonstrate the methods' advantages.
Abstract
The exact/approximate non-orthogonal general joint block diagonalization ({\sc nogjbd}) problem of a given real matrix set is to find a nonsingular matrix (diagonalizer) such that for are all exactly/approximately block diagonal matrices with the same diagonal block structure and with as many diagonal blocks as possible. In this paper, we show that a solution to the exact/approximate {\sc nogjbd} problem can be obtained by finding the exact/approximate solutions to the system of linear equations for , followed by a block diagonalization of via similarity transformation. A necessary and sufficient condition for the equivalence of the solutions to the exact {\sc nogjbd} problem is established. Two numerical methods are proposed to solve the {\sc nogjbd} problem, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Blind Source Separation Techniques · Tensor decomposition and applications
