Skip to main content

Abstract

The study of the recursive Sylvester-constructed Hadamard matrix and transform is made considerably easier by employing Kronecker matrix algebra. In this short chapter we define the essential elements of this algebra and state, without proof, some useful theorems. There are a number of excellent references on Kronecker matrix algebra. The one we draw from is Regalia and Mitra (1989).

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

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media New York

About this chapter

Cite this chapter

Yarlagadda, R.K.R., Hershey, J.E. (1997). Kronecker Matrix Algebra. In: Hadamard Matrix Analysis and Synthesis. The Springer International Series in Engineering and Computer Science, vol 383. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6313-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-6313-6_1

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7898-3

  • Online ISBN: 978-1-4615-6313-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics