Algorithm for computing Kronecker basis

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• The Japan Society for Industrial and Applied Mathematicsの論文

著者

• Hashiguchi Hiroki

  Graduate School Of Science And Engineering Saitama University

• Kakinuma Yoshiaki

  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

• Hiraoka Kazuyuki

  Graduate School of Science and Engineering, Saitama University

関連論文

• Algorithm for computing Jordan basis
• NUMERICAL COMPUTATION ON DISTRIBUTIONS OF THE LARGEST AND THE SMALLEST LATENT ROOTS OF THE WISHART MATRIX
• Algorithm for solving Jordan problem of block Schur form
• Proposal and efficient implementation of multiple division divide-and-conquer algorithm for SVD
• Algorithm for computing Kronecker basis

スポンサーリンク