Download
1 / 12
120 likes | 180 Views
Chapter 1: Matrices. Definition 1 : A matrix is a rectangular array of numbers arranged in horizontal rows and vertical columns. EXAMPLE :. Matrix Operations: matrix addition. Definition 2 : Matrix Addition Let A = ( a i j ) & B = ( b i j ) be m n matrices.
E N D
Chapter 1: Matrices Definition 1: A matrix is a rectangular array of numbers arranged in horizontal rows and vertical columns. EXAMPLE:
Matrix Operations: matrix addition Definition 2: Matrix Addition Let A = ( ai j ) & B = ( bi j ) be mn matrices. Then C = A + B is an mn matrix with elements ci j ai j + bi j . Example: Properties: (A1) A + B = B + A (A2) (A + B) + C = A + (B + C) (A1) A + 0 = A where 0 is a zero matrix (matrix consisting of only zero elements)
Matrix Operations: scalar multiplication Definition 3: Scalar Multiplication Let A = ( ai j ) and λ R. Then C = λ A is an mn matrix with elements ci j λai j . Properties: (S1) λ A = A λ (S2) λ (A + B) = λ A + λ B (S3) (λ1 + λ2) A = λ1A + λ2A (S4) λ1 (λ2 A) =(λ1λ2)A
1.3 Matrix Multiplication Definition: Matrix Multiplication If A = ( ai j ) is an mn matrix and B = ( bi j ) is an np matrix, Then the product AB is defined to be an mp matrix C = ( ci j ) where ci j = ai 1b1 j + ai 2b2 j + … + ai nbn j In other words, ci j = ( Row i of A ) ( Column j of B ) Example: Properties: (M1) (AB)C= A(BC) (M2) A(B+ C) = AB+ AC (M3) (B+ C)A= BA+ CA
Matrix multiplication lacks commutativity. Example 1: Example 2: Other properties that matrix multiplication lacks: 1) AB = 0 doesn’t imply A = 0 or B = 0 2) AB = AC doesn’t imply B = C
1.4 Special Matrices Examples: Definition (matrix transpose): Given a matrix A, the transpose of A, denoted by AT and read A-transpose, is obtained by changing all the rows of A into columns of AT while preserving the order. Properties of the transpose: 1) (AT)T = A 2) (λ A)T = λ AT 3) (A + B)T = AT + BT 4) (A B)T = BT AT A symmetric matrix is a matrix that is equal to its transpose while a skew symmetric matrix is a matrix that is equal to the negative of its transpose.
1.4 Special Matrices: row-reduced form Definition: A matrix is in row-reduced form if it satisfies four conditions: (R1) All zero rows appear below nonzero rows when both types are present in the matrix. (R2) The first nonzero element in any nonzero row is unity. (R3) All elements directly below (that is, in the same column but in succeeding rows from) the first nonzero element of a nonzero row are zero. (R4) The first nonzero element of any nonzero row appears in a later column (further to the right) than the first nonzero element in any preceding row. Example:
Row-reduced form: examples • In row-reduced form • Not in row-reduced form
1.4 Special Matrices: identity matrice Definition: A square matrix that has 1’s on the main diagonal and 0’s off the main diagonal is called an identity matrix. Example: A 3 × 3 identity matrix. Note: An identity matrix has the property that AI = IA = A.
1.4 Special Matrices: lower (upper) triangular matrices Definition: A square matrix A=[aij] is called lower triangular if aij=0 for j>i (that is, if all the elements above the main diagonal are zero) and upper triangular if aij=0 for j<i (that is, if all the elements below the main diagonal are zero). Example:
Magnitude: x2 Is a UNIT vector If , v Is a unit vector x1 1.6 Vectors Definition: A vector is a 1 n or n 1 matrix. A nonzero vector is normalized if it is divided by its magnitude.
1.7 The geometry of vectors v+w v w Vector Addition Vector Subtraction v-w v w
