On a Finite Algorithm for Computing Neutral Subspaces of Skew-Symmetric Matrices

Abstract

Let K be a nonsingular skew-symmetric matrix of even order n = 2m. For such a matrix, the paper proposes a finite algorithm for computing an m-dimensional neutral subspace, which uses arithmetic operations and quadratic radicals only. The necessity of computing neutral subspaces originates in the problem of solving quadratic matrix equations.