Abstract
A new numerical method is proposed for determining the real parts of the eigenvalues of ill-conditioned matrices of arbitrary size. Convergence of the numerical algorithm is proved.
Similar content being viewed by others
Literature Cited
N. S. Bakhvalov, Numerical Methods [in Russian], Vol. 1, Nauka, Moscow (1975).
V. V. Khilenko, “Convergence of the order reduction method for solving stiff systems of linear differential equations," Dokl. Akad. Nauk UkrSSR, Ser. A, No. 8, 76–79 (1987).
V. V. Khilenko, “Analysis and computation of mathematical models of automatic control systems and computer-aided production-control systems,” Unpublished Manuscript, TsNII “Élektronika” Ser. AT, No. 19, Moscow (1985).
Yu. V. Rakitskii, S. M. Ustinov, and I. G. Chernoutskii, Numerical Methods for Stiff Systems [in Russian], Nauka, Moscow (1979).
A. B. Vasil'ev and V. F. Butuzov, Asymptotic Expansions of Solutions of Singularly Perturbed Equations [in Russian], Nauka, Moscow (1973).
M. V. Fedoryuk, Ordinary Differential Equations [in Russian], Nauka, Moscow (1980).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 3–9, November–December, 1991.
Rights and permissions
About this article
Cite this article
Grishchenko, A.Z., Khilenko, V.V. Determining the number of fast and slow components in decomposition of arbitrarily large linear dynamical models. Cybern Syst Anal 27, 795–801 (1991). https://doi.org/10.1007/BF01246510
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01246510