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