Abstract
The concept of a regularizing decomposition was introduced by R. Horn and V. Sergeichuk. It means the representation of a square matrix by a direct sum of Jordan blocks with zero on the principal diagonal and a nonsingular matrix. Such a representation is attained via congruence transformations and differs from the Jordan normal form. For the reasons explained in this paper, we prefer to speak of an SR decomposition (in other words, a singular-regular decomposition) of a matrix rather than a regularizing decomposition. Accordingly, algorithms providing this decomposition are called SR algorithms.We develop a rational algorithm that considerably simplifies the SR algorithms proposed by Horn and Sergeichuk.
Similar content being viewed by others
References
Horn, R.A. and Sergeichuk, V.V., A Regularization AlgorithmforMatrices of Bilinear and Sesquilinear Forms, Lin. Alg. Appl., 2006, vol. 412, iss. 2/3, pp. 380–395.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © Kh.D. Ikramov, 2018, published in Sibirskii Zhurnal Vychislitel’noi Matematiki, 2018, Vol. 21, No. 3, pp. 255–258.
Rights and permissions
About this article
Cite this article
Ikramov, K.D. On the Congruent Selection of Jordan Blocks from a Singular Square Matrix. Numer. Analys. Appl. 11, 204–207 (2018). https://doi.org/10.1134/S1995423918030023
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995423918030023