On a Finite Algorithm for Computing Neutral Subspaces of Skew-Symmetric Matrices
- Авторы: Ikramov K.1
-
Учреждения:
- Lomonosov Moscow State University
- Выпуск: Том 240, № 6 (2019)
- Страницы: 769-771
- Раздел: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/242834
- DOI: https://doi.org/10.1007/s10958-019-04394-8
- ID: 242834
Цитировать
Аннотация
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.
Об авторах
Kh. Ikramov
Lomonosov Moscow State University
Автор, ответственный за переписку.
Email: ikramov@cs.msu.su
Россия, Moscow