Description
Matrix Computations
1.1 Cx
1. Conditions: Since this is just a scalar multiplication with 1D matrix, there won’t be any specific
condition that is required for the equation to hold true
2. Space in which quantity lies: 𝑹
𝑵
3. Python Code for Quantity Computation:
4. Time Complexity: O(N)
1.2 cA
1. Conditions: Since this is just a scalar multiplication with a 2D matrix, there won’t
be any specific condition that is required for the equation to hold true
2. Space in which quantity lies: 𝑹
𝑶∗𝑷
3. Python Code for Quantity Computation:
4. Time Complexity: O(O*P)
1.3 Ax
1. Conditions: P=N
2. Space in which quantity lies: 𝑹
𝑶
3. Python Code for Quantity Computation:
4. Time Complexity: O(O*P)
1.4 x
TAy
1. Conditions: N=O & P=M
2. Space in which quantity lies: R
3. Python Code for Quantity Computation:
4. Time Complexity: O(O*P)
1.5 xyT
1. Conditions: No specific conditions. Vector x and y should be represented
as 1D column vector which by notation makes yT
a row vector
2. Space in which quantity lies: 𝑹
𝑵∗𝑴
3. Python Code for Quantity Computation:
4. Time Complexity: O(N*M)
1.6 AB
1. Conditions: P=Q
2. Space in which quantity lies: 𝑹
𝑶∗𝑹
3. Python Code for Quantity Computation:
4. Time Complexity: O(O*Q*R)
1.7 ABC
5. Conditions: P=Q & R=S
6. Space in which quantity lies: 𝑹
𝑶∗𝑻
7. Python Code for Quantity Computation:
8. Time Complexity: O(O*Q*R)
8 | P a g e
9 | P a g e
10 | P a g e
11 | P a g e
12 | P a g e
13 | P a g e
14 | P a g e
PAGE INTENTIONALLY LEFT BLANK. PLEASE SEE NEXT PAGE
15 | P a g e
16 | P a g e
17 | P a g e
18 | P a g e
19 | P a g e
20 | P a g e
21 | P a g e
22 | P a g e
