Updated-Numerical Solutions To CE Problems
Updated-Numerical Solutions To CE Problems
CONTENTS
~Let’s start ^^
Matrix Dimensions: Each element of a matrix is often denoted by a variable with two subscripts. For instance, a21
represents the element at the second row and first column of a matrix A.
Key Terms
element: An individual item in a matrix
row vector: A matrix with a single row
column vector: A matrix with a single column
square matrix: A matrix that has the same number of rows and columns
Diagonal element: elements where the subscript i and j are equal
Example 1
1. Matrix S
Example 2
• KINDS OF MATRICES
A = [ a 11 a 12 a 13 ……... a 1n]
Ex. A = [ 1 0 2 -3]
3. Square Matrix– matrix with the same dimension or same number for m & n.
5.Additive Inverse
Matrix– matrix where the
elements are the elements
of another matrix with
different algebraic signs
• OPERATIONS ON MATRICES
In order to do this, the entries must correspond. Therefore, addition and subtraction of matrices are only possible
when the matrices have the same dimensions. Matrix addition is commutative and is also associative, so the following
is true:
A+B=B+A
(A+B) +C=A+(B+C)
Example 1
Example 2
Key Answer
0 −2 2
a. [ ]
1 −2 −2
1 6 15
b. [ ]
4 −5 5
3. Multiplication in Matrices
When multiplying matrices, the elements of the rows in the first matrix are multiplied with corresponding
columns in the second matrix. Each entry of the resultant matrix is computed one at a time.
For two matrices the final position of the product is shown below:
Example 1
A) AB B) ABC
1 6 15
[ ] =null
4 −5 5
C)
Solution
f(x) = x3 – 6x2
1st derivative
3x2 – 12x = 0
x = 0, 4
f”(x) = 6x -12
6x -12 = 0
x = 2 (inflection point)
D)
Solution
1−𝑖 0 1 1 1−𝑖−1+𝑖 0
[ 0 2−𝑖 −2 ] [ 𝑖 ]= [ 2𝑖 − 𝑖 2 + 2 − 2𝑖 ]= [−𝑖 2 + 2]
1 −4 3−𝑖 −1 + 𝑖 1 − 4𝑖 − 3 + 3𝑖 + 𝑖 − 𝑖 2 −2 − 𝑖 2
0 1 1 1
=[−𝑖 2 + 2] + [−2] = [−𝑖 2 ] = [1]
−2 − 𝑖 2 2 −𝑖 2 1
• MATRIX PROPERTIES / CLASSIFICATIONS
1. Transpose: AT
The transpose of an m x n matrix A is n x m matrix, that is the m column & n row of matrix A is the n column & m row of
matrix AT
Properties:
a. (AT) T = A
b. (CA) T = C (A T)
c. If A + B is defined, (A + B) T = A T + B T
d. If AB is defined, (AB) T = B T A T
2. Conjugate: 𝑨
The conjugate of matrix A is the matrix, whose elements are the conjugate of A
Ex.
𝑖 −𝑖
−𝑖 𝑖
[ ] [ ]
0 0
2 2
3. Tran-jugate: A*
- Conjugate of the transpose / Transpose of the conjugate
Properties:
a. (A*)* = A
b. (CA) *= C (A*)
c. If A + B is defined, (A + B) * = A* + B*
d. If AB is defined, (AB) * = B* A*
Example 1
A square matrix where elements a ij = 0 when i > j , or all the elements below the diagonal are zero
1 2 3
A = [0 5 4]
0 0 6
5. Lower triangular Matrix
A square matrix where elements a ij = 0 when i < j , or all the elements above the diagonal are zero
1 0 0
A = [𝑖 5 0]
2 3 6
6. Diagonal Matrix
A square matrix where elements a ij = 0 when i < j , or all the elements above and below the diagonal are zero
1 0 0
A = [0 5 0]
0 0 6
7. Scalar Matrix
Satisfies : A = A
Example 2
𝑥 𝑥2
A=[1 2] B=[3 1] C=[1 2] X=[ 1 ]
3 4 1 0 2 4 𝑥3 𝑥4
a. Determine the value of x1, x2, x3 and x4 that satisfies the equation: AX = B – I
Solution
AX B–I
𝑥1 𝑥2
[ ]
𝑥3 𝑥4
[ 𝑥1 + 2𝑥3 𝑥2 + 2𝑥4 ] = [ 2 1 ]
3𝑥1 + 4𝑥3 3𝑥2 + 4𝑥4 1 −1
𝑥1 + 2𝑥3 = 2 𝑥2 + 2𝑥4 =1
Example 3
A=[2 1] B = [ −3 0 ] C = [ −2 −2 ] D=[0 0]
1 2 −2 −5 0 4 0 0
a. 3A + CD
[6 3]
3 6
b. ABC
[ 16 −4 ]
14 −26
c. AC – 2D
[ −4 0 ]
−2 6
d. Determine all numbers of “z” which satisfies the Az3 + Bz2 + Cz = D
z= 0
Example 4
𝟑
Let f(x) be the sum of the diagonal elements of [𝒙 𝟑 ] . Find the matrix defined by
𝟏 𝟗𝒙𝟐
= [𝟐 𝟏 ] 𝐱𝟐 + [ −𝟑 𝟎 ] 4x - [ −𝟐 −𝟐 ]
𝟏 𝟐 −𝟐 −𝟓 𝟎 𝟒
[ 56 11 ]
33 74
Example 5
Example 1
=(3x3)-(-2x1) = 11
Solution 2 : By Calculator
Note: Each determinant in the sum (In the R.H.S) is the determinant of a submatrix of A obtained by deleting a
particular row and column of A. These determinants are called minors. We take the sign + or - , according to ( -1)i+j aij
Where i and j represent row and column.
Hence the det A is the sum of the elements of any row or column multiplied by their corresponding cofactors.
The value of the determinant can be found by expanding it from any row or column.
Example 2
Find Det. A
Solution:
Choosing 2nd row
2 1 3 1 3 2
=-(0)| | + (1)| | - (-2)| | = 0+ 1(12-1) +2(9-2)
3 4 1 4 1 3
= 25
Solution 2 : By Calculator
Example 4
−1 −1 0 3
2 −4 4 1
A=| |
0 2 5 1
−3 0 −9 −5
Solution 1:
1
|A| = New element
(#)𝑛−2
Where
Example 5
Solution :
n=4
Solution
1
|A| = New element
(#)𝑛−2
1 2 3
1
|A| = |1 2 1|
(−1)4−2
2 6 6
1
|A| = (4)
(−1)2
|A| = 1 (4)
|A| = 4
Let’s have a short recap of all the above, then I will show my own sample.
A. CRAMER’S RULE
CRAMER’S RULE is an explicit formula for the solution of a system of linear equations with as many equations as
unknowns, valid whenever the system has a unique solution. It expresses the solution in terms of the determinants of
the (square) coefficient matrix and of matrices obtained from it by replacing one column by the column vector of
right-hand-sides of the equations.
B. GAUSSIAN ELIMINATION / GAUSS – JORDAN ELIMINATION
i. GAUSSIAN ELIMINATION
A method of solving a linear system of equations. This is done by transforming the system's augmented matrix into
row-echelon form by means of row operations. Then the system is solved by back substitution.
There are three types of row operations which may be performed on the rows of a matrix:
1. Swap the positions of two rows.
2. Multiply a row by a non-zero scalar.
3. Add to one row a scalar multiple of another.
If the matrix is associated to a system of linear equations, then these operations do not change the solution
set. Therefore, if one's goal is to solve a system of linear equations, then using these row operations could
make the problem easier.
ii. GAUSS-JORDAN ELIMINATION
Gauss-Jordan Elimination is like the continuation of Guassian Elimination; the process is the same.
The Echelon form of Gauss-Jordan Elimination is an identity matrix (type of matrix from modul
Let’s try to solve the previous sample problem using Gauss-Jordan Elimination.
C. USING INVERSE
Step 2 : We perform Gauss-Jordan reduction on the matrix and the results is [ I A-1] . If we cannot reduce A to
I using row operations, then A has no inverse.
𝑒 𝑓
[1 0 ]
0 1 𝑔 ℎ
From this
𝑒 𝑓
A-1 = [ ]
𝑔 ℎ
A=[7 3]
5 2
[7 3 1 0] 1/7 R1
5 2 0 1
[1 3/7 1/7 0 ] -5 R1 + R2
5 2 0 1
[1 3/7 1/7 0 ] -7 R
2
0 −1/7 −5/7 1
[1 0 −2 3 ]
0 1 5 −7
So A-1 = [ −2 3 ]
5 −7
B. Using Method of Adjoints
Given
7 2 1
A=[ 0 3 −1]
−3 4 −2
−2 8 −5
adj (A) = CT = [ 3 −11 7]
9 −34 21
1
A-1 = adj (A)
det A
For det. A
From
7 2 1 7 2
A=[ 0 3 −1] 0 3
−3 4 −2 −3 4
1
A-1 = adj (A)
det A
−2 8 −5
1
A-1 = [3 −11 7]
1
9 −34 21
−2 8 −5
A-1 = [ 3 −11 7]
9 −34 21
x+ y+ z=5
2x + 3y + 5z = 8
4x + 5z = 2
a. Cramer’s Rule
1 1 1 5
|𝐷| = |2 3 5| = 13 k = [8]
4 0 5 2
5 1 1 1 5 1 1 1 5
|𝐷𝑥| = |8 3 5| = 39 |𝐷𝑦| = |2 8 5| = 52 |𝐷𝑧| = |2 3 8| = -26
2 0 5 4 2 5 4 0 2
39 52 −26
x= =3 y= =4 z= = -2
13 13 13
b. Gaussian Elimination
c. Gauss Jordan Elimination
d. Inverse
1. Using method of Gauss – Jordan for Inverse
1 1 1 x 5
A = [2 3 5] X= [ ]
y B = [8]
4 0 5 z 2
X = A-1B
For A-1
1 1 1 1 0 0
[2 3 5 0 1 0] -2R1 + R2 and -4R1 + R3
4 0 5 0 0 1
1 1 1 1 0 0
[0 1 3 −2 1 0 ] -R2 + R1 and 4R2 + R3
0 −4 1 −4 0 1
1 0 −2 3 −1 0
[0 1 3 −2 1 0 ] 1/13 R3
0 0 13 −12 4 1
1 0 −2 3 −1 0
[0 1 3 −2 1 0 ] -3R3 + R2 and 2R3 + R1
0 0 1 −12/13 4/13 1/13
X = A-1B
15/13 −5/13 2/13 5
X= [ 10/13 1/13 −3/13 ] [8]
−12/13 4/13 1/13 2
3
X=[ 4 ]
−2
X = A-1B
1
A-1 = adj (A)
det A
1 1 1 1 1
A = [2 3 5] 2 3
4 0 5 4 0
15 −5 2
adj (A) = CT = [ 10 1 −3]
−12 4 1
1
A-1 = adj (A)
det A
X = A-1B
3
X=[ 4 ]
−2
Note : There’s also other Methods like Jacobi Iteration / Gauss Seidel, you can browse your CIE 115 Notes for
reference.
You can actually use your Mode 5 equations for this. For Canon F 789 SGA/Classwiz it can solve 4 equations 4
unknowns.
III. SOLUTION TO NON-LINEAR EQUATIONS
Note: You can actually use Shift Calc on this. However, you should be careful that by using this it can only give you 1
root per input. So, you should check how many possible roots of the non-linear equation you are trying to solve.
Example 1
Example 2
Example 3
Determine the root 7x3 – 15x2 + 5x =17
x = 2.29319
B. FIXED-POINT ITERATION
C. NEWTON’S METHOD
Also known as the Newton–Raphson method, named after Isaac Newton and Joseph Raphson, is a root-finding
algorithm which produces successively better approximations to the roots (or zeroes) of a real-valued
function. If a differentiable function y = f(x) has a simple root s in (a, b) and f’(s) ≠ 0, then the iteration rule is
given as
Example 1
Note: There’s also other Methods like Secant Method, Regula-Falsi Method, Newton-Rhapson Method (best use for 2
or more non-linear equations). You can browse your CIE 115 Notes for reference.
Also, there’s a topic called Numerical Integration you can also browse your CIE 115 last module for that, Just take
note that in solving definite integrals you can directly use your calculator.^^
I think, it’s best to practice solving always, and be familiarize with the functions in your calculator. ^^
Prep by: