MATRICES. a m,1 a m,n A =

Similar documents
Elementary maths for GMT

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations

1 - Systems of Linear Equations

Section 9.2: Matrices.. a m1 a m2 a mn

Matrix Arithmetic. j=1

Section 9.2: Matrices. Definition: A matrix A consists of a rectangular array of numbers, or elements, arranged in m rows and n columns.

PH1105 Lecture Notes on Linear Algebra.

Matrices: 2.1 Operations with Matrices

Linear Systems and Matrices

Elementary Row Operations on Matrices

Topics. Vectors (column matrices): Vector addition and scalar multiplication The matrix of a linear function y Ax The elements of a matrix A : A ij

Elementary Linear Algebra

Math 240 Calculus III

10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections )

MAC Module 1 Systems of Linear Equations and Matrices I

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

Math 360 Linear Algebra Fall Class Notes. a a a a a a. a a a

MATH2210 Notebook 2 Spring 2018

A FIRST COURSE IN LINEAR ALGEBRA. An Open Text by Ken Kuttler. Matrix Arithmetic

Fundamentals of Engineering Analysis (650163)

Calculus II - Basic Matrix Operations

Chapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

We could express the left side as a sum of vectors and obtain the Vector Form of a Linear System: a 12 a x n. a m2

SOLVING LINEAR SYSTEMS

a11 a A = : a 21 a 22

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and

7.6 The Inverse of a Square Matrix

1111: Linear Algebra I

Matrices and systems of linear equations

Linear Equations in Linear Algebra

7.5 Operations with Matrices. Copyright Cengage Learning. All rights reserved.

Linear Algebra I Lecture 8

CS100: DISCRETE STRUCTURES. Lecture 3 Matrices Ch 3 Pages:

MATH 3511 Lecture 1. Solving Linear Systems 1

Chapter 2 Notes, Linear Algebra 5e Lay

Numerical Analysis Lecture Notes

Linear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.

Chapter 7. Tridiagonal linear systems. Solving tridiagonal systems of equations. and subdiagonal. E.g. a 21 a 22 a A =

A Review of Matrix Analysis

ICS 6N Computational Linear Algebra Matrix Algebra

Math 1314 Week #14 Notes

Phys 201. Matrices and Determinants

Finite Mathematics Chapter 2. where a, b, c, d, h, and k are real numbers and neither a and b nor c and d are both zero.

Linear Algebra and Matrix Inversion

Matrix Operations. Linear Combination Vector Algebra Angle Between Vectors Projections and Reflections Equality of matrices, Augmented Matrix

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Mathematics 13: Lecture 10

Prepared by: M. S. KumarSwamy, TGT(Maths) Page

3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )

. =. a i1 x 1 + a i2 x 2 + a in x n = b i. a 11 a 12 a 1n a 21 a 22 a 1n. i1 a i2 a in

Lemma 8: Suppose the N by N matrix A has the following block upper triangular form:

Relationships Between Planes

Matrix Arithmetic. a 11 a. A + B = + a m1 a mn. + b. a 11 + b 11 a 1n + b 1n = a m1. b m1 b mn. and scalar multiplication for matrices via.

1 Matrices and matrix algebra

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Consider the following example of a linear system:

Direct Methods for Solving Linear Systems. Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le

1111: Linear Algebra I

MAC Module 2 Systems of Linear Equations and Matrices II. Learning Objectives. Upon completing this module, you should be able to :

Section 1.1: Systems of Linear Equations

LS.1 Review of Linear Algebra

MA 138 Calculus 2 with Life Science Applications Matrices (Section 9.2)

CHAPTER 6. Direct Methods for Solving Linear Systems

Definition of Equality of Matrices. Example 1: Equality of Matrices. Consider the four matrices

Linear Algebra. The analysis of many models in the social sciences reduces to the study of systems of equations.

Matrix operations Linear Algebra with Computer Science Application

Matrix Algebra. Matrix Algebra. Chapter 8 - S&B

Introduction. Vectors and Matrices. Vectors [1] Vectors [2]

1300 Linear Algebra and Vector Geometry

. a m1 a mn. a 1 a 2 a = a n

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Introduction to Matrices

Matrix Algebra 2.1 MATRIX OPERATIONS Pearson Education, Inc.

Systems of Linear Equations and Matrices

DM559 Linear and Integer Programming. Lecture 2 Systems of Linear Equations. Marco Chiarandini

Basic Concepts in Linear Algebra

