Questions tagged [eigenvalues-eigenvectors]

Eigenvalues are numbers associated to a linear operator from a vector space $V$ to itself: $\lambda$ is an eigenvalue of $T\colon V\to V$ if the map $x\mapsto \lambda x-Tx$ is not injective. An eigenvector corresponding to $\lambda$ is a non-trivial solution to $\lambda x - Tx = 0$.

A linear operator from a vector space $V$ to itself may well not have eigenvalues. That's the case, for instance, when $V=\mathbb{R}^2$ and $T(x,y)=(-y,x)$. However, if $V$ is a finite-dimensional complex vector space, then every linear map from $V$ into itself has one eigenvalue, at least.

The eigenvalues of a linear map $T$ from a finite-dimensional vector space into itself are the roots of the characteristic polynomial of $T$.

If $V$ is a vector space and if $T\colon V\to V$ is a linear map, then $T$ is diagonalizable if and only if there is a basis of $V$ such that each of its elements is an eigenvector of $T$.

14222 questions
51
votes
3 answers

Do non-square matrices have eigenvalues?

I've looked at this and it doesn't help because I don't know anything about SVD. Can someone dumb it down for me please?
Don Larynx
  • 4,703
37
votes
6 answers

Real life examples for eigenvalues / eigenvectors

There are already good answers about importance of eigenvalues / eigenvectors, such as this question and some others, as well as this Wikipedia article. I know the theory and these examples, but now in order to do my best to prepare a course I'm…
Basj
  • 1,671
  • 1
  • 22
  • 44
17
votes
3 answers

Diagonalisability of 2×2 matrices with repeated eigenvalues

In general for all real (and complex ) 2 by 2 matrices, is it true that if there is a repeated eigenvalue (so all eigenvalues are the same), then we conclude that that matrice is non diagonalisable? In general, for a n by n matrix, if ALL…
Morris C.
  • 243
15
votes
3 answers

Verify a vector is an eigenvector of a matrix

I have been asked to verify whether $v = \begin{bmatrix}1\\4\end{bmatrix}$ is an eigenvector of $A = \begin{bmatrix}-3&1\\-3&8\end{bmatrix}$? If yes, find the eigenvalue. The way that I approached this question is to find eigenvalues, then use…
bman
  • 675
13
votes
3 answers

Eigenvalues are continuous?

I have two matrix $A$ and $B$ and consider $C(t)=A+tB$, with $t\in [0,1]$. Are the eigenvalues of $C(t) $: $\lambda_i:[0,1]\rightarrow \mathbb{C}$ continuous functions? I guess that the answer is yes, but why?
yemino
  • 131
11
votes
5 answers

Explaining the physical meaning of an eigenvalue in a real world problem

Contextual Problem A PhD student in Applied Mathematics is defending his dissertation and needs to make 10 gallon keg consisting of vodka and beer to placate his thesis committee. Suppose that all committee members, being stubborn people, refuse to…
Paul
  • 2,133
10
votes
2 answers

do eigenvectors correspond to direction of maximum scaling?

Does the eigenvector correspond to a direction in which maximum scaling occurs by a given transformation matrix (A) acting upon this vector. I quote from : https://math.stackexchange.com/q/243553 No other vector when acted by this matrix will get…
7
votes
2 answers

A conjecture regarding the eigenvalues of real symmetric matrices

It is well-known that the solutions of $$|M-\lambda I|=0$$ are purely real if $M$ is real symmetric. Conjecture This is still true if we replace the identity matrix by a diagonal matrix $D$ whose diagonal elements are either $0$ or $1$: $$\left.…
Wouter
  • 7,673
7
votes
2 answers

Visualization of Singular Value decomposition of a Symmetric Matrix

The Singular Value Decomposition of a matrix A satisfies $\mathbf A = \mathbf U \mathbf \Sigma \mathbf V^\top$ The visualization of it would look like But when $\mathbf A$ is symmetric we can do: $\begin{align*} \mathbf A\mathbf A^\top&=(\mathbf…
edgarmtze
  • 437
7
votes
1 answer

Spectrum of a triangle; Beltrami operator

I would like to find the spectrum of a triangle (e.g. an equilateral) in using the usual Laplacian. I am not able to find some references on the subject. I'd try to solve the problem myself with a little help. Could someone give me the general idea…
user350347
7
votes
1 answer

Eigenvalues of $\sum_i A_i P_i$ with $(A_i)_{jk}=\delta_{ij}\delta_{ik}$ and $P_i$ orthogonal projections

Assume $$C=\sum_{i=1}^nA_iP_i$$ where each $P_i$ is an $n\times n$ orthogonal projection matrix ($P_i=P_i^\top$ and $P_i=P^2_i$) and $A_i$ is an $n\times n$ matrix of zero elements except the $(i,i)$-th element equal to one. Can I say something…
6
votes
1 answer

What does it mean when the geometric and algebraic multiplicity are not equal?

I know that when the the geometric multiplicity and algebraic multiplicity of a n by n matrix are not equal, n independent eigenvectors can't be found, hence the matrix is not diagonalizable. And I have read some good explanations of this phenomen,…
Xichu
  • 498
6
votes
3 answers

Eigenvalues of projection matrix proof

The assertion is as follows:"If $\lambda$ is an eigenvalue of a matrix A for which $A = A^2$ then $\lambda = 0 $ or $ \lambda = 1$. Prove if true or use a counter example. My intuition is to first find a matrix A that satisfies the constraint: $$ A…
6
votes
2 answers

QR algorithm for "general" square matrices

Can QR algorithm find repeat eigenvalues (https://en.wikipedia.org/wiki/QR_algorithm) ? I.e. does it support the case when not all N eigenvalues for real matrix N x N are distinct? How to extend QR algorithm to support finding complex eigenvalues…
6
votes
1 answer

Why do row replacement operations change the eigenvalues/eigenvectors but not the determinant? Specifically adding/subtracting rows.

Sorry for asking what may be a stupid question, but I'm really struggling conceptually to understand why adding and subtracting rows in a matrix changes the eigenvalues and eigenvectors but not the determinant. I know that scaling and swapping rows…
XH192
  • 63
1
2 3
34 35