Skip to main content
Log in

Finite algorithms for verifying unitary similarity and unitary congruence for a pair of complex matrices

  • Mathematics
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

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.

References

  1. R. A. Horn and C. R. Johnson, Matrix Analysis (Cambridge Univ. Press, Cambridge, 1985; Mir, Moscow, 1989).

    MATH  Google Scholar 

  2. C. Pearcy, Pacific J. Math. 12, 1405–1416 (1962).

    MathSciNet  MATH  Google Scholar 

  3. C. Pappacena, J. Algebra 197, 535–545 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  4. Yu. A. Al’pin and Kh. D. Ikramov, Zap. Nauchn. Semin. POMI 323, 5–14 (2005).

    MATH  Google Scholar 

  5. Y. P. Hong and R. A. Horn, Linear Multilinear Algebra 25, 105–119 (1989).

    Article  MathSciNet  MATH  Google Scholar 

  6. S. Friedland, Adv. Math. 50, 189–265 (1983).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kh. D. Ikramov.

Additional information

Published in Russian in Doklady Akademii Nauk, 2011, Vol. 437, No. 2, pp. 151–153.

The article was translated by the author.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ikramov, K.D. Finite algorithms for verifying unitary similarity and unitary congruence for a pair of complex matrices. Dokl. Math. 83, 158–160 (2011). https://doi.org/10.1134/S1064562411020086

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064562411020086

Keywords

Navigation