is a 3 4 matrix. It has 3 rows and 4 columns. The first row is the horizontal row [ ]

TOPIC III LINEAR ALGEBRA

Systems of Linear Equations and Matrices

Chapter 1 Matrices and Systems of Equations

Review of Basic Concepts in Linear Algebra

Math 60. Rumbos Spring Solutions to Assignment #17

A matrix over a field F is a rectangular array of elements from F. The symbol

Systems of Linear Equations. By: Tri Atmojo Kusmayadi and Mardiyana Mathematics Education Sebelas Maret University

Linear Algebra and Matrices

MAT 1332: CALCULUS FOR LIFE SCIENCES. Contents. 1. Review: Linear Algebra II Vectors and matrices Definition. 1.2.

Some Notes on Linear Algebra

Gaussian Elimination and Back Substitution

MATH 2030: MATRICES ,, a m1 a m2 a mn If the columns of A are the vectors a 1, a 2,...,a n ; A is represented as A 1. .

Review for Exam Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions.

LINEAR SYSTEMS, MATRICES, AND VECTORS

Matrices. Math 240 Calculus III. Wednesday, July 10, Summer 2013, Session II. Matrices. Math 240. Definitions and Notation.

MATH 106 LINEAR ALGEBRA LECTURE NOTES

Determinants Chapter 3 of Lay

Matrices and Linear Algebra

Transcription:

MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of order m n is A = a 1,1 a 1,n a m,1 a m,n We say it has order m n Matrices that consist of a single column are called column vectors, and those consisting of a single row are called row vectors In both cases, they will have properties identical to the geometric vectors studied earlier in mulitvariable calculus We assume that most of you have seen this material previously in a course named linear algebra, matrix algebra, or something similar Section 62 in the text is intended as both a quick introduction and review of this material

