-
- Kudo Kenji
- Graduate School of Science and Engineering, Saitama University
-
- Kakinuma Yoshiaki
- NDD Corporation
-
- Hiraoka Kazuyuki
- General Education, Wakayama National College of Technology
-
- Hashiguchi Hiroki
- Graduate School of Science and Engineering, Saitama University
-
- Kuwajima Yutaka
- Graduate School of Science and Engineering, Saitama University
-
- Shigehara Takaomi
- Graduate School of Science and Engineering, Saitama University
説明
We propose a novel algorithm to compute a Jordan basis (JB) for an arbitrarily given square matrix. The algorithm is based on the fact that a JB for a linear transformation $f$ is obtained by extending a JB for the restriction of $f$ to its range $R(f)$. The main ingredient of the algorithm is singular value decomposition, and that ensures backward-stability of the algorithm. To enhance the practical utility, we also introduce an automatic mechanism into the algorithm such that it outputs all possible Jordan structures close to the exact one of the input matrix.
収録刊行物
-
- JSIAM Letters
-
JSIAM Letters 2 (0), 119-122, 2010
一般社団法人 日本応用数理学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282680275938816
-
- NII論文ID
- 130000433720
-
- ISSN
- 18830617
- 18830609
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- Crossref
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可