Chapter 2 Topics from Linear algebra Flashcards

1
Q

What does linearly independent mean

A

If vectors v1….vn are linearly independent the equation : x1v1+x2v2+….+xnvn = 0 has no solution except that x1=x2=…=xn=0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How to show vectors are linearly independent

A

Write x1v1+x2v2+….+xnvn = 0 and form three lienar equations and propose a martix A such that Ax=0
We need to show there is only one unique solution so reduce A in REF form and if there are all elading variables or the determinant is not 0 ther eis only one unique solution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Define the rank of a matrix

A

Parameter associated with all matrices. It is the largest K for which the matrix has k linearly independent rows and it is also k which the matrix has k linearly independent columns

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Define Eigenvalue

A

In a square matrix A if lamda is an eigenvalue then there exists a non zero column vector v with Av=Lamda. There is also a row vector u with: uA=uLamda

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Define eigenvector

A

Non zero column vector v with Av=lamdav is called an eigenvector of A correpsonding to lamda

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Define row eigenvector

A

Non zero row vector v with uA=ulamda is called an row eigenvector of A corresponding to lamda

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Define the characteristic polynomial of a matrix A and what does its degree tell you

A

det(xI -A) : the degree of this the characteristic polynomial of A is the amount of eigenvalues in the matrix and size n of the matrix.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What are properties of similar matrices

A

Similar matrices have the same eigenvalues

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Explain diagonalisation

A

If a matrix had n distinct eignvalues, all eigenvalues then have eigenvectors that are linearly independent. Let x1….xn be the eigenvalues and vi be corresponding eigenvectors so Avi=Xivi. If T is a matrix = (v1, v2,…vn) Then A is similar to using T a diagonal matrix D with eigenvalues on the diagonal.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is a diagonal matrix

A

Has only zero entries apart from on it’s diagonal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

When can we compute D if A had eigenvalues with multiplicity 2

A

If there are two free variables and I can pick two eigenvectors that are linearly independent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What can you tell about similarity to a diagonal matrix from a matrix’s eigenvalues

A

n distinct eigenvalues means A is simialr to D
Non distinct eigenvalues means A may or may nto be similar to D
Can only have A = T-1DT for square matrices

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What does orthogonal matrix mean

A

It’s inverse is equals to its transpose. Also A x A^T will give me the identity for an orthogonal matrix

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is a symmetric matrix

A

Transpose is equal to the matrix itself - they are the same

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Let A and nxn symmetric real matrix - what are its properties

A

All eigenvalues of A are real numbers
There is an orthogonal martix U with U^T A U = D were D is diagonal (similarity to diagonal matrix with an orthogonal matrix)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What matrix U is the orthogonal matrix in the diagonalization of a symmetric matrix

A

U is matrix of normalised eigenvectors from A the symmetric matrix

17
Q

what is another name for dot product

A

inner product

18
Q

Whats special about symmetric matrices eigenvectors

A

their inner product must be zero

19
Q

How is the order of eigenvalues in Matrix D - diagonal matrix from diagonalisation decided?

A

Depends on order of eigenvectors in T

20
Q

What is a positive definite matrix

A

Symmetric n x n matrix with all positive eigenvalues

21
Q

What is a positive semi definite matrix

A

Symmetric n x n matrix with all non negative eigenvalues

22
Q

If A is a real matrix m x n what can we say about AA^t and A^t A

A

They are symmetric and positive semi definite

23
Q

If multiplication of two matrix P and Q exists. what is special about he eigenvalues of PQ and QP

A

They are the same except for the number of zeros.

24
Q

What are the singular values of A

A

The positive square roots of the eigenvalues of S=AA^t. Given the symbol S_i - singular value fo A

25
Q

How can similarity be used practically

A

Easier to study The powers of matrices A ^k = TD^kT^-1

26
Q

State the SVD theorem

A

If A is n x n then there exists orthogonal matrices U and V such that (U^T)AV=D where D contains the singular values of A in descending order along the diagonal.

27
Q

Steps for constructing the SVD

A
  1. Find S and T such that S = AA^T AND T=A^TA
  2. Find their eigenvalues (they are the same so find for only one)
  3. Find orthogonal matrix U that diagonalizes S - to do this find eigenvectors of S and place them in matrix in order from the eigenvalues they correspond to largest to smallest
  4. Find orthogonal matrix V that diagonalises T - to do this find eigenvectors of S and place them in matrix in order from the eigenvalues they correspond to largest to smallest
  5. Find SV of A - square root of AA^t eigenvalues
  6. Check U^TAV= D
  7. Writing A = U D V^T
28
Q

What is rank approximation

A

Finding the matrix closest to my matrix with a different rank.

29
Q

Why is rank approximation relevant to search engines

A

Reducing size of term by document matrix by sending the small singular values to 0. picked a threshold to get rid of. Term by document becomes UD_0V^T