.png){kind=icon}
.png){kind=icon}
Return
On using exact joint diagonalization for noniterative approximate joint diagonalization
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2005.853046.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a novel, noniterative approach for the problem of nonunitary, least-squares (LS) approximate joint diagonalization (AJD) of several Hermitian target matrices. Dwelling on the fact that exact joint diagonalization (EJD) of two Hermitian matrices can almost always be easily obtained in closed form, we show how two representative matrices can be constructed out of the original set of all target matrices, such that their EJD would be useful in the AJD of the original set. Indeed, for the two-by-two case, we show that the EJD of the representative matrices yields the optimal AJD solution. For larger-scale cases, the EJD can provide a suboptimal AJD solution, possibly serving as a good initial guess for a subsequent iterative algorithm. Additionally, we provide an informative lower bound on the attainable LS fit, which is useful in gauging the distance of prospective solutions from optimality.
Keywords:
blind source separation
independent components analysis
nonunitary approximate joint diagonalization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
No organization information available