Skip to main content

Part of the book series: Texts and Monographs in Computer Science ((MCS))

  • 1358 Accesses

Abstract

Recall that the rank of an m x n matrix A over a field k is the maximum number of linearly independent rows (or columns) of A. It is the dimension of the image of the linear map knkm defined by A; equivalently, it is n minus the dimension of the kernel (the set of vectors in kn annihilated by the map).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Kozen, D.C. (1992). Matrix Rank. In: The Design and Analysis of Algorithms. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4400-4_33

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4400-4_33

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-8757-5

  • Online ISBN: 978-1-4612-4400-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics