A finite splitting algorithm for a complex $J$-symmetric pencil
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 32 (1992) no. 7, pp. 1130-1132
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Sagitov M. S., “Konechnyi algoritm rasschepleniya $J$-simmetrichnoi obobschennoi problemy sobstvennykh znachenii”, Zh. vychisl. matem. i matem. fiz., 30:12 (1990), 1765–1774 | MR
[2] Ikramov X. D., “O matritsakh s dvoinym spektrom i obobschennoi probleme sobstvennykh znachenii $Ax=\lambda Bx$ s kososimmetrichnymi $A$ i $B$”, Chisl. analiz: metody, algoritmy, programmy, Izd-vo MGU, M., 1991, 49–57 | Zbl
[3] Van Loan Ch., “A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix”, Linear Algebra and its Appls., 61 (1984), 233–251 | DOI | MR | Zbl