Skip to main content

Abstract

This chapter presents algorithms for uniform matrix sample generation in norm-bounded sets. First, we discuss the simple case of matrix sampling in sets defined by p Hilbert–Schmidt norm, which reduces to the vector p norm randomization problem. Subsequently, we present an efficient solution to the problem of uniform generation in sets defined by the spectral norm.

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

References

  1. Abramowitz M, Stegun IA (eds) (1970) Handbook of mathematical functions. Dover, New York

    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. de Bruijn NG (1955) On some multiple integrals involving determinants. J Indian Math Soc 19:133–151

    MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  7. Stewart GW (1980) The efficient generation of random orthogonal matrices with an application to condition estimators. SIAM J Numer Anal 17:403–409

    Article  MathSciNet  MATH  Google Scholar 

  8. Vein R, Dale P (1999) Determinants and their applications in mathematical physics. Springer, New York

    MATH  Google Scholar 

  9. Zhou T, Feng C (2006) Uniform sample generation from contractive block Toeplitz matrices. IEEE Trans Autom Control 51:1559–1565

    Article  MathSciNet  Google Scholar 

  10. Zyczkowski K, Kus M (1994) Random unitary matrices. J Phys 27(A):4235–4245

    MathSciNet  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). Matrix Randomization Methods. 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_18

Download citation

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

  • 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