Decomplexification of eigenvalue and coneigenvalue problems
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXI, Tome 359 (2008), pp. 36-41
Voir la notice de l'article 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.
@article{ZNSL_2008_359_a3,
author = {Kh. D. Ikramov},
title = {Decomplexification of eigenvalue and coneigenvalue problems},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {36--41},
publisher = {mathdoc},
volume = {359},
year = {2008},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_2008_359_a3/}
}
Kh. D. Ikramov. Decomplexification of eigenvalue and coneigenvalue problems. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXI, Tome 359 (2008), pp. 36-41. http://geodesic.mathdoc.fr/item/ZNSL_2008_359_a3/