On a finite algorithm for calculating neutral subspaces of skew-symmetric matrices

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