Skip to main content

Perturbation Bounds for the Nonlinear Matrix Equation

  • Conference paper
Large-Scale Scientific Computing (LSSC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7116))

Included in the following conference series:

Abstract

In this paper we make a complete perturbation analysis of the nonlinear matrix equation , where A and B are square complex matrices, denotes the complex conjugate transpose of the matrix A and I is the identity matrix. We obtain local (first order) perturbation bounds and a non-local perturbation bound for the solution to the equation. The perturbation bounds allow to derive condition and accuracy estimates for the computed solution, when using a stable numerical algorithm to solve the equation.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Grebenikov, E.A., Ryabov, Y.A.: Constructive Methods for Analysis of Nonlinear Systems, Nauka, Moscow (1979) (in Russian)

    Google Scholar 

  2. Hasanov, V.I.: Notes on Two Perturbation Estimates of the Extreme Solutions to the Equations X ±A * X − 1 A = Q. Appl. Math. Comput. 216, 1355–1362 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Long, J.-H., Hu, X.-Y., Zhang, L.: On the Hermitian Positive Definite Solution of the Nonlinear Matrix Equation X + A  ∗  X − 1 A + B  ∗  X − 1 B = I. Bull. Braz. Math. Soc., New Series. Sociedade Brasileira de Matemática, vol. 39(3), pp. 371–386 (2008)

    Google Scholar 

  4. Konstantinov, M.M., Gu, D.W., Mehrmann, V., Petkov, P.H.: Perturbation Theory for Matrix Equations. North-Holland, Amsterdam (2003) ISBN 0-444-51315-9

    MATH  Google Scholar 

  5. Konstantinov, M.M., Petkov, P.H., Angelova, V.A., Popchev, I.P.: Sensitivity of a Complex Fractional–Affine Matrix Equation. In: Jub. Sci. Conf. Univ. Arch. Civil Eng. Geod., Sofia, vol. 8, pp. 495–504 (2002)

    Google Scholar 

  6. Konstantinov, M.M., Petkov, P.H.: The Method of Splitting Operators and Lyapunov Majorants in Perturbation Linear Algebra and Control. Numer. Func. Anal. Optim. 23, 529–572 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Popchev, I.P., Angelova, V.A.: On the Sensitivity of the Matrix Equations X ±A  ∗  X − 1 A = Q. Cybernetics and Information Technologies 10(4), 36–61 (2010)

    MathSciNet  Google Scholar 

  8. Yonchev, A.: Full Perturbation Analysis of the Discrete-Time LMI Based Bounded Output Energy Problem. In: Conf. of Automatics and Informatics, Sofia, vol. 1, pp. 5–8 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Popchev, I., Petkov, P., Konstantinov, M., Angelova, V. (2012). Perturbation Bounds for the Nonlinear Matrix Equation . In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2011. Lecture Notes in Computer Science, vol 7116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29843-1_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29843-1_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29842-4

  • Online ISBN: 978-3-642-29843-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics