Abstract
For an arbitrary polynomial pencil
of matrices Ai of dimensions m×n one presents an algorithm for the computation of the eigenvalues of the regular kernel of the pencil. The algorithm allows to construct a regular pencil having the same eigenvalues as the regular kernel of the initial pencil or (in the case of a dead end termination) allows to pass from the initial pencil to a pencil of smaller dimensions whose regular kernel has the same eigenvalues as the initial pencil. The problem is solved by reducing the obtained pencil to a linear one. For solving the problem in the case of a linear pencil one considers algorithms for pencils of full column rank as well as for completely singular pencils.
Similar content being viewed by others
Literature cited
V. N. Kublanovskaya, “On the spectral problem for polynomial matrix pencils,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.80, 83–97 (1978).
V. N. Kublanovskaya, “The AB-algorithm and its properties,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.,102, 42–60 (1980).
D. K. Faddeev, V. N. Kublanovskaya, and V. N. Faddeeva, “Linear algebraic systems with rectangular matrices,” in: Modern Numerical Methods, No. 1 (proc. Int. Summer School on Numerical Methods, Kiev, 1966), Moscow (1968), pp. 16–75.
V. N. Kublanovskaya and V. N. Simonova, “On certain modifications of the AB-algorithm,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.,111, 117–136 (1981).
V. N. Kublanovskaya, “On the analysis of singular matrix pencils,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.,70, 89–102 (1977).
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 111, pp. 109–116, 1981.
Rights and permissions
About this article
Cite this article
Kublanovskaya, V.N. Spectral problem for polynomial matrix pencils. 2. J Math Sci 24, 69–75 (1984). https://doi.org/10.1007/BF01230267
Issue Date:
DOI: https://doi.org/10.1007/BF01230267