On a Finite Algorithm for Computing Neutral Subspaces of Skew-Symmetric Matrices
- Autores: Ikramov K.1
-
Afiliações:
- Lomonosov Moscow State University
- Edição: Volume 240, Nº 6 (2019)
- Páginas: 769-771
- Seção: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/242834
- DOI: https://doi.org/10.1007/s10958-019-04394-8
- ID: 242834
Citar
Resumo
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.
Sobre autores
Kh. Ikramov
Lomonosov Moscow State University
Autor responsável pela correspondência
Email: ikramov@cs.msu.su
Rússia, Moscow