2/3/2021 Applied Linear Algebra for Signal Processing, Data Analytics and Machine Learning - - Unit 5 - Week-3
(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)
[email protected]
NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Applied Linear Algebra for Signal Processing, Data
Analytics and Machine Learning (course)
Course outline
Assignment-3
How does an Assignment not submitted Due date: 2021-02-10, 23:59 IST.
NPTEL online
course work? 1) Consider a matrix of size 2 × 5. The Rank+Nullity of this matrix equals 1 point
Week-0
2
Week-1
5
Week-2
7
Lec 06- Matrix:
Determinant,
3
Inverse
Computation, 2) Consider the vectors below 1 point
Adjoint, Cofactor 1 1
⎡ ⎤ ⎡ ⎤
Concepts (unit?
unit=26&lesson=27) ⎢ 1 ⎥ ⎢ 2 ⎥
x̄1 = ⎢ ⎥ , x̄2 = ⎢ ⎥
⎢ 1 ⎥ ⎢ 3 ⎥
Lec 07- ⎣ ⎦ ⎣ ⎦
1 4
Applications of
Matrices: Solution Using the Gram-Schmidt procedure, a set of orthonormal basis vectors for the same subspace is given as
of System of
Linear equations,
MIMO Wireless ⎡
1
⎤ ⎡
1
⎤
Technology (unit? 1 ⎢ 1 ⎥ 1 ⎢ 2 ⎥
unit=26&lesson=28) v̄1 = ⎢ ⎥ , v̄2 = ⎢ ⎥
2
⎢ 1 ⎥ 2√5 ⎢ 3 ⎥
⎣ ⎦ ⎣ ⎦
Lec 08- 1 4
Applications of
Matrices: Electric
Circuits, Traffic
flows (unit?
unit=26&lesson=29)
⎡ ⎤ ⎡ ⎤
https://onlinecourses.nptel.ac.in/noc21_ee33/unit?unit=35&assessment=42 1/5
2/3/2021 Applied Linear Algebra for Signal Processing, Data Analytics and Machine Learning - - Unit 5 - Week-3
1 −3
Lec 09- ⎡ ⎤ ⎡ ⎤
Applications of 1 ⎢ 1 ⎥ 1 ⎢ 2 ⎥
v̄1 = ⎢ ⎥ , v̄2 = ⎢ ⎥
Matrices: Graph 2
⎢ 1 ⎥ √18 ⎢ ⎥
1
Theory, Social ⎣ ⎦ ⎣ ⎦
1 −2
Networks,
Dominance
Directed Graph, 1 1
⎡ ⎤ ⎡ ⎤
Influential Node
⎢ 1 ⎥ ⎢ −1 ⎥
(unit? v̄1 =
1
⎢ ⎥ , v̄2 = −
1
⎢ ⎥
2 2
⎢ 1 ⎥ ⎢ −1 ⎥
unit=26&lesson=30)
⎣ ⎦ ⎣ ⎦
1 1
Lec 10- Null
Space of Matrix:
Definition, Rank- ⎡
1
⎤ ⎡
−3
⎤
Nullity Theorem,
1 ⎢ 1 ⎥ 1 ⎢ −1 ⎥
Application in v̄1 =
2
⎢ ⎥ , v̄2 = ⎢ ⎥
⎢ 1 ⎥ 2√5 ⎢ 1 ⎥
Electric Circuits
⎣ ⎦ ⎣ ⎦
(unit? 1 3
unit=26&lesson=31)
3) Consider the matrix A given below 1 point
Quiz : 1 1 1 1 1
A = [ ]
Assignment-2
1 2 3 4 5
(assessment?
Which of the vectors below lie in the null space of the matrix A?
name=32)
Feedback For
Week 2 (unit? ⎡
−3
⎤
unit=26&lesson=33) ⎢ −1 ⎥
⎢ ⎥
⎢ ⎥
⎢ 2 ⎥
Week-3 ⎢ ⎥
⎢ 1 ⎥
⎣ ⎦
Lec 11- Gram- −1
Schmidt
Orthogonalization
2
(unit? ⎡ ⎤
unit=35&lesson=36) ⎢ −3 ⎥
⎢ ⎥
⎢ ⎥
Lec 12- Gaussian ⎢ 0 ⎥
⎢ ⎥
Random Variable: ⎢ 1 ⎥
Definition, Mean, ⎣
0
⎦
Variance,
Multivariate
2
Gaussian, ⎡ ⎤
Covariance ⎢ −3 ⎥
⎢ ⎥
Matrix (unit? ⎢ ⎥
⎢ −1 ⎥
unit=35&lesson=37) ⎢ ⎥
⎢ 1 ⎥
Lec 13- Linear ⎣ ⎦
1
Transformation of
Gaussian
Random Vectors ⎡
−2
⎤
(unit? ⎢ 3 ⎥
⎢ ⎥
unit=35&lesson=38) ⎢ ⎥
⎢ −2 ⎥
⎢ ⎥
Lec 14- Machine ⎢ −1 ⎥
Learning ⎣ ⎦
2
Application:
Gaussian 4) Kirchoff’s voltage law states that 1 point
Classification
(unit? Net voltage drop across a node is zero
unit=35&lesson=39)
Net current entering a node equals 0
https://onlinecourses.nptel.ac.in/noc21_ee33/unit?unit=35&assessment=42 2/5
2/3/2021 Applied Linear Algebra for Signal Processing, Data Analytics and Machine Learning - - Unit 5 - Week-3
Lec 15- Net voltage drop across a closed loop is zero
Eigenvalue:
Net current across a closed loop is zero
Definition,
Characteristic 5) Consider the adjacency matrix M for a directed graph used to represent a social network as 1 point
Equation, described in the lectures. The elements [M]i,j are defined as
Eigenvalue
Decomposition
(unit?
[M] = 1
unit=35&lesson=40) i,j
Lec 16- Special
[M] = 1 if there is a directed edge from node i to node j and 0 otherwise
Matrices: i,j
Rotation and
Unitary Matrices, [M]
i,j
= 1 if there is a directed edge from node j to node 1 and 0 otherwise
Application:
Alamouti Code
[M] = 1 if there is a directed edge from node i to node j , or node j to node i, and 0 otherwi
(unit? i,j
unit=35&lesson=41)
6) Consider the adjacency matrix M for a directed graph used to represent a social network as 1 point
Quiz : described in the lectures. The number of r step connections from node i to node j is given as
Assignment-3
(assessment?
name=42) [M ]
r
i,j
[rM] = 1
i,j
r−1
[M ]
i,j
M
[ ]
r i,j
7) Consider the directed graph below 1 point
The adjacency matrix for this graph is given as
0 0 1 0 1
⎡ ⎤
⎢ 0 0 0 1 0⎥
⎢ ⎥
⎢ ⎥
⎢ 0 1 0 1 0⎥
⎢ ⎥
⎢ 0 0 1 0 1⎥
⎣ ⎦
0 0 0 0 0
⎡ ⎤
https://onlinecourses.nptel.ac.in/noc21_ee33/unit?unit=35&assessment=42 3/5
2/3/2021 Applied Linear Algebra for Signal Processing, Data Analytics and Machine Learning - - Unit 5 - Week-3
0 0 1 0 1
⎡ ⎤
⎢ 0 0 0 1 0⎥
⎢ ⎥
⎢ ⎥
⎢ 0 1 1 0 0⎥
⎢ ⎥
⎢ 0 0 0 0 1⎥
⎣ ⎦
0 1 0 0 0
0 0 1 0 1
⎡ ⎤
⎢ 0 0 0 1 0⎥
⎢ ⎥
⎢ ⎥
⎢ 0 1 0 1 0⎥
⎢ ⎥
⎢ 0 0 1 0 0⎥
⎣ ⎦
0 1 0 0 0
0 0 1 0 1
⎡ ⎤
⎢ 0 0 0 1 0⎥
⎢ ⎥
⎢ ⎥
⎢ 0 1 0 1 0⎥
⎢ ⎥
⎢ 0 0 0 0 1⎥
⎣ ⎦
0 1 0 0 0
8) Consider the directed graph below 1 point
The number of 2-step connections for this graph from node P1 to node P2 is given as
9) A dominance directed graph is one in which 1 point
Between any pair of nodes Pi , Pj , there is an edge from Pi to Pj or Pj to Pi , or both
Between any pair of nodes Pi , Pj , there is an edge from Pi to Pj and Pj to Pi
Between any pair of nodes Pi , Pj , there is an edge from Pi to Pj or Pj to Pi , or none
Between any pair of nodes Pi , Pj , there is an edge from Pi to Pj or Pj to Pi , but not both
10) 1 point
https://onlinecourses.nptel.ac.in/noc21_ee33/unit?unit=35&assessment=42 4/5
2/3/2021 Applied Linear Algebra for Signal Processing, Data Analytics and Machine Learning - - Unit 5 - Week-3
Let M denote the adjacency matrix of a dominance directed graph. The most influential node is Pi if
Row i has the largest sum in M 2
Row i has the largest sum in M
Row i has the largest sum in M 2 + M
Row i has the largest sum in M 3 + M 2 + M
You may submit any number of times before the due date. The final submission will be considered for
grading.
Submit Answers
https://onlinecourses.nptel.ac.in/noc21_ee33/unit?unit=35&assessment=42 5/5
