Skip to main content
Log in

Construction of a fundamental series of solutions of a pencil of matrices

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

Abstract

Solution of spectral problems for a singular polynomial pencil of matrices D (λ) of degree s⩾1 and sizem×n is considered. Two algorithms for constructing polynomials solutions of pencils D (λ) are considered: the first is a modification of an algorithm proposed earlier by one of the authors for determining polynomial solutions of a linear pencil; the second algorithm is based on other ideas and consists of two steps. At the first step a finite sequence of auxiliary pencils is constructed for each of which a basis of polynomial solutions of degree zero is found. At the second step the basis so constructed are rearranged into polynomial solutions of the original polynomial pencil D(λ). Both algorithms make it possible to find solutions of the original pencil in order of increasing degrees. For constructing a fundamental series of solutions of the pencil D(λ) two new algorithms are proposed which work independently with either of the algorithms mentioned above for constructing polynomial solutions by rearranging them into linearly independent solutions of the pencil.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Literature cited

  1. F. R. Gantmakher, Theory of Matrices, Chelsea Publ.

  2. V. N. Kublanovkskaya, “On the analysis of singular pencils of matrices,” in: Numerical Methods and Questions of the Organization of Computations. 1. J. Sov. Math.,23, No. 1 (1983).

  3. P. van Dooren, “The computation of Kronecker's canonical form of a singular pencil,” Lin. Alg. Appl.,27, 103–141 (1979).

    Google Scholar 

  4. V. B. Khazanov, “On the solution of spectral problems for λ-matrices,” Author's Abstract of Candidate's Dissertation, Physicomathematical Sciences, Leningrad (1983).

    Google Scholar 

  5. B. Kägstrom, “RGSVD — An algorithm for computing the Kronecker structure and reducing subspaces of singular pencils,” Reprot Uminof-112.83 S-90187, Umea, Sweden (1983).

    Google Scholar 

  6. V. N. Kublanovskaya, “Construction of a canonical basis for matrices and pencils of matrices,” in: Numerical Methods and Questions of the Organization of Computations. 2. J. Sov. Math.,20, No. 2 (1982).

  7. V. N. Kublanovskaya, “On a means of computing a fundamental series of polynomial solutions and Jordan chains for a singular, linear pencil of matrices,” in: Numerical Methods and Questions of the Organization of Computations. 6. J. Sov. Math.,29, No. 6 (1985).

  8. D. K. Faddeev, V. N. Kublanovskaya, and V. N. Faddeeva, “Linear algebraic systems with rectangular matrices,” in: Modern Numerical Methods. Issue 1 (Materials of the International Summer School on Numerical Methods, Kiev, 1966), Moscow (1968), pp. 16–75.

  9. G. H. Golub and C. Reinsch, “Singular value decomposition and least squares solutions,” Numer. Math.,14, No. 5, 403–420 (1970).

    Google Scholar 

Download references

Authors

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 139, pp. 74–93, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kublanovskaya, V.N., Vashchenko, T.V. Construction of a fundamental series of solutions of a pencil of matrices. J Math Sci 36, 224–239 (1987). https://doi.org/10.1007/BF01091803

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01091803

Keywords

Navigation