Decomplexification of eigenvalue and coneigenvalue problems
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXI, Tome 359 (2008), pp. 36-41
Citer cet article
Voir la notice du chapitre de livre provenant de la source Math-Net.Ru
The decomplexification technique proposed for coneigenvalue problems in a recent paper by T. Jiang et al. is discussed and compared with the classical decomplexification technique for eigenvalue problems. Simple explanations of both techniques are presented, and their properties concerning special matrix classes are indicated. Bibl. – 4 titles.
[1] Kh. D. Ikramov, Zadachnik po lineinoi algebre, Lan, SPb., 2006
[2] T. Jiang, X. Cheng, L. Chen, “An algebraic relation between consimilarity and similarity of complex matrices and its applications”, J. Phys. A: Math. Gen., 39 (2006), 9215–9222 | DOI | MR | Zbl
[3] Kh. D. Ikramov, “O psevdosobstvennykh znacheniyakh i singulyarnykh chislakh kompleksnoi kvadratnoi matritsy”, Zap. nauchn. semin. POMI, 334, POMI, SPb., 2006, 111–120 | MR | Zbl
[4] R. Khorn, Ch. Dzhonson, Matrichnyi analiz, Mir, M., 1989 | MR | Zbl