Algorithm for solving Jordan problem of block Schur form
スポンサーリンク
概要
- 論文の詳細を見る
We propose a numerical algorithm to compute a Jordan basis as well as the Jordan canonical form for matrices of block Schur form (BSF). Combining it with the standard preprocessing which reduces a square matrix to BSF, we establish an efficient numerical algorithm only with unitary processes to reveal a full detail of the Jordan structure for an arbitrarily given square matrix.
著者
-
Matsumoto Takuya
Graduate School Of Environmental Studies Nagoya University
-
Kuwajima Yutaka
Graduate School of Science and Engineering, Saitama University
-
Shigehara Takaomi
Graduate School of Science and Engineering, Saitama University
-
Kudo Kenji
Infoscience Corporation
関連論文
- Effects of Phase II Cardiac Rehabilitation on Job Stress and Health-Related Quality of Life After Return to Work in Middle-Aged Patients With Acute Myocardial Infarction
- Algorithm for computing Jordan basis
- The Structure of the Dust Layer over the Taklimakan Desert during the Dust Storm in April 2002 as Observed Using a Depolarization Lidar
- Algorithm for solving Jordan problem of block Schur form
- Prasinoxanthin is absent in the green-colored dinoflagellate Lepidodinium chlorophorum strain NIES-1868 : pigment composition and 18S rRNA phylogeny
- Proposal and efficient implementation of multiple division divide-and-conquer algorithm for SVD
- Algorithm for computing Kronecker basis