On joint eigen-decomposition of matrices
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910605388021760 |
|---|---|
| author | Troedsson, Erik Falkowski, Daniel Lidgren, Carl-Fredrik Wendt, Herwig Carlsson, Marcus |
| author_facet | Troedsson, Erik Falkowski, Daniel Lidgren, Carl-Fredrik Wendt, Herwig Carlsson, Marcus |
| contents | The problem of approximate joint diagonalization of a collection of matrices arises in a number of diverse engineering and signal processing problems. This problem is usually cast as an optimization problem, and it is the main goal of this publication to provide a theoretical study of the corresponding cost-functional. As our main result, we prove that this functional tends to infinity in the vicinity of rank-deficient matrices with probability one, thereby proving that the optimization problem is well posed. Secondly, we provide unified expressions for its higher-order derivatives in multilinear form, and explicit expressions for the gradient and the Hessian of the functional in standard form, thereby opening for new improved numerical schemes for the solution of the joint diagonalization problem. A special section is devoted to the important case of self-adjoint matrices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_10292 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On joint eigen-decomposition of matrices Troedsson, Erik Falkowski, Daniel Lidgren, Carl-Fredrik Wendt, Herwig Carlsson, Marcus Numerical Analysis Optimization and Control The problem of approximate joint diagonalization of a collection of matrices arises in a number of diverse engineering and signal processing problems. This problem is usually cast as an optimization problem, and it is the main goal of this publication to provide a theoretical study of the corresponding cost-functional. As our main result, we prove that this functional tends to infinity in the vicinity of rank-deficient matrices with probability one, thereby proving that the optimization problem is well posed. Secondly, we provide unified expressions for its higher-order derivatives in multilinear form, and explicit expressions for the gradient and the Hessian of the functional in standard form, thereby opening for new improved numerical schemes for the solution of the joint diagonalization problem. A special section is devoted to the important case of self-adjoint matrices. |
| title | On joint eigen-decomposition of matrices |
| topic | Numerical Analysis Optimization and Control |
| url | https://arxiv.org/abs/2409.10292 |