Skip to main content

Reducing subspaces: Definitions, properties and algorithms

Section A.1 Of General (A-λB)-Pencils

Part of the Lecture Notes in Mathematics book series (LNM,volume 973)

Abstract

In this paper we introduce the new concept of reducing subspaces of a singular pencil, which extends the notion of deflating subspaces to the singular case. We briefly discuss uniqueness of such subspaces and we give an algorithm for computing them. The algorithm also gives the Kronecker canonical form of the singular pencil.

Keywords

  • Regular Part
  • Full Column Rank
  • Singular Case
  • Unique Pair
  • Minimal Index

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BOLEY D., Computing the controllability/observability decomposition of a linear time invariant dynamic system, a numerical approach, Ph. D. Thesis, Stanford University, 1981.

    Google Scholar 

  2. EMAMI-NAEINI A., VAN DOOREN P., Computation of zeros of linear multivariable systems, to appear Automatica, 1982.

    Google Scholar 

  3. FORNEY, G. D. Jr., Minimal bases of rational vector spaces with applications to multivariable linear systems, SIAM J. Contr., Vol. 13, pp. 493–520, 1975.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. GANTMACHER F. R., Theory of matrices I & II, Chelsea, New York, 1959.

    MATH  Google Scholar 

  5. MOLER C., STEWART G., An algorithm for the generalized matrix eigenvalue problem, SIAM J. Num. Anal., Vol. 10, pp. 241–256, 1973.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. PAIGE C., Properties of numerical algorithms related to computing controllability, IEEE Trans. Aut. Contr., Vol. AC-26, pp. 130–138.

    Google Scholar 

  7. STEWART G., Error and perturbation bounds for subspaces associated with certain eigenvalue problems, SIAM Rev., Vol. 15, pp. 727–764, 1973.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. STEWART G., On the sensitivity of the eigenvalue problem Ax=λBx, SIAM Num. Anal. Vol. 9, pp. 669–686, 1972.

    CrossRef  MathSciNet  Google Scholar 

  9. VAN DOOREN P., The computation of Kronecker's canonical form of a singular pencil, Lin. Alg. & Appl., Vol. 27, pp. 103–141, 1979.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. VAN DOOREN P., The generalized eigenstructure problem in linear system theory, IEEE Trans. Aut. Contr., Vol. AC-26, pp. 111–129, 1981.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. VAN DOOREN P., A generalized eigenvalue approach for solving Riccati equations, SIAM Sci. St. Comp., Vol. 2, pp. 121–135, 1981.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. WILKINSON J., Linear differential equations and Kronecker's canonical form, Recent Advances in Numerical Analysis, Ed. C. de Boor, G. Golub, Academic Press, New York, 1978.

    Google Scholar 

  13. WILKINSON J., Kronecker's canonical form and the QZ algorithm, Lin. Alg. & Appl., Vol. 28, pp. 285–303, 1979.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. WONHAM W., Linear multivariable theory. A geometric approach, (2nd Ed.) Springer, New York, 1979.

    CrossRef  MATH  Google Scholar 

  15. KUBLANOVSKAYA V., AB algorithm and its modifications for the spectral problem of linear pencils of matrices, LOMI-preprint E-10-81, USSR Academy of Sciences, 1981.

    Google Scholar 

  16. KUBLANOVSKAYA V., On an algorithm for the solution of spectral problems of linear matrix pencils, LOMI-preprint E-1-82, USSR Academy of Sciences, 1982.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Van Dooren, P. (1983). Reducing subspaces: Definitions, properties and algorithms. In: Kågström, B., Ruhe, A. (eds) Matrix Pencils. Lecture Notes in Mathematics, vol 973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062094

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11983-8

  • Online ISBN: 978-3-540-39447-1

  • eBook Packages: Springer Book Archive