Skip to main content
Log in

Square Roots of Hermitian Matrices and a Rational Algorithm for Checking Their Congruence

  • Published:
Moscow University Computational Mathematics and Cybernetics Aims and scope Submit manuscript

Abstract

A finite computational process using only arithmetical operations is called a rational algorithm. Presently, there is no known rational algorithm for checking congruence between arbitrary complex matrices A and B. The situation may be different if A and B belong to a special matrix class. For instance, there exist rational algorithms for the cases where both matrices are Hermitian, unitary, or accretive. In this publication, we propose a rational algorithm for checking congruence between matrices A and B that are square roots of Hermitian matrices.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. A. Gauger and C. I. Byrnes, “Characteristics free, improved decidability criteria for the similarity problem,” Lin. Multil. Algebra 5, 153–158 (1977).

    Article  MathSciNet  MATH  Google Scholar 

  2. J. D. Dixon, “An isomorphisms criterion for modules over a principal ideal domain,” Lin. Multilin. Algebra 8, 69–72 (1979).

    Article  MathSciNet  MATH  Google Scholar 

  3. Kh. D. Ikramov, “On finite spectral procedures in linear algebra,” Programmirovanie, No. 1, 56–69 (1994).

  4. C. R. DePrima and C. R. Johnson, “The range of A −1 A* in GL(n, C),” Lin. Algebra Appl. 9, 209–222 (1974).

    Article  MATH  Google Scholar 

  5. C. R. Johnson and S. Furtado, “A generalization of Sylvester’s law of inertia,” Lin. Algebra Appl. 338, 287–290 (2001).

    Article  MathSciNet  MATH  Google Scholar 

  6. Kh. D. Ikramov, “Checking the congruence between accretive matrices,” Math. Notes 101 (6), 969–973 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  7. R. A. Horn and Ch. R. Johnson, Matrix Analysis, 2nd ed. (Cambridge Univ. Press, Cambridge, 2013).

    MATH  Google Scholar 

  8. R. A. Horn and V. V. Sergeichuk, “Canonical forms for complex matrices congruence and *congruence,” Lin. Algebra Appl. 416, 1010–1032 (2006).

    Article  MATH  Google Scholar 

  9. R. A. Horn and V. V. Sergeichuk, “Canonical forms for unitary congruence and *congruence,” Lin. Multilin. Algebra 57, 777–815 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  10. Kh. D. Ikramov, Numerical Solution of Matrix Equations (Nauka, Moscow, 1984) [in Russian].

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kh. D. Ikramov.

Additional information

Russian Text © The Author(s), 2019, published in Vestnik Moskovskogo Universiteta, Seriya 15: Vychislitel’naya Matematika i Kibernetika, 2019, No. 3, pp. 11–16.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ikramov, K.D. Square Roots of Hermitian Matrices and a Rational Algorithm for Checking Their Congruence. MoscowUniv.Comput.Math.Cybern. 43, 95–100 (2019). https://doi.org/10.3103/S0278641919030026

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0278641919030026

Keywords

Navigation