Abstract
Algorithms of determining maximum (in modulus) complex-conjugate eigenvalues are considered as applied to finding eigenvalues of high-dimension matrices according to the Khilenko method. An advantage of the algorithms is that the amount of calculation does not increase exponentially with the dimension of matrices.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. V. Khilenko, Methods of Systems Analysis in the Analysis of Adaptive Systems of Communication and Control [in Russian], Interlink, Kiev (2003).
V. P. Vinnitskii and V. V. Khilenko, Methods of Systems Analysis and Computer-Aided Design of Telecommunication Networks [in Russian], Interlink, Kiev (2002).
V. V. Khilenko, “Convergence of the dimension-reduction method in solving stiff systems of linear differential equations,” DAN USSR, No. 8, 76–79 (1987).
M. V. Fedoryuk, Ordinary Differential Equations [in Russian], Nauka, Moscow (1980).
A. Z. Grishchenko and V. V. Khilenko, The Dimension-Reduction Method and Analysis of Dynamic Systems [in Russian], UMK VO, Kiev (1988).
V. I. Krylov, Computational Methods [in Russian], Vol. 1, Nauka, Moscow (1977).
V. I. Krylov, Acceleration of Convergence [in Russian], Nauka i Tekhnika, Minsk (1988).
A. Angot, Compléments de Mathematiques. A l’usage des ingénieurs de l’élektrotechnique et des télécommunications, Paris (1957).
Author information
Authors and Affiliations
Additional information
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 104–110, March–April 2006.
Rights and permissions
About this article
Cite this article
Titarenko, Y.I. Finding maximum (in modulus) complex-conjugate eigenvalues of arbitrarily high dimension. Cybern Syst Anal 42, 248–253 (2006). https://doi.org/10.1007/s10559-006-0060-0
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10559-006-0060-0