Algorithm for computing Jordan basis

説明

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

    一般社団法人 日本応用数理学会

被引用文献 (1)*注記

もっと見る

参考文献 (9)*注記

もっと見る

関連プロジェクト

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