Perturbation Analysis for Matrix Joint Block Diagonalization
Yunfeng Cai, Reng-cang Li

TL;DR
This paper develops a perturbation theory for the matrix joint block diagonalization problem (JBDP), providing error bounds, backward error analysis, and a condition number to assess the stability of approximate solutions in noisy settings.
Contribution
It introduces the first perturbation analysis framework for JBDP, including error bounds and condition number, based on a recent solution uniqueness condition.
Findings
Error bounds for approximate solutions are established.
Backward error analysis for JBDP is performed.
A condition number for JBDP is proposed.
Abstract
The matrix joint block diagonalization problem (JBDP) of a given matrix set is about finding a nonsingular matrix such that all are block diagonal. It includes the matrix joint diagonalization problem (JBD) as a special case for which all are required diagonal. Generically, such a matrix may not exist, but there are practically applications such as multidimensional independent component analysis (MICA) for which it does exist under the ideal situation, i.e., no noise is presented. However, in practice noises do get in and, as a consequence, the matrix set is only approximately block diagonalizable, i.e., one can only make all nearly block diagonal at best, where is an approximation to , obtained usually by computation. This motivates us to develop a perturbation…
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
TopicsBlind Source Separation Techniques · Sparse and Compressive Sensing Techniques · Control Systems and Identification
