Email this article On a Finite Algorithm for Computing Neutral Subspaces of Skew-Symmetric Matrices
- Authors: Ikramov K.D.1
-
Affiliations:
- Lomonosov Moscow State University
- Issue: Vol 240, No 6 (2019)
- Pages: 769-771
- Section: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/242834
- DOI: https://doi.org/10.1007/s10958-019-04394-8
- ID: 242834
Cite item
Open Access
Access granted
Subscription Access
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.
About the authors
Kh. D. Ikramov
Lomonosov Moscow State University
Author for correspondence.
Email: ikramov@cs.msu.su
Russian Federation, Moscow
Supplementary files
