Algorithm for computing Kronecker basis

DOI Web Site 参考文献2件

説明

To make clear geometrical structure of an arbitrarily given pencil, it is crucial to understand Kronecker structure of the pencil. For this purpose, GUPTRI is the only practical numerical algorithm at present. However, although GUPTRI determines the Kronecker canonical form (KCF), it does not give any direct information on Kronecker bases (KB). In this paper, we propose a numerical algorithm which gives a full of information on Kronecker structure including KB as well as KCF. The main ingredient of the algorithm is singular value decompositions, which guarantee the backward stability of the algorithm.

収録刊行物

  • JSIAM Letters

    JSIAM Letters 1 (0), 60-63, 2009

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

参考文献 (2)*注記

もっと見る

関連プロジェクト

もっと見る

キーワード

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

問題の指摘

ページトップへ