Skip to main content

Part of the book series: Forum for Interdisciplinary Mathematics ((FFIM))

  • 1981 Accesses

Abstract

Given an \(n\times n\) (real or complex) matrix A and an n-vector \(\mathbf{x}\), suppose we construct the n-vector \(A\mathbf{x}=:\mathbf{y}\), then A can be interpreted as a linear transformation which carries \(\mathbf{x}\) to \(\mathbf{y}\) in an n-dimensional space. In particular, if a non-zero vector \(\mathbf{x}\) can be found such that A carries \(\mathbf{x}\) to a collinear vector \(\lambda \mathbf{x}\), i.e.

$$A\mathbf{x}=\lambda \mathbf{x}$$

then \(\mathbf{x}\) is called an eigenvector of A and \(\lambda \) its corresponding eigenvalue.

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

Corresponding author

Correspondence to Sujit Kumar Bose .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bose, S.K. (2019). Matrix Eigenvalues. In: Numerical Methods of Mathematics Implemented in Fortran. Forum for Interdisciplinary Mathematics. Springer, Singapore. https://doi.org/10.1007/978-981-13-7114-1_9

Download citation

Publish with us

Policies and ethics