Joint spectral characteristics of matrices: A conic programming approach

SIAM Journal on Matrix Analysis and Applications

Volumn 31, Issue 4, 2009, Pages 2146-2162

  Protasov, Vladimir Y ^a   Jungers, Raphaël M ^b   Blondel, Vincent D ^b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Conic programming; Convex optimization; Euler's binary function; Joint spectral radius; Joint spectral subradius; Overlap free words; Spectral radius

Indexed keywords

BINARY FUNCTIONS; CONIC PROGRAMMING; JOINT SPECTRAL RADIUS; JOINT SPECTRAL SUBRADIUS; OVERLAP-FREE WORDS; SPECTRAL RADII;

CONVEX OPTIMIZATION; NUMBER THEORY; OPTIMIZATION;

MATRIX ALGEBRA;

EID: 77956014280     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/090759896     Document Type: Article

References (41)

1. V. M. Alexeev, E. M. Galeev, and V. M. Tikhomirov, Book of Problems in Optimization, Nauka, Moscow, Russia, 1984.
2. T. Ando and M.-H. Shih, Simultaneous contractibility, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 487-498.
3. N. Barabanov, Lyapunov indicators of discrete inclusions I-III, Autom. Remote Control, 49 (1988), pp. 152-157, 283-287, 558-565.
4. M. A. Berger and Y. Wang, Bounded semigroups of matrices, Linear Algebra Appl., 166 (1992), pp. 21-27.
5. V. D. Blondel and V. Canterini, Undecidable problems for probabilistic automata of fixed dimension, Theory Comput. Syst., 36 (2003), pp. 231-245.
6. V. D. Blondel, J. Cassaigne, and R. M. Jungers, On the number of α-power-free words for 2 < α ≤ 7/3, Theoret. Comput. Sci., 410 (2009), pp. 2823-2833.
7. V. D. Blondel, R. Jungers, and V. Protasov, On the complexity of computing the capacity of codes that avoid forbidden difference patterns, IEEE Trans. Inform. Theory, 52 (2006), pp. 5122-5127.
8. V. D. Blondel and Y. Nesterov, Computationally efficient approximations of the joint spectral radius, SIAM J. Matrix Anal. Appl., 27 (2005), pp. 256-272.
9. V. D. Blondel and Y. Nesterov, Polynomial-time computation of the joint spectral radius for some sets of nonnegative matrices, SIAM J. Matrix Anal. Appl., 31 (2009), pp. 865-876.
10. V. D. Blondel, Y. Nesterov, and J. Theys, On the accuracy of the ellipsoid norm approximation of the joint spectral radius, Linear Algebra Appl., 394 (2005), pp. 91-107.
11. V. D. Blondel and J. N. Tsitsiklis, The boundedness of all products of a pair of matrices is undecidable, Systems Control Lett., 41 (2000), pp. 135-140.
12. S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, 2004.
13. J. Cassaigne, Counting overlap-free binary words, in STACS 93, Lecture Notes in Comput. Sci. 665, Springer, Berlin, 1993, pp. 216-225.
14. I. Daubechies and J. C. Lagarias, Two-scale difference equations II. Local regularity, infinite products of matrices and fractals, SIAM J. Math. Anal., 23 (1992), pp. 1031-1079.
15. N. G. de Bruijn, On Mahler's partition problem, Indag. Math. (N. S.), 10 (1948), pp. 210-220.
16. G. A. Derfel, N. Dyn, and D. Levin, Generalized refinement equations and subdivision processes, J. Approx. Theory, 80 (1995), pp. 272-297.
17. L. Euler, Introductio in Analysis Infinitorum, Teubner, Leipzig, 1922.
18. S. Finch, private communication, 2008.
19. S. Finch, P. Sebah, and Z.-Q. Bai, Odd Entries in Pascal's Trinomial Triangle, http://www.citebase.org/abstract?id=oai:arXiv.org:0802.2654 (2008).
20. J. Goldwasser, W. Klostermeyer, M. Mays, and G. Trapp, The density of ones in Pascal's rhombus, Discrete Math., 204 (1999), pp. 231-236.
21. G. Gripenberg, Computing the joint spectral radius, Linear Algebra Appl., 234 (1996), pp. 43-60.
22. N. Guglielmi and M. Zennaro, Finding extremal complex polytope norms for families of real matrices, SIAM J. Matrix Anal. Appl., 31 (2009), pp. 602-620.
23. L. Gurvits, Stability of discrete linear inclusions, Linear Algebra Appl., 231 (1995), pp. 47-85.
24. R. M. Jungers, The Joint Spectral Radius: Theory and Applications, Lecture Notes in Control and Inform. Sci. 385, Springer-Verlag, Berlin, 2009.
25. R. M. Jungers, V. Protasov, and V. D. Blondel, Overlap-free words and spectra of matrices, Theoret. Comput. Sci., 410 (2009), pp. 3670-3684.
26. V. S. Kozyakin, Structure of extremal trajectories of discrete linear systems and the finiteness conjecture, Autom. Remote Control, 68 (2007), pp. 174-209.
27. M. Lothaire, Combinatorics on Words, Encyclopedia of Math. Appl. 17, Cambridge University Press, Cambridge, 1982.
28. K. Mahler, On a special functional equation, J. London Math. Soc., 15 (1940), pp. 115-123.
29. P. Parrilo and A. Jadbabaie, Approximation of the joint spectral radius using sum of squares, Linear Algebra Appl., 428 (2008), pp. 2385-2402.
30. V. Y. Protasov, The joint spectral radius and invariant sets of linear operators, Fundam. Prikl. Mat., 2 (1996), pp. 205-231.
31. V. Y. Protasov, The generalized spectral radius, A geometric approach, Izv. Math., 61 (1997), pp. 995-1030.
32. V. Y. Protasov, Asymptotic behaviour of the partition function, Sb. Math., 191 (2000), pp. 381-414.
33. V. Y. Protasov, Refinement equations with nonnegative coefficients, J. Fourier Anal. Appl., (2000), pp. 55-77.
34. V. Y. Protasov, On the asymptotics of the binary partition function, Math. Notes, 76 (2004), pp. 144-149.
35. V. Y. Protasov, On the regularity of de Rham curves, Izv. Math., 68 (2004), pp. 567-606.
36. V. Y. Protasov, Fractal curves and wavelets, Izv. Math., 70 (2006), pp. 123-162.
37. J. Radon, Über eine Erweiterng des Begriffs der konvexen Funktionen, mit einer Anwendung auf die Theorie der konvexen Körper, Sitz.ber. Akad. Wiss. Wien, 125 (1916), pp. 241-258.
38. B. Reznick, Some binary partition functions, in Analytic Number Theory: Proceedings of a Conference in Honor of Paul T. Bateman, B. C. Berndt, H. G. Diamond, H. Halberstam, and A. Hildebrand, eds., Boston, Birkhäuser, 1990, pp. 451-477.
39. G. C. Rota and G. Strang, A note on the joint spectral radius, Nederl. Akad. Wetensch. Proc. Ser. A63 Indag. Math., 22 (1960), pp. 379-381.
40. J. N. Tsitsiklis and V. D. Blondel, The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate, Math. Control, Signals Systems, 10 (1997), pp. 31-40.
41. D.-X. Zhou, The p-norm joint spectral radius for even integers, Methods Appl. Anal., 5 (1998), pp. 39-54.