MATRIX ADDITION Let A = [a i,j and B = [b i,j be matrices of order m n Then C = A + B is another matrix of order m n, with c ij = a i,j + b i,j EXAMPLE 1 2 3 4 5 6 + 1 1 1 1 1 1 = 2 1 2 5 6 5

MULTIPLICATION BY A CONSTANT a 1,1 a 1,n c a m,1 a m,n = ca 1,1 ca 1,n ca m,1 ca m,n EXAMPLE 5 1 2 3 4 5 6 [ a b ( 1) c d = 5 10 15 20 25 30 [ a b = c d

THE ZERO MATRIX 0 Define the zero matrix of order m n as the matrix of that order having all zero entries It is sometimes written as 0 m n, but more commonly as simply 0 Then for any matrix A of order m n, A + 0 = 0 + A = A The zero matrix 0 m n acts in the same role as does the number zero when doing arithmetic with real and complex numbers EXAMPLE [ 1 2 3 4 [ 0 0 + 0 0 = [ 1 2 3 4

We denote by A the solution of the equation A + B = 0 It is the matrix obtained by taking the negative of all of the entries in A For example, [ [ [ a b a b 0 0 + = c d c d 0 0 [ [ a b a b = c d c d [ a1,1 a 1,2 = a 2,1 a 2,2 [ a b = ( 1) c d [ a1,1 a 1,2 a 2,1 a 2,2

MATRIX MULTIPLICATION Let A = [a i,j have order m n and B = [b i,j have order n p Then C = AB is a matrix of order m p and c i,j = A i, B,j = a i,1 b 1,j + a i,2 b 2,j + + a i,n b n,j or equivalently c i,j = [a i,1 a i,2 a i,n b 1,j b 2,j b n,j = a i,1 b 1,j + a i,2 b 2,j + + a i,n b n,j

EXAMPLES [ 1 2 3 4 5 6 1 2 3 4 5 6 1 2 3 4 5 6 [ 1 2 3 4 5 6 a 1,1 a 1,n a n,1 a n,n x 1 x n Thus we write the linear system = = = [ 22 28 49 64 9 12 15 19 26 33 29 40 51 a 1,1 x 1 + + a 1,n x n a n,1 x 1 + + a n,n x n as Ax = b a 1,1 x 1 + + a 1,n x n = b 1 a n,1 x 1 + + a n,n x n = b n

THE IDENTITY MATRIX I For a given integer n 1, Define I n to be the matrix of order n n with 1 s in all diagonal positions and zeros elsewhere: 1 0 0 0 1 0 I n = 0 1 More commonly it is denoted by simply I Let A be a matrix of order m n Then AI n = A, I m A = A The identity matrix I acts in the same role as does the number 1 when doing arithmetic with real and complex numbers

THE MATRIX INVERSE Let A be a matrix of order n n for some n 1 We say a matrix B is an inverse for A if AB = BA = I It can be shown that if an inverse exists for A, then it is unique EXAMPLES If ad bc 0, then [ 1 [ a b 1 d = c d ad bc c [ [ 1 1 2 1 1 = 2 2 1 1 2 1 1 1 1 2 3 1 1 1 2 3 4 = 1 3 1 4 1 5 b a 9 36 30 36 192 180 30 180 180

Recall the earlier theorem on the solution of linear systems Ax = b with A a square matrix Theorem The following are equivalent statements 1 For each b, there is exactly one solution x 2 For each b, there is a solution x 3 For each b, there is at most one solution x 4 The homogeneous system Ax = 0 has only the solution x = 0 5 det (A) 0 6 A 1 exists

EXAMPLE det 1 2 3 4 5 6 7 8 9 Therefore, the linear system 1 2 3 4 5 6 7 8 9 x 1 x 2 x 3 = 0 = is not always solvable, the coefficient matrix does not have an inverse, and the homogeneous system Ax = 0 has a solution other than the zero vector, namely 1 2 3 4 5 6 7 8 9 1 2 1 = b 1 b 2 b 3 0 0 0

The arithmetic properties of matrix addition and multiplication are listed on page 248, and some of them require some work to show For example, consider showing the distributive law for matrix multiplication, (AB) C = A (BC) with A, B, C matrices of respective orders m n, n p, and p q, respectively Writing this out, we want to show p (AB) i,k C k,l = k=1 n A i,j (BC) j,l j=1 for 1 i m, 1 l q With new situations, we often use notation to suggest what should be true But this is done only after deciding what actually is true Read carefully the properties given in the text on page 248

PARTITIONED MATRICES Matrices can be built up from smaller matrices; or conversely, we can decompose a large matrix into a matrix of smaller matrices For example, consider A = B = 1 2 0 2 1 1 0 1 5 [ 1 2 2 1 [ B c = d e [ 0 c = d = [ 0 1 e = 5 1 MATLAB allows you to build up larger matrices out of smaller matrices in exactly this manner; and smaller matrices can be defined as portions of larger matrices We will often write an n n square matrix in terms of its columns: A = [A,1,, A,n For the n n identity matrix I, we write I = [e 1,, e n, with e j denoting a column vector with a 1 in position j and zeros elsewhere

ARITHMETIC OF PARTITIONED MATRICES As with matrices, we can do addition and multiplication with partitioned matrices provided the individual constituent parts have the proper orders For example, let A, B, C, D be n n matrices Then [ [ [ I A I C I + AD C + A = B I D I B + D I + BC Let A be n n and x be a column vector of length n Then Ax = [A,1,, A,n Compare this to a 1,1 a 1,n a n,1 a n,n x 1 x n x 1 x n = x 1 A,1 + + x n A,n = a 1,1 x 1 + + a 1,n x n a n,1 x 1 + + a n,n x n

PARTITIONED MATRICES IN MATLAB In MATLAB, matrices can be constructed using smaller matrices For example, let A = [1, 2; 3, 4; x = [5, 6; y = [7, 8 ; Then forms the matrix B = [A, y; x, 9; B = 1 2 7 3 4 8 5 6 9

ELEMENTARY ROW OPERATIONS As preparation for the discussion of Gaussian Elimination in Section 63, we introduce three elementary row operations on general rectangular matrices They are: i) Interchange of two rows ii) Multiplication of a row by a nonzero scalar iii) Addition of a nonzero multiple of one row to another row Consider the rectangular matrix 3 3 3 1 A = 2 2 3 1 1 2 3 1 We add row 2 times ( 1) to row 1, and then add row 3 times ( 1) to row 2 to obtain the matrix: 1 1 0 0 1 0 0 0 1 2 3 1

Add row 2 times ( 1) to row 1, and to row 3 as well: 0 1 0 0 1 0 0 0 0 2 3 1 Add row 1 times ( 2) to row 3: 0 1 0 0 1 0 0 0 0 0 3 1 Interchange row 1 and row 2: 1 0 0 0 0 1 0 0 0 0 3 1 Finally, we multiply row 3 by 1/3: 1 0 0 0 0 1 0 0 0 0 1 1/3

1 0 0 0 0 1 0 0 0 0 1 1/3 This is obtained from A using elementary row operations A reverse sequence of operations of the same type converts this result back to A