Linear Algebra Assignment
Linear Algebra Assignment
1. Write a python program for addition subtraction multiplication of complex numbers 4+2j
and 3-6j.
Unit No 2
1. Define : Identity matrix, Symmetric Matrix, Null Space, Inner Product, Outer Product,
Forest, Spanning Subgraph, Spanning Subgraph, cycle, path, Basis, Row rank of Matrix,
Column rank of Matrix.
2. Prove that, For any vector v belongs to v ∊ V; there is exactly one representation of v in terms of
the basis vectors. If a1, a2, . . . ., an be a basis for a vectorspace V.
3. Find the coordinate representation of v=[1,3,5,3] in terms of a1 = [1,1,0,0], a2=[0,1,1,0],
a3=[0,0,1,1]
4. Find the coordinate representation of v=[0,0,0,1] in terms of the vectors [1,1,0,1], [0,1,0,1]
and [1,1,0,0] in GF(2)
5. Write a program in python to multiply two matrices using nested loops.
6. Write python code to print diagonal matrix with diagonal elements [1,2,3,4]
7. Find the null space of matrix A = [ [1 5 6]
[2 6 8]
[3 4 7] ]
8. Write dot product definition of matrix-vector multiplication with an example.
9. Write dot product definition of vector-matrix multiplication with an example.
10. Write a python code to check whether a given matrix M=[ [1,3,5], [3,2,4],[5,4,1]]
is a symmetric matrix.
11. Find the dimension of the vector space spanned by the vectors (1, 1, –2, 0, –1),
(1, 2, 0, –4, 1), (0, 1, 3, –3, 2), (2, 3, 0, –2, 0) and also find the basis.
Unit No 3
1. Solve the following system using Gaussian elimination method. v - w = 3 ; -2u + 4v - w = 1 ;
-2u + 5v -4w = -2
2. Solve the following system using Gaussian elimination method. x + y + z = 1 ; x + 2y + 2z = 1
; x + 2y + 3z = 1
3. Solve the following system using Gaussian elimination method. 4y - 3 z = 3 ; -x + 7y - 5z = 4 ;
-x + 8y - 6z = 5
4. Express the following as a linear combination of v1=(–2, 1, 3), v2=(3, 1, –1) and
v3=(–1, –2, 1) with w= (6, –2, 5)
5. Find eigen Values and eigen vectors of 8 –8 –2 A = 4 –3 –2
3 –4 1
6. Check whether the following set {(1,1,0), (0,1,1), (1,1,1)} is linearly Independent or
not.