Skip to main content

Fast Algorithms for Verifying Centrosymmetric Solutions of Sylvester Matrix Equations

  • Conference paper
  • First Online:
Bio-inspired Computing – Theories and Applications (BIC-TA 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 682))

  • 1062 Accesses

Abstract

Based on floating point operations, we study the accuracy of numerically computed centrosymmetric solutions in Sylvester matrix equations. Propose a fast algorithm which outputs the lower bound and upper bound of the exact centrosymmetric solution. Numerical experiments show the properties of the proposed algorithm.

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 EPUB and 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

References

  1. Essex, C., Davison, M., Schulzky, C.: Numerical monsters. ACM SIGSAM Bull. 34(4), 16–32 (2000)

    Article  MATH  Google Scholar 

  2. Datta, B.: Numerical Methods for Linear Control Systems. Elsevier Academic Press, Amsterdam (2004)

    Google Scholar 

  3. Antoulas, A.: Approximation of Large-Scale Dynamical Systems. Advances in Design and Control. SIAM, Philadelphia (2005)

    Book  MATH  Google Scholar 

  4. Sorensen, D.C., Antoulas, A.C.: The Sylvester equation and approximate balanced reduction. Linear Algebra Appl. 351, 671–700 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Frommer, A., Hashemi, B.: Verified error bounds for solutions of Sylvester matrix equations. Linear Algebra Appl. 436(2), 405–420 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  6. Miyajima, S.: Fast enclosure for solutions of Sylvester equations. Linear Algebra Appl. 439(4), 856–878 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  7. Seif, N.P., Hussein, S.A., Deif, A.S.: The interval Sylvester equation. Comput. 52(3), 233–244 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  8. Shashikhin, V.N.: Robust stabilization of linear interval systems. J. Appl. Math. Mech. 66(3), 393–400 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1994)

    MATH  Google Scholar 

  10. Meyer, C.D.: Matrix analysis and applied linear algebra. SIAM, Philadelphia (2000)

    Book  Google Scholar 

  11. Yamamoto, T.: Error bounds for approximate solutions of systems of equations. Jpn. J. Appl. Math. 1(1), 157–171 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  12. Sang, H., Li, Z., Cui, Y., Li, Q.: A verified algorithm for the centrosymmetric solution of Sylvester matrix equations. In: Gong, M., Pan, L., Song, T., Tang, K., Zhang, X. (eds.) BIC-TA 2015. CCIS, vol. 562, pp. 342–349. Springer, Heidelberg (2015). doi:10.1007/978-3-662-49014-3_31

    Chapter  Google Scholar 

Download references

Acknowledgments

This work is supported by Jilin Province Department of Education Science and Technology Research Project under Grants 2014213, 2015131 and 2015156.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Haifeng Sang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Li, Z., Sang, H., Zhao, Y. (2016). Fast Algorithms for Verifying Centrosymmetric Solutions of Sylvester Matrix Equations. In: Gong, M., Pan, L., Song, T., Zhang, G. (eds) Bio-inspired Computing – Theories and Applications. BIC-TA 2016. Communications in Computer and Information Science, vol 682. Springer, Singapore. https://doi.org/10.1007/978-981-10-3614-9_65

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3614-9_65

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3613-2

  • Online ISBN: 978-981-10-3614-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics