Abstract
One presents the ALGOL procedures which implement the algorithm for the determination of the group of smallest (greatest) eigenvalues and their corresponding eigenvectors for a matrix pencil
where A and B are real square matrices of simple structure. From the initial pencil one constructs a matrix C, whose eigenvalues are taken as the initial approximations to the eigenvalues from the group of the smallest (greatest) eigenvalues of the pencil. The refinement of the eigen-values is performed on the basis of the theory of perturbations. Then one determines the eigen-vectors and one computes the infinite norm of the residual. One gives ALGOL programs and test examples.
Similar content being viewed by others
Literature cited
V. N. Kublanovskaya, “The eigenvalue problem for a regular linear pencil of matrices, close to singular ones,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.,90, 63–82 (1979).
V. N. Kublanovskaya and L. T. Savinova, “On the solution of matrix eigenvalue problems,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.,70, 124–139 (1977).
F. L. Bauer, “Elimination with weighted row combinations for solving linear equations and least square problems,” Numer. Math.,7, No. 4, 338–352 (1965).
R. S. Martin, G. Peters, and J. H. WiLkinson, “Iterative refinement of the solution of a positive-definite system of equations,” Numer. Math.,8, No. 3, 203–216 (1966).
L. T. Savinova, “The computation of small eigenvalues of matrices,” Zap, Nauchn. Sem. Leningr. Otd. Mat. Inst.,80, 167–180 (1978).
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 102, pp. 111–122, 1980.
Rights and permissions
About this article
Cite this article
Savinova, L.T. Solution of the partial eigenvalue problem for a regular matrix pencilD(λ) =A − λB . J Math Sci 22, 1231–1239 (1983). https://doi.org/10.1007/BF01460275
Issue Date:
DOI: https://doi.org/10.1007/BF01460275