Skip to main content

Computation of Joint Spectral Radius for Network Model Associated with Rank-One Matrix Set

  • Conference paper
Book cover Neural Information Processing (ICONIP 2012)

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

Included in the following conference series:

Abstract

In the paper, we prove that any finite set of rank-one matrices has the finiteness property by making use of (invariant) extremal norm. An explicit formula for the computation of joint/generalized spectral radius of such type of matrix sets is derived. Several numerical examples from current literature are provided to illustrate our theoretical conclusion.

This work was supported by NSF 1021203 of the United States.

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. Berger, M.A., Wang, Y.: Bounded semigroups of matrices. Linear Algebra Appl. 166, 21–27 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Blondel, V.D., Nesterov, Y.: Computationally efficient approximations of the joint spectral radius. SIAM J. Matrix Anal. Appl. 27(1), 256–272 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Blondel, V.D., Nesterov, Y., Theys, J.: On the accuracy of the ellipsoid norm approximation of the joint spectral radius. Linear Algebra Appl. 394, 91–107 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Blondel, V.D., Tsitsiklis, J.N.: The boundedness of all products of a pair of matrices is undecidable. Systems Control Lett. 41(2), 135–140 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bröker, M., Zhou, X.: Characterization of continuous, four-coefficient scaling functions via matrix spectral radius. SIAM J. Matrix Anal. Appl. 22(1), 242–257 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cicone, A., Guglielmi, N., Serra-Capizzano, S., Zennaro, M.: Finiteness property of pairs of 2×2 sign-matrices via real extremal polytope norms. Linear Algebra Appl. 432(2-3), 796–816 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dai, X., Huang, Y., Xiao, M.: Almost sure stability of discrete-time switched linear systems: A topological point of view. SIAM J. Control Optim. 47(4), 2137–2156 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dai, X., Huang, Y., Xiao, M.: Criteria of stability for continuous-time switched systems by using liao-type exponents. SIAM J. Control Optim. 48(5), 3271–3296 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. Daubechies, I., Lagarias, J.C.: Sets of matrices all infinite products of which converge. Linear Algebra Appl. 161, 227–263 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  10. Daubechies, I., Lagarias, J.C.: Two-scale difference equations. II. Local regularity, infinite products of matrices and fractals. SIAM J. Math. Anal. 23(4), 1031–1079 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  11. Daubechies, I., Lagarias, J.C.: Corrigendum/addendum to: “Sets of matrices all infinite products of which converge”. Linear Algebra Appl. 161, 227–263 (1992); Linear Algebra Appl. 327(1-3), 69–83 (2001)

    Google Scholar 

  12. Elsner, L.: The generalized spectral-radius theorem: An analytic-geometric proof. Linear Algebra Appl. 220, 151–159 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gripenberg, G.: Computing the joint spectral radius. Linear Algebra Appl. 234, 43–60 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  14. Guglielmi, N., Wirth, F., Zennaro, M.: Complex polytope extremality results for families of matrices. SIAM J. Matrix Anal. Appl. 27, 721–743 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  15. Guglielmi, N., Zennaro, M.: Finding extremal complex polytope norms for families of real matrices. SIAM J. Matrix Anal. Appl. 31, 602–620 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Guglielmi, N., Zennaro, M.: An algorithm for finding extremal polytope norms of matrix families. Linear Algebra Appl. 428(10), 2265–2282 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  17. Gurvits, L.: Stability of discrete linear inclusion. Linear Algebra Appl. 231, 47–85 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  18. Jungers, R.M.: The joint spectral radius: theory and applications. Springer (2009)

    Google Scholar 

  19. Kozyakin, V.: Iterative building of barabanov norms and computation of the joint spectral radius for matrix sets. Discrete and Continuous Dynamical Systems - Series B 14(1), 143–158 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  20. Lagarias, J.C., Wang, Y.: The finiteness conjecture for the generalized spectral radius of a set of matrices. Linear Algebra Appl. 214, 17–42 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  21. Maesumi, M.: An efficient lower bound for the generalized spectral radius of a set of matrices. Linear Algebra Appl. 240, 1–7 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  22. Maesumi, M.: Optimal norms and the computation of joint spectral radius of matrices. Linear Algebra Appl. 428(10), 2324–2338 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  23. Parrilo, P.A., Jadbabaie, A.: Approximation of the joint spectral radius using sum of squares. Linear Algebra and its Applications 428(10), 2385–2402 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  24. Protasov, V.Y.: The joint spectral radius and invariant sets of linear operators. Fundam. Prikl. Mat. 2(1), 205–231 (1996)

    MathSciNet  MATH  Google Scholar 

  25. Protasov, V.Y.: The geometric approach for computing the joint spectral radius. In: Proceedings of the 44th IEEE Conference on Decision and Control and European Control Conference CDC-ECC 2005, pp. 3001–3006. IEEE Control Systems Society, Piscataway (2005)

    Google Scholar 

  26. Protasov, V.Y.: Fractal curves and wavelets. Izv. Ross. Akad. Nauk. Ser. Mat. 70(5), 123–162 (2006)

    MathSciNet  Google Scholar 

  27. Protasov, V.Y., Jungers, R.M., Blondel, V.D.: Joint spectral characteristics of matrices: A conic programming approach. SIAM J. Matrix Anal. Appl. 31(4), 2146–2162 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  28. Rota, G.C., Strang, G.: A note on the joint spectral radius. Nederl. Akad. Wetensch. Proc. Ser. A 63 = Indag. Math. 22, 379–381 (1960)

    MathSciNet  Google Scholar 

  29. Shorten, R., Wirth, F., Mason, O., Wulff, K., King, C.: Stability criteria for switched and hybrid systems. SIAM Rev. 49(4), 545–592 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  30. Wirth, F.: The generalized spectral radius and extremal norms. Linear Algebra Appl. 342(1-3), 17–40 (2002)

    Article  MathSciNet  MATH  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

Liu, J., Xiao, M. (2012). Computation of Joint Spectral Radius for Network Model Associated with Rank-One Matrix Set. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds) Neural Information Processing. ICONIP 2012. Lecture Notes in Computer Science, vol 7665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34487-9_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34487-9_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34486-2

  • Online ISBN: 978-3-642-34487-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics