A Hybrid Approach to the Non-orthogonal Joint Diagonalization Problem(Application)
-
- Hirota Yusuke
- Graduate School of System Informatics, Kobe University
-
- Yamamoto Yusaku
- Graduate School of System Informatics, Kobe University:JST, CREST
-
- Zhang Shao-Liang
- Graduate School of Engineering, Nagoya University
Bibliographic Information
- Other Title
-
- 非直交同時対角化アルゴリズムのハイブリッド解法(応用)
- 非直交同時対角化アルゴリズムのハイブリッド解法
- ヒチョッコウ ドウジ タイ カクカ アルゴリズム ノ ハイブリッドカイホウ
Search this article
Description
The problem to find a congruent transformation to make more than one given matrices as diagonal as possible is called the non-orthogonal joint diagonalization problem. While various iterative algorithms have been proposed for the problem, they take long time for large scale problems. It is therefore important to accelerate these algorithms. In this study, we propose a hybrid algorithm that combines two conventional algorithms to reduce the iteration number. Numerical experiments show that the iteration number of the proposed algorithm is 50% smaller than that of the conventional one in the best case.
Journal
-
- Transactions of the Japan Society for Industrial and Applied Mathematics
-
Transactions of the Japan Society for Industrial and Applied Mathematics 22 (2), 63-79, 2012
The Japan Society for Industrial and Applied Mathematics
- Tweet
Details 詳細情報について
-
- CRID
- 1390282680744007168
-
- NII Article ID
- 110009477200
- 10031083224
-
- NII Book ID
- AN10367166
-
- ISSN
- 09172246
- 24240982
-
- NDL BIB ID
- 023839429
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- NDL
- CiNii Articles
- KAKEN
-
- Abstract License Flag
- Disallowed