Algorithm for computing Kronecker basis

Abstract

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.

Journal

  • JSIAM Letters

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

    The Japan Society for Industrial and Applied Mathematics

References(2)*help

See more

Related Projects

See more

Details 詳細情報について

Report a problem

Back to top