Document Type

Article

Publication Date

1-1994

Abstract

This paper addresses some numerical issues that arise in computing a basis for the stable invariant subspace of a Hamiltonian matrix. Such a basis is required in solving the algebraic Riccati equation using the well-known method due to Laub. Two algorithms based on certain properties of Hamiltonian matrices are proposed as viable alternatives to the conventional approach.

Comments

Copyright © 1994, Society for Industrial and Applied Mathematics.

DOI

10.1137/S0895479889171352

Find in your library

Off-Campus WSU Users


Share

COinS