An iterative algorithm is proposed for solving the complete eigenvalue problem of a regular, linear pencil A-λB of matrices A and B of band structure which under certain conditions preserves the band structure of matrices of the pencil. It is modification of the algorithm AB-1 based on applying nonorthogonal transformations. A detailed description of the algorithm is presented in application to the pencils with tridiagonal and pentadiagonal matrices.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
V. N. Kublanovskaya, “On an algorithm for solution of spectral problems of linear matrix pencils,” LOMI Preprint E-1-82, Leningrad (1982).
V. N. Kublanovskaya and T. V. Vashchenko, “On a version of the AB algorithm for solving the eigenvalue problem of a regular, linear pencil of matrices,” in: Prikl. Mat. i SAPR v Sudostroenii. Sb. Nuachnykh Trudov, Izd. LKM, Leningrad (1982), pp. 49–60.
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 139, pp. 41–50, 1984.
About this article
Cite this article
Vashchenko, T.V. Solution of an eigenvalue problem for pencils of band matrices. J Math Sci 36, 199–206 (1987). https://doi.org/10.1007/BF01091800
- Band Structure
- Eigenvalue Problem
- Iterative Algorithm
- Band Matrice
- Linear Pencil