On congruent selection of the Jordan blocks from a singular square matrix
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 21 (2018) no. 3, pp. 255-258
Cet article a éte moissonné depuis la source Math-Net.Ru
The concept of a regularizing decomposition was introduced by R. Horn and V. Sergeichuk. This means the representation of a square matrix by a direct sum of the Jordan blocks with zero on the principal diagonal and a non-singular matrix. Such a representation is attained via congruent transformations and differs from the Jordan normal form. For the reasons explained in this paper, we prefer to speak about the SN-decomposition of a matrix (in other words, singular-non-singular decomposition) rather than the regularizing decomposition. Accordingly, the algorithms providing the former decomposition are called SN-algorithms. We propose a rational algorithm that considerably simplifies the SN-algorithms proposed by Horn and Sergeichuk.
@article{SJVM_2018_21_3_a1,
author = {Kh. D. Ikramov},
title = {On congruent selection of the {Jordan} blocks from a~singular square matrix},
journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
pages = {255--258},
year = {2018},
volume = {21},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/SJVM_2018_21_3_a1/}
}
Kh. D. Ikramov. On congruent selection of the Jordan blocks from a singular square matrix. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 21 (2018) no. 3, pp. 255-258. http://geodesic.mathdoc.fr/item/SJVM_2018_21_3_a1/