Skip to main content
SpringerLink
Log in

An algorithm for computing the spectral structure of a singular linear matrix pencil

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

Abstract

An algorithm is proposed for computing the structure of the Kronecker canonical form for a singular linear matrix pencil.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature cited

  1. F. R. Gantmakher, Matrix Theory [in Russian], Moscow (1953).

  2. J. H. Wilkinson, “Linear differential equations and Kronecker's canonical form,” in: Recent Advances in Numerical Analysis, C. de Boor and G. Golub (eds.), Academic Press, New York (1978), pp. 231–265.

    Google Scholar 

  3. P. Van Dooren, “The generalized eigenstructure problem in linear system theory,” IEEE Trans. Autom. Control,AC-26, No. 1 (1981).

  4. R. F. Sincovec, B. Dembart, M. A. Epton, A. M. Erisman, J. W. Manhe, and E. L. Yip, Solvability of Large Scale Descriptor Systems, Final report DOE contract ET-78-C-01-2876, Boeing Computer Service Co., Seattle, Wash. (1979).

    Google Scholar 

  5. V. N. Kublanovskaya, “Analysis of singular matrix pencils,” in: Numerical Methods and Topics of Organization of Computations, J. Sov. Math.,23, No. 1 (1983).

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

  7. B. Kagström, “On computing the Kronecker canonical form of regular A−λα pencils,” in: Matrix Pencils, Lecture Notes Math.,973 (1983).

  8. P. Van Dooren, “The computation of Kronecker's canonical form of a singular pencil,” Linear Algebra Appl.,27, 103–141 (1979).

    Article  MATH  MathSciNet  Google Scholar 

  9. J. H. Wilkinson, “Kronecker's canonical form and the Qz algorithm,” Linear Algebra Appl.,28, 285–303 (1979).

    Article  MATH  MathSciNet  Google Scholar 

  10. B. Kagström, “RGSVD — an algorithm for computing the Kronecker structure and reducing the subspace of singular pencils,” Report UMINE-11283, Univ. of Umea, Inst. of Information Processing.

  11. C. C. Paige and M. A. Saunders, “Towards a generalized singular value decomposition,” SIAM J. Numer. Anal.,18, 398–405 (1981).

    Article  MATH  MathSciNet  Google Scholar 

  12. C. Davis and W. M. Kahan, “The rotation of eigenvectors by a perturbation, III,” SIAM J. Numer. Anal.,7, 1–46 (1970).

    Article  MATH  MathSciNet  Google Scholar 

  13. G. W. Stewart, “Error and perturbation bounds for subspace associated with certain eigenvalue problems,” SIAM Rev.,15, 752–764 (1973).

    Article  Google Scholar 

  14. G. W. Stewart, “A method for computing the generalized singular value decomposition,” Lect. Notes Math.,973, 207–220 (1983).

    MATH  Google Scholar 

  15. G. W. Stewart, “Computing the CS decompositions of a partitioned orthonormal matrix,” Numer. Math., 297–306 (1982).

  16. P. Van Dooren, “Reducing subspaces: definitions, properties, and algorithms,” Lect. Notes Math.,973, 58–73 (1983).

    Article  MATH  Google Scholar 

Download references

Authors
  1. V. N. Kublanovskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Institute im. V. A. Steklova AN SSSR, Vol. 159, pp. 23–32, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kublanovskaya, V.N. An algorithm for computing the spectral structure of a singular linear matrix pencil. J Math Sci 47, 2834–2842 (1989). https://doi.org/10.1007/BF01305211

Download citation

  • Issue Date:

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

Keywords

Search

Navigation