Lu-Ming Wang, Yawen Deng, Fei Xiang, Xiaofeng Gong
{"title":"Complex-valued Joint Eigenvalue Decomposition Based on LU Decomposition and Successive Rotations","authors":"Lu-Ming Wang, Yawen Deng, Fei Xiang, Xiaofeng Gong","doi":"10.1109/ICIST52614.2021.9440597","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a complex-valued joint eigenvalue decomposition(C-JEVD) algorithm based on LU de-composition and successive rotations. The proposed algorithm factorizes the matrix of eigenvectors into a lower-triangular matrix and an upper-triangular matrix, and update these two matrices using successive rotations. In each rotation, the elementary rotation matrix contains only one complex-valued parameter, which could be easily obtained via solving a cubic equation. Therefore, the proposed algorithm has low complexity. The proposed algorithm is compared with other C-JEVD methods through simulations.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 11th International Conference on Information Science and Technology (ICIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST52614.2021.9440597","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper, we propose a complex-valued joint eigenvalue decomposition(C-JEVD) algorithm based on LU de-composition and successive rotations. The proposed algorithm factorizes the matrix of eigenvectors into a lower-triangular matrix and an upper-triangular matrix, and update these two matrices using successive rotations. In each rotation, the elementary rotation matrix contains only one complex-valued parameter, which could be easily obtained via solving a cubic equation. Therefore, the proposed algorithm has low complexity. The proposed algorithm is compared with other C-JEVD methods through simulations.