Beruflich Dokumente
Kultur Dokumente
Determinants
a square array of numbers enclosed by two bars
and is subjected to mathematical operation. The
elements of which have corresponding numbers
of rows to that of the columns.
a11 a12 a13
D a21 a22 a23
a31 a32 a33
where:
aij = the element of the ith row and jth column
Sign of Operators
Properties of Determinants:
1.
0 1 4
D 0 2 5 0
0 3 6
2.
1 4 7
2 5 8
D 2 5 8 1 4 7
3 6 9
3 6 9
Properties of Determinants:
3.
2 4 4 2 1 4
D 4 12 5 4 3 5 4
5 16 6 5 4 6
common factor =4
Properties of Determinants:
4. If two rows or columns are identical then D = 0.
1 1 4
D 2 2 5 0
3 3 6
identical
Properties of Determinants:
5. If two rows or columns are proportional then D is
equivalent to 0.
1 2 7
D 2 4 8 0
3 6 9
proportional
Properties of Determinants:
6. If the corresponding rows and columns of a determinant
are interchanged, its value is unchanged.
1 4 7 1 2 3
D 2 5 8 4 5 6
3 6 9 7 8 9
Properties of Determinants:
7. If three determinants D1, D2 and D3 have corresponding
equal elements except for a single row or column in
which the elements at D1 are the sum of the
corresponding elements of D2 and D3 then D1 = D2 +
D3
a11 b11 a12 a13 a11 a12 a13 b11 a12 a13
a
a
b
b
a
a
a
a
a
a
21 21 22 23 21 22 23 21 22 23
a31 b31 a32 a33 a31 a32 a33 b31 a32 a33
D1
D2
D3
Properties of Determinants:
8.
a11 a12
A
a21 a22
b11 b12
B
b21 b22
Properties of Determinants:
9. The value of a determinant is the algebraic sum of the
products obtained by multiplying each element of a
column or row by its co-factor or signed minor.
(Expansion of Determinants by Minor)
Properties of Determinants:
Ex.
Expansion by Row
D = a11
a12
a13
a21
a22
a23
a31
a32
a33
a22
a32
where :
Dij = the cofactor of Aij
Example
Find the cofactor using the minor of the
given matrix
D= 1
-2
3
2 3
3 1
2 1
Solution
3
(1)
2
2 1 2
(1)
2
31 2
(1)
3
11
1
1
3
1
3
1
2
(1)
3
2 2 1
(1)
3
3 2 1
(1)
2
1 2
1
1
3
1
3
1
2
(1)
3
23 1
(1)
3
3 3 1
(1)
2
1 3
3
2
2
2
2
3
EVALUATION OF DETERMINANTS
1. Conventional Method
used for 2nd degree determinants and
commonly denoted as cross product method.
Ex.
D =
2
1
8
5
D = [(2x5)-(8x1)]
D = ( 10 - 8 ) = 2
EVALUATION OF DETERMINANTS
2. Diagonal Method
used for 3rd degree determinants commonly
described as the sum of products of the
diagonal leaning \ minus the sum of products
of the diagonal leaning / .
EVALUATION OF DETERMINANTS
Ex.
D
2
5
1
5
0
-3
4
1
3
D = [( 2 x 0 x 3 ) + ( 5 x 1 x 1 ) + ( 4 x 5 x -3 )]
- [( 1 x 0 x 4 ) + ( -3 x 1 x 2 ) + ( 3 x 5 x 5 )]
D = ( 0 + 5 + -60 ) - ( 0 + -6 + 75 )
D = - 55 - 69 = - 124
EVALUATION OF DETERMINANTS
3. Expansion by Minor Cofactor Method
used for 3rd degree and higher degree order
of determinants.
a. Expansion by Row
n
D Aik Dik
k 1
EVALUATION OF DETERMINANTS
Find the determinants of the given matrix
using expansion by row.
D
1
4
2
4
4
5
3
5
4
Solution
n 3; i row
position 2nd
row
D 4(1)
2 1
4 3
3
4
2 2 1
2 1 1
4(1)
5(1)
5 4
2 4
2 5
EVALUATION OF DETERMINANTS
b. Expansion by Column
n
D Akj Dkj
k 1
EVALUATION OF DETERMINANTS
Find the determinants of the given matrix
using expansion by column.
D
1
4
2
4
4
5
3
5
4
Solution
n 3; j column
11
D 1(1)
4 5
3
3
2 1 4
31 4
4(1)
2(1)
5 4
5 4
4 5
EVALUATION OF DETERMINANTS
Chios Method
Another method in evaluating the
determinant of an (m x m) order matrix
where a11 is not equal to zero.
EVALUATION OF DETERMINANTS
Chios Method (3x3)
a11 a12
A a 21 a 22
a31 a32
a13
a 23
a33 33
1
det . A
(a11 ) ( m 2 )
a11 a12
a 21 a 22
a11 a12
a11 a13
a 21 a 23
a11 a13
a31 a32
a31 a33
33
EVALUATION OF DETERMINANTS
Chios Method (4x4)
a11 a12
a 21 a 22
A
a31 a32
a 41 a 42
a13
a 23
a33
a 43
1
det . A
(a11 ) ( m 2 )
a14
a 24
a34
a 44
a11 a12
a 21 a 22
a11 a12
a31 a32
a11 a12
a 41 a 42
a11 a13
a 21 a 23
a11 a13
a31 a33
a11 a13
a 41 a 43
a11 a14
a 21 a 24
a11 a14
a31 a34
a11 a14
a 41 a 44
4 4
EVALUATION OF DETERMINANTS
Find the determinants of the given matrix
using Chios method.
D
1
4
2
4
4
5
3
5
4
Solution
1 4 3
A 4 4 5
2 5 4
det . A
1
(1) (3 2 )
1
4
1
2
4
4
4
5
1
4
1
2
3
5
1 (4 16) (5 12)
(1)
3 (1) (5 8) (4 6)
4
12 7
det . A (1)
24 21 3
3 2
a. Alteration by zero
The element of any row (or column) may
be multiplied by a constant and the result
added to the corresponding element of
any other row (or column) without
changing the value of the determinants.
A
D
G
B
E
H
C
F
I
A
0
0
B
E
0
C
F
I
(A x E x I )
1
4
2
4
4
5
3
5
4
Solution
1 4 3
R1
A 4 4 5 R2 4 R1
2 5 4 R3 2 R1
1 4
3
R1
A 0 12 7
R2
0 3 2 R3 R2 4
1 4
3
A 0 12 7 (1)(12)(1 4) 3
0 0 1 4
1
4
2
4
4
5
3
5
4
Solution
1 4 3
A 4 4 5
2 5 4
A 4(1)
(4)(4)
1
4
2 2
(4)(5)
3
4
(4)(5)
(5)(5)
2
4
4
4
3 2
A4
4(27 4 6)
3 9 4
27 24
A 4
3
4
Seatwork 2.1
3 6 4 9
12 11
8
13
B
1. If
2
14 10 5 , find its
16 1 7
15
determinant using:
a. Expansion by row
b. Expansion by column
c. Chios Method
d. Alteration by zero
e. Pivotal Element Method
Matrix
It is a rectangular array of numbers or functions enclosed
in a pair of brackets and subject to certain rules of
operation.
A
=
a11
a12
a13
a21
a22
a23
a31
a32
a33 3x3
A = /aij/mxn
where: aij = element of matrix A
mxn = size of order of matrix
m = number of row matrix
n = number of column matrix
Note: m & n may or may not be equal
1
2
3
.
.
.
n
m x1
Square Matrix
It is a matrix whose elements have equal number of
rows and columns.
Ex.
A
1
4
2
4
4
5
3
5
4
A =
0
0
0
0
3
0
0
0
4
0
0
0
3
1
0
0
0
1
0
0
0
1
Ex.
A =
1
-5
6
-5
7
2
6
2
3
1
-5
6
5
7
-2
-6
2
3
1
2
4
8
1
4
2
4
4
5
3
5
4
determinant value
/A/ = 3
MATRIX LAWS
1. A + B = B + A
(Matrix addition is commutative)
2. A + 0 = 0 + A = A
(0 is the zero for matrix addition)
3. A + (-A) = (-A) + A = 0 (-A is the negative of A)
4. (A + B) + C = A + (B + C)(Matrix addition is associative)
5. (sA)B = A (sB) = s(AB) (Scalars can be moved through
products)
6. For Amxn, ImA = Ain = A (I is the identity for matrix
multiplication)
7. (A + B)C = AC + BC
(Right distributive law)
8. A(B + C) = AB + AC
(Left distributive law)
9. A(BC) = (AB) C
(Matrix multiplication is
associative)
MATRIX OPERATION
In matrix operation, only addition, subtraction,
and multiplication are defined. Division is done
by a different technique.
1. Addition / Subtraction
-two matrices may be conformable to
addition/subtraction, if and only if the
of the two matrices are equal.
size
MATRIX OPERATION
Example:
Evaluate A & B
A= 1
2
3
3
2
1 2x3
B= 1
2
4
1
0
1 3x2
A + B = not possible because they are not of the
same order.
MATRIX OPERATION
Example:
1
2
3
4
5
6
7
8
9 3x3
B=
2
1
0
5
6
3
1
4
7 3x3
Solution
1 4 7
A 2 5 8
3 6 9
2 5 1
B 1 6 4
0 3 7
(1 2) (4 5) (7 1) 3 9 8
C A B (2 1) (5 6) (8 4) 3 11 12
(3 0) (6 3) (9 7) 3 9 16
Solution
1 4 7
A 2 5 8
3 6 9
2 5 1
B 1 6 4
0 3 7
(2 1) (5 4) (1 7)
1
1 6
C B A (1 2) (6 5) (4 8) 1 1 4
(0 3) (3 6) (7 9) 3 3 2
MATRIX OPERATION
2. Multiplication
a. By scalar
Example:
A x 5 where A = 1
3
4
Ax5= 5
15
20
0
-4
5
1
3
2
0
-20
25
5
15
10
MATRIX OPERATION
b. By another matrix
-two matrices can be multiplied if the number of
column (left hand) of the first matrix is equal to
the number of row (right hand) of the second
matrix.
MATRIX OPERATION
A*B=
a11
a21
a31
a12
a22
a32
a13
a23
a33
3x3
b11
b21
b31
b12
b22
b32
3x2
MATRIX OPERATION
A * B = (a11b11+a12b21+a13b31) (a11b12+a12b22+a13b32)
C 11
C 12
(a21b11+a22b21+a23b31) (a21b12+a22b22+a23b32)
C 21
C 22
(a31b11+a32b21+a33b31) (a31b12+a32b22+a33b32)
C 31
C 32
MATRIX OPERATION
A * B = C = c11
c21
c31
c12
c22
c32
3x2
MATRIX OPERATION
3. Division
Inverse of a matrix
B=1
A
= A-1
MATRIX OPERATION
a. Inverse of a matrix
A-1 = 1 adj AT
/A/
where: /A/ = determinant value of a matrix
AT = transpose of a matrix
adj = adjoint of a matrix
Note: Division operation is not conformable to
matrices of unequal rows & columns. Hence,
this operation is restricted to square matrices
only.
MATRIX OPERATION
Transpose of a matrix ( AT )
-to determine the transpose of a matrix,
interchange the corresponding rows and
columns of the given determinant.
Example:
A=
1
4
2
4
4
5
3
5
4
AT = 1
4
3
4
4
5
2
5
4
MATRIX OPERATION
Adjoint of a Matrix ( adj. )
-to obtain the adjoint of any matrix, replace each
element by its corresponding co-factor.
Example:
A= 1
4
3
4
4
5
2
5
4
MATRIX OPERATION
adj A =
(+)4 5
5 4
(-)4 5
2 4
(+)4 4
2 5
(-)4 3
5 4
(+)1 3
2 4
(-)1 4
2 5
(+)4 3
4 5
(-)1 3
4 5
(+)1 4
4 4
MATRIX OPERATION
Ex. Solve for the inverse matrix.
A=
1
4
2
4
4
5
3
5
4
Solution
1 4 3
A 4 4 5
2 5 4
T
adjo
int
A
A1
det . A
1 4 2
AT 4 4 5
3 5 4
Solution
4
(1)
5
T
2 1 4
adj. A (1)
5
31 4
(1)
4
11
5
4
2
4
2
5
4
(1)
3
2 2 1
(1)
3
3 2 1
(1)
4
9 1 8
T
adj. A 6 2 7
12 3 12
1 2
5
4
2
4
2
5
4
(1)
3
23 1
(1)
3
3 3 1
(1)
4
1 3
4
5
4
5
4
4
Solution
3
D 4(1)
2 1
4 3
3
4
2 2 1
2 1 1
4(1)
5(1)
5 4
2 4
2 5
Solution
A1
9 1 8
6 2 7
12 3 12
3
3 1/ 3 8 / 3
2 2/3 7/3
4
1
4
Cramers Rule
It is a theorem, which gives an expression for
the solution of a system of linear equations with
as many equations as unknowns, valid in those
cases where there is a unique solution.
The solution is expressed in terms of the
determinants of the (square) coefficient matrix
and of matrices obtained from it by replacing
one column by the vector of right hand sides of
the equations.
Cramers Rule
Use Cramers Rule and conventional
method to solve the system:
4x - y + z = -5
2x + 2y + 3z = 10
5x 2y + 6z = 1
Solution
4 1
2 2
5 2
4
A 2
5
1 x 5
3 y 10
6 z 1
1 1
2 3
2 6
11
det . A 4(1)
2 3
3
2
1 2 2
1 3 2
(1)(1)
1(1)
2 6
5 6
5 2
Solution
5 1 1
B 10 2 3
1 2 6
11
det .B 5(1)
2 3
3
2
1 2 10
1 3 10
(1)(1)
1(1)
2 6
1 6
1 2
1
det . A 55
Solution
4 5 1
C 2 10 3
5 1 6
3
3
1 3 2 10
1 2 2
11 10
1(1)
(5)(1)
det .C 4(1)
5 1
5 6
1 6
det .C 4(60 3) 5(12 15) 1(2 50) 228 15 48 165
det .C 165
3
y
det . A 55
Solution
4 1 5
D 2 2 10
5 2 1
10
2
11 2
1 2 2 10
1 3 2
det .D 4(1)
(1)(1)
(5)(1)
2 1
5 1
5 2
det .D 4(2 20) 1(2 50) (5)(4 10) 88 48 70 110
det .D 110
z
2
det . A 55
GAUSS-JORDAN METHODS
Gauss-Jordan Elimination
Gauss-Jordan Reduction
Gauss-Jordan Reduction
Gauss-Jordan Reduction
A1 X1 + B1 X2 + C1 X3 = D1
A2 X1 + B2 X2 + C2 X3 = D2
A3 X1 + B3 X2 + C3 X3 = D3
A1
A2
A3
B1
B2
B3
C1
C2
C3
:
:
:
D1
D2
D3
A1
0
0
B1
B2
0
C1
C 2
C 3
:
:
:
D1
D2
D3
X1
X2
X3
1
2
3
Gauss-Jordan Elimination
Gauss-Jordan Elimination
A1 X1 + B1 X2 + C1 X3 = D1
A2 X1 + B2 X2 + C2 X3 = D2
A3 X1 + B3 X2 + C3 X3 = D3
A1
A2
A3
B1
B2
B3
C1
C2
C3
:
:
:
D1
D2
D3
1
0
0
0
1
0
0
0
1
:
:
:
X1
X2
X3
GAUSS-JORDAN METHODS
Use Gauss-Jordan Reduction and GaussJordan Elimination to solve the given
system:
4x - y + z = -5
2x + 2y + 3z = 10
5x 2y + 6z = 1
Solution to Gauss-Jordan
Reduction
4 1 1 : 5
R1 / 4
2 2 3 : 10 R2 R1 / 2
5 2 6 : 1 R3 (5 / 4) R1
1 1 / 4 1 / 4 : 5 / 4
R1
0 5 / 2 5 / 2 : 25 / 2 R2 /(5 / 2)
0 3 / 4 19 / 4 : 29 / 4 R3 /( 3 / 4)
1 1/ 4
1 / 4 : 5 / 4
R1
0
1
1: 5
R2
0
1
19 3 : 29 3 R3 R2
Solution to Gauss-Jordan
Reduction
1 1/ 4
1 / 4 : 5 / 4
R1
0
1
1: 5
R2
0
1
19 3 : 29 3 R3 R2
1 1/ 4
1 / 4 : 5 / 4 R1
0
1
1: 5
R2
0
0
22 3 : 44 3 R3
22
44
z ;z 2
3
3
y z 5; y 2 5; y 3
1
1
5
1
1
5
x y z ; x (3) (2) ; x 1
4
4
4
4
4
4
Solution to Gauss-Jordan
Elimination
4 1 1 : 5
R1 / 4
2 2 3 : 10 R2 R1 / 2
5 2 6 : 1 R3 (5 / 4) R1
1 1 / 4 1 / 4 : 5 / 4
R1
0 5 / 2 5 / 2 : 25 / 2 R2 /(5 / 2)
0 3 / 4 19 / 4 : 29 / 4 R3 /( 3 / 4)
1 1/ 4
1 / 4 : 5 / 4
R1
0
1
1: 5
R2
0
1
19 3 : 29 3 R3 R2
Solution to Gauss-Jordan
Elimination
1 1/ 4
1 / 4 : 5 / 4
R1
0
1
1: 5
R2
0
1
19 3 : 29 3 R3 R2
1 1/ 4
1 / 4 : 5 / 4
R1
0
1
1: 5
R2
0
0
22 3 : 44 3 R3 /( 22 / 3)
1 1 / 4 1 / 4 : 5 / 4 R1 (1 / 4) R3
0
1
1: 5
R2 R3
0
0
1: 2
R3
Solution to Gauss-Jordan
Elimination
1 1 / 4 1 / 4 : 5 / 4 R1 (1 / 4) R3
0
1
1: 5
R2 R3
0
0
1: 2
R3
1 1 / 4 0 : 7 / 4 R1 (1 / 4) R2
0
1
0:3
R2
0
0
1: 2
R3
1 0 0 : 1 R1
0 1 0 : 3 R2
0 0 1 : 2 R3
x 1; y 3; z 2
LU Decomposition
Crouts / Choleskys Method
A L U
a11 a12 a13
A a 21 a 22 a 23
a31 a32 a33
0
L11 0
L L21 L22 0
L31 L32 L33
1 U 12 U 13
U 0 1 U 23
0 0
1
LU Decomposition
From,
Ax C
After decomposition
LU x C
Let
y U x equation 1
then,
Ly C equation 2
LU Decomposition
From the matrix equation 2 evaluate for
the variables of matrix [y] by using forward
substitution. Substitute the values of the
matrix [y] to the initial assumption in
equation 1 and determine the values of the
unknown variables in matrix [x] by reverse
substitution.
LU Decomposition
LU Decomposition
Use LU decomposition to solve the given
system:
4x - y + z = -5
2x + 2y + 3z = 10
5x 2y + 6z = 1
Solution to LU Decomposition
a11 a12
A a 21 a 22
a31 a32
L11 0
L L21 L22
L31 L32
a13
a 23 L U
a33
0
0
L33
1 U 12 U 13
U 0 1 U 23
0 0
1
Solution to LU Decomposition
Ax c
LU x c; let .U x y
L y c
c
y L1 c
L
U x y
y
1
x U y
U
Solution to LU Decomposition
a11 a12
a
21 a 22
a31 a32
a11 a12
a
21 a 22
a31 a32
a13 L11
a 23 L21
a33 L31
0 1 U 12 U 13
0 0 1 U 23
L33 0 0
1
a13 L11 (1) 0(0) 0(0)
L11 (U 12 ) 0(1) 0(0)
L11 (U 13 ) 0(U 23 ) 0(1)
a 23 L21 (1) L22 (0) 0(0)
L21 (U 12 ) L22 (1) 0(0)
L21 (U 13 ) L22 (U 23 ) 0(1)
a33 L31 (1) L32 (0) L33 (0) L31 (U 12 ) L32 (1) L33 (0) L31 (U 13 ) L32 (U 23 ) L33 (1)
0
L22
L32
Solution to LU Decomposition
a11 L11(1) 0(0) 0(0)
a11 L11
a21 L21(1) L22 (0) 0(0)
a21 L21
a31 L31(1) L32 (0) L33 (0)
a31 L31
a12 L11(U12 ) 0(1) 0(0)
a12
U12
L11
Solution to LU Decomposition
4 1 1 x 5
2 2 3 y 10
5 2 6 z 1
Ax c
Solution to LU Decomposition
a11 4 L11
a21 2 L21
a31 5 L31
a12 1
U12
L11 4
L22 2 (2)(1 4) 5 2
L32 2 (5)(1 4) 3 4
1
U13
4
3 (2)(1 4)
U 23
1
52
L33 6 (5)(1 4) ( 3 4)(1) 11 2
Solution to LU Decomposition
A L U
0
0 1 1 4 1 4
4 1 1 4
2 2 3 2 5 2
0
0
1
1
5 2 6 5 3 4 11 2 0
0
1
Solution to LU Decomposition
Ax c
LU x c; let .U x y
L y c
c
y L1 c
L
U x y
y
1
x U y
U
Solution to LU Decomposition
4 1 1 x 5
2 2 3 y 10
5 2 6 z 1
0
0 1 1 4 1 4 x 5
4
2 5 2
0
y 10
0
1
1
5 3 4 11 2 0
0
1 z 1
0
0 5
4
2 5 2
y 10
0
5 3 4 11 2 1
Solution to LU Decomposition
0
0 5
4
2 5 2
0 y 10
5 3 4 11 2 1
L y C
C
1
y C L
L
Solution to LU Decomposition
0
0
4
L 2 5 2 0
5 3 4 11 2
adj.L
1
L
det .L
T
det .L 4(1)
11
52
0
0
1 2 2
(0)(1)
3 4 11 2
5 11 2
1 3
(0)(1)
2 52
5 3 4
det .L 4(55 4) 0 0 55
Solution to LU Decomposition
5
4 2
T
L 0 5 2 3 4
0 0 11 2
3 4
11 5 2
(1)
0 11 2
T
2 1 2
adj.L (1)
0 11 2
31 2
(1) 5 2 3 4
0
(1)
0
2 2 4
(1)
0
3 2 4
(1)
0
1 2
3 4
11 2
5
11 2
5
3 4
0
(1)
0
23 4
(1)
0
3 3 4
(1)
0
1 3
5 2
0
2
0
2
5 2
Solution to LU Decomposition
55
0
0
4
T
adj.L 11 22 0
14 3 10
55
0
0
4
11 22 0 1
14 3 10 4
T
adj.L
1
1
L
det .L
55
5
14
55
0 0
2
0
5
3 2
55 11
Solution to LU Decomposition
1
0 0
4
5
1
2
y
0 10
5
5
14 3 2 1
55 55 11
1
4 5 (0)(10) (0)(1) 5
4
1
2
y 5 (10) (0)(1) 5
5
5
14
2
3
2
5 (10) (1)
55
55
11
Solution to LU Decomposition
U x y
y
1
x U y
U
T
adj.U
1
U
det .U
det .U 1(1)
11
1 1
31 1 4 1 4
2 1 1 4 1 4
0(1)
0(1)
1
1
1
0
0 1
det .U 1 0 0 1
Solution to LU Decomposition
0 0
1
T
U 1 4 1 0
1 4 1 1
11 1
(1)
1
T
2 1 0
adj.U (1)
1
31 0
(1) 1
0
1
0
1
0
0
1 4
(1)
14
2 2 1
(1)
14
1
3 2
(1)
1 4
1 2
0
1
0
1
0
0
1 4
(1)
14
23 1
(1)
14
1
3 3
(1)
1 4
1 3
1
0
1
0
1
Solution to LU Decomposition
adj.U
1 1 4 1 2
0 1
1
0 0
1
5 1
1
5 (1) 4 4 5 2 (2)
1
x 1 1 4 1 2
4
5
y 0 1
1
5
(
0
)
(
1
)
5
1
)(
2
)
4
z 0 0
2
1 2
4
x 1; y 3; z 2
Rearranging
In order to factorise scalar must turn
into a matrix by multiplying it by the
identity matrix.
c
d
a b 0
M I
c
d
0
b
a
M I
c
d
a
c
b x 0
d y 0
Write M as a matrix
b x 0
d y 0
x a
y c
x 0
y 0
b 0
d 0
b
0
d
a d bc 0
2 a d ad bc 0
This is called the characteristic
equations and will allow to find the
eigenvalues (characteristic values)
The Eigenvalues represent the scale factor of the distance our position
vector (which we still need to find) moves in relation to its original
position. There may be 1, 2 or no real eigenvalues in a 2x2 matrix.
x
x
M
y
y
1 4
A
2 3
Solution
1 4
A
2 3
1 4 0 1
4
A I
2 4 3 8
2 3 0
2
3
A I 2 4 5
2 4 5 0
( 5)( 1) 0
5; 1(eigenvalue s )
Solution
5
1 5
4
4 4
2 35
2 2
4 4 x
2 2 y
4 4 1
0; x 1 & y 1(eigen
2 21
vector )
4 4 1
0; x 1 & y 1(eigen
2 2 1
vector )
Solution
1
11 4
2 4
2 3 1 2 4
2 4x
2 4y
2 4 2
0; x 2 & y 1(eigen
2 4 1
vector )
2 4 2
0; x 2 & y 1(eigen
2 4 1
vector )
Seatwork 2.2
2 6 8
4 8
4
1. If A 3 7 7 and B 6 4
3 ,
2 3 5
4 5 6
find the sum of A and B.
2 3 1
6 4 6
2. If A 7 5 7 and B 3 4 5 , find A - B.
1 2 6
8 2 9
Seatwork 2.2
5 6 2
6 4
3. If A 2 4 1 and B 3 3, find AB.
1 1
3 3 2
4 8
4
2 6 8
3 ,find A/B
4. If A 3 7 7 and B 6 4
2 3 5
4 5 6
Homework 2.1
1. Find the value of x, y, and z using Conventional
method, Cramers rule, Gauss Jordan Methods
and LU decomposition.
x + 2y + 3z = 12
2x + 5y - 9z = 6
3x - 9y + 16z = 36
3 6
2. Find the eigenvalue of C
4 2