Skip to main content

Abstract

This chapter examines the statistical properties of random matrices whose probability density belongs to the class of matrix radial densities. The results presented in this chapter constitute the theoretical foundations of the algorithms for generation of random matrices uniformly distributed in norm bounded sets subsequently presented in Chap. 18.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    The number \(n_{v}=nm-\frac{n}{2}(n+1)\) of free variables needed to represent an m×n matrix V=[v 1 ⋯ v n ], mn with orthonormal columns can be constructed as follows: the first column v 1 can be chosen in m−1 different ways (m free variables with one norm constraint), v 2 can be chosen in m−2 different ways (m free variables with one norm constraint and one orthogonality constraint), …,v n can be chosen in mn different ways.

References

  1. Anderson TW (1958) An introduction to multivariate statistical analysis. Wiley, New York

    MATH  Google Scholar 

  2. Calafiore G, Dabbene F (2002) A probabilistic framework for problems with real structured uncertainty in systems and control. Automatica 38:1265–1276

    Article  MathSciNet  MATH  Google Scholar 

  3. Calafiore G, Dabbene F, Tempo R (2000) Randomized algorithms for probabilistic robustness with real and complex structured uncertainty. IEEE Trans Autom Control 45:2218–2235

    Article  MathSciNet  MATH  Google Scholar 

  4. Edelman A (1989) Eigenvalues and condition numbers of random matrices. PhD dissertation, Massachusetts Institute of Technology, Cambridge

    Google Scholar 

  5. Edelman A, Kostlan E, Shub M (1994) How many eigenvalues of a random matrix are real? J Am Math Soc 7:247–267

    Article  MathSciNet  MATH  Google Scholar 

  6. Girko VL (1990) Theory of random determinants. Kluwer Academic Publishers, Dordrecht

    Book  Google Scholar 

  7. Gupta AK, Nagar DK (1999) Matrix variate distributions. CRC Press, Boca Raton

    Google Scholar 

  8. Hua LK (1979) Harmonic analysis of functions of several complex variables in the classical domains. American Mathematical Society, Providence

    MATH  Google Scholar 

  9. Mehta ML (1991) Random matrices. Academic Press, Boston

    MATH  Google Scholar 

  10. Tulino AM, Verdú S (2004) Random matrices and wireless communications. Found Trends Commun Inf Theory 1(1):1–184

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this chapter

Cite this chapter

Tempo, R., Calafiore, G., Dabbene, F. (2013). Statistical Theory of Random Matrices. In: Randomized Algorithms for Analysis and Control of Uncertain Systems. Communications and Control Engineering. Springer, London. https://doi.org/10.1007/978-1-4471-4610-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-4610-0_17

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-4609-4

  • Online ISBN: 978-1-4471-4610-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics