MTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018)
|
|
- Allan Robertson
- 5 years ago
- Views:
Transcription
1 MTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018) COURSEWORK 3 SOLUTIONS Exercise ( ) 1. (a) Write A = (a ij ) n n and B = (b ij ) n n. Since A and B are diagonal, we have a ij = 0 and b ij = 0 whenever i j. Now write AB = (c ij ) n n, i.e. let c ij denote the (i, j)-entry of AB. We are trying to show that AB is diagonal, so we must show that c ij = 0 whenever i j. The definition of matrix multiplication says that c ij = a ik b kj. Now, in this notation we have a ik = 0 whenever i k, and b kj = 0 whenever j k; so the only way that one of the terms a ik b kj in above sum can be non-zero is if both i and j are equal to k (because both a ik and b kj would have to be non-zero). In particular, i and j have to be equal to each other! If they are not, then c ij = 0, which is what we were trying to show. We also need to show that A and B commute. Write BA = (d ij ) n n. By the above proof, we know that BA is also diagonal (i.e. we could have just interchanged the roles of A and B in the above proof). Since both AB and BA are diagonal, we just need to show that their diagonal entries, i.e. those with i = j, are equal. That is, we must show that c ii = d ii for all i {1,..., n}. We have c ii = a ik b ki, and in order for a term a ik b ki in this sum to be non-zero, we need both a ik and b ki to be non-zero, so we need k = i. Therefore, c ii = a ii b ii. But if we swap the roles of A and B in this calculation, we find that d ii = b ii a ii = a ii b ii. Since this argument did not depend on the value of i, we have shown that c ii = d ii for all i, which is what we wanted. (b) Let s use the same notation A = (a ij ) n n, B = (b ij ) n n and AB = (c ij ) n n as in part (a). We are assuming that A and B are upper triangular, i.e. that a ij = 0 and b ij = 0 whenever i > j. We must show that AB is upper triangular, i.e. that c ij = 0 whenever i > j. From the definition of matrix multiplication, we can write j c ij = a ik b kj = a ik b kj + a ik b kj. k=j+1 Since A is upper triangular, we have a ik = 0 whenever i > k; but we are also assuming that i > j (because we are trying to show that c ij = 0 in this case), so in the sum j a ikb kj
2 above we have k j < i and hence all of the a ik in this sum are 0. Similarly, in the second sum n k=j+1 a ikb kj we have k < j (because k starts from j + 1 in this sum) and hence b kj = 0 because B is upper triangular. Combining these last two observations, we conclude that when i > j we have c ij = j a ik }{{} =0 b kj + k=j+1 a ik b }{{} kj = 0, =0 which means that AB = (c ij ) is indeed upper triangular. (c) Two upper triangular matrices will not necessarily commute. Here is a counterexample. If A = and B = , then AB = but BA = Exercise 2. (a) We are assuming that A is symmetric, i.e. that A T = A, and we must prove that BAB T is symmetric, i.e. that (BAB T ) T = BAB T. By Proposition 2.12(4) in the lecture notes (which says that (CD) T = D T C T for matrices C and D), we have (BAB T ) T = (B T ) T A T B T = BA T B T. Since A is symmetric, this equals BAB T, which is what we wanted. (b) In general, we have (AB) T = B T A T. If A and B are symmetric, it follows that (AB) T = BA. This equals AB if and only if A and B commute (by definition of commute ). (c) We are assuming that AB = I, and we are trying to prove that also BA = I. This means that B is invertible (with inverse A). By the Invertible Matrix Theorem, to prove that B is invertible, we can instead prove that that Bx = 0 has only the trivial solution. But if Bx = 0, then x = Ix = ABx = A0 = 0, so indeed the only solution of Bx = 0 is the trivial solution. Hence, B is invertible, but we still need to show that A is the inverse of B, i.e. that BA = I (we already know that AB = I, by assumption). Let C denote the inverse of B, so that BC = I = CB. Then, in particular, CB = AB (because both are equal to I) and so part (d) gives A = C, i.e. A is the inverse of B. (Alternatively, observe that BA = BAI = BA(BC) = B(AB)C = BIC = BC = I.) (d) Multiplying both sides of the equation AB = AC on the left by A 1 (which we are assuming exists) gives A 1 AB = A 1 AC, i.e. IB = IC, i.e. B = C as required. Exercise 3. Consider the following 4 4 elementary matrices: E 1 = , E 2 = , E 3 =
3 Then E 1 and E 3 commute because E 1 E 3 = E 3 E 1 = , 0 but E 1 and E 2 do not commute because E 1 E 2 = while E 2E 1 = (Remark: think about the row operations that these matrices are performing. Can you convince yourself that E 1 and E 3 commute but E 1 and E 2 do not, without explicitly computing the various matrix products?) Exercise 4. (a) Using Gauss Jordan inversion, we find R 2 R 2 + 2R R 3 R 3 R R 1 R 1 3R R 1 R 1 + R Since the left-hand side of the final augmented matrix is the identity matrix, we conclude that A is invertible, and the inverse of A is the right-hand side of the final augmented matrix, i.e. A 1 = (b) The system can be written in the form Ax = b, where A = , x = x 1 x 2, and b = Therefore, by part (a), x = A 1 b = = 3 2, that is, the solution set of the system is {(3, 2, 1)}. Exercise (#) 5. (a) Using the Gauss Jordan algorithm, we find R 3 R 3 + 2R R 2 1R R 1 R 1 4R 2. x 3
4 (b) Part (a) shows that the matrix A is row equivalent to I 3 3, so it is invertible by the Invertible Matrix Theorem. The elementary matrices corresponding to the elementary row operations used to obtain I 3 3 from are E 1 = (apply R 3 R 3 + 2R 1 to I 3 3 ); E 2 = (apply R 2 1R 3 2 to I 3 3 ); E 3 = (apply R 1 R 1 4R 2 to I 3 3 ), and we have E 3 E 2 E 1 A = I. Therefore, the inverse of A can be written as and A itself can be written as A 1 = E 3 E 2 E 1, A = (A 1 ) 1 = (E 3 E 2 E 1 ) 1 = E1 1 E2 1 E3 1. Note that the inverses of the elementary matrices E i (i = 1, 2, 3) above are obtained by reversing the row operation that was used to obtain E i from I 3 3. That is, E1 1 = (apply R 3 R 3 2R 1 to I 3 3 ); E2 1 = (apply R 2 3R 2 to I 3 3 ); E3 1 = (apply R 1 R 1 + 4R 2 to I 3 3 ). Exercise (#) 6. (a) The first interpolation condition says that S(0) = y 1. Looking at the piecewise definition of S(x), we see that when x = 0, S(x) is defined by the formula a 1 x 3 + b 1 x 2 + c 1 x + d 1, and so in particular S(0) = d 1. Therefore, our first equation for the 16 coefficients of S(x) is d 1 = y 1. The second interpolation condition says that S(1) = y 2. The piecewise definition of S(x) says that when x = 1, S(x) is defined by the formula a 2 (x 1) 3 +b 2 (x 1) 2 +c 2 (x 1)+d 2, and this tells us that S(1) = d 2. Therefore, our second equation for the coefficients of S(x) is d 2 = y 2. Similarly, the conditions S(2) = y 3 and S(3) = y 4 give us the equations d 3 = y 3 and d 4 = y 4. The final interpolation condition, i.e. S(4) = y 5, gives us a slightly different looking equation. When x = 4, we have S(x) = a 4 (x 3) 3 + b 4 (x 3) 2 + c 4 (x 3) + d 4 according to the
5 piecewise definition of S(x). Substituting in x = 4 and setting the result equal to y 5 gives the fifth equation a 4 + b 4 + c 4 + d 4 = y 5. (b) In order for S(x) to be continuous at x = 1, the formulae that define S(x) on the intervals [0, 1) and [1, 2) should agree at x = 1. In other words, if we substitute x = 1 into a 1 x 3 + b 1 x 2 + c 1 x + d 1 and a 2 (x 1) 3 + b 2 (x 1) 2 + c 2 (x 1) + d 2, then we should get the same answer. This gives the following equation for the coefficients of S(x): a 1 + b 1 + c 1 + d 1 = d 2. Similarly, for S(x) to be continuous at x = 2 we must have a 2 + b 2 + c 2 + d 2 = d 3, and for S(x) to be continuous at x = 3 we must have a 3 + b 3 + c 3 + d 3 = d 4. (c) We now need to write down conditions that will make S(x) differentiable at x = 1, 2 and 3. Let s therefore first write down the derivative of S(x) using its piecewise definition: 3a 1 x 2 + 2b 1 x + c 1 if 0 x < 1 S 3a 2 (x 1) 2 + 2b 2 (x 1) + c 2 if 1 x < 2 (x) = 3a 3 (x 2) 2 + 2b 3 (x 2) + c 3 if 2 x < 3 3a 4 (x 3) 2 + 2b 4 (x 3) + c 4 if 3 x 4. If S(x) is to be differentiable at x = 1, then the first two formulae above must agree at x = 1. That is, we should get the same answer when we put x = 1 into both 3a 1 x 2 +2b 1 x+c 1 and 3a 2 (x 1) 2 + 2b 2 (x 1) + c 2. This gives us the following equation for the coefficients of S(x): 3a 1 + 2b 1 + c 1 = c 2. Similarly, for S(x) to be differentiable at x = 2 we must have 3a 2 + 2b 2 + c 2 = c 3, and for S(x) to be differentiable at x = 3 we must have 3a 3 + 2b 3 + c 3 = c 4. (d) Finally, to make S(x) twice differentiable at x = 1, 2 and 3, let s consider the second derivative of S(x): 6a 1 x + 2b 1 if 0 x < 1 S 6a 2 (x 1) + 2b 2 if 1 x < 2 (x) = 6a 3 (x 2) + 2b 3 if 2 x < 3 6a 4 (x 3) + 2b 4 if 3 x 4. In order for S(x) to be twice differentiable at x = 1, the first two formulae above must agree at x = 1. That is, if we put x = 1 into both 6a 1 x + 2b 1 and 6a 2 (x 1) + 2b 2, then we should get the same answer. This means that we must have 6a 1 + 2b 1 = 2b 2. Similarly, for S(x) to be twice differentiable at x = 2 and x = 3, we must have (respectively) 6a 2 + 2b 2 = 2b 3 and 6a 3 + 2b 3 = 2b 4.
6 (e) If we try to use a cubic spline to interpolate n points instead of five points, then the interpolant S(x) will be built from n 1 cubic polynomials, each depending on four coefficients. Therefore, S(x) itself will depend on a total of 4(n 1) = 4n 4 coefficients. If we follow steps (a) (d), we will obtain (1) n equations for the coefficients of S(x) from step (a), one for each of the n interpolation conditions; (2) n 2 equations from step (b), by making S(x) continuous at the n 2 points where pairs of the n 1 cubics are pieced together; (3) n 2 equations from step (c), by making S(x) differentiable at these n 2 points; (4) n 2 equations from step (d), by making S(x) twice differentiable at these n 2 points. In total, this is n + 3(n 2) = 4n 6 equations for the 4n 4 coefficients. (In other words, there are always two free variables the linear system for the coefficients of S(x); the number of free variables does not increase as we increase the number n of data points that we are trying to interpolate.) Exercise (MATLAB) 7. Please see the separate MATLAB output file on QMPlus, which contains model code/output for this exercise.
7.6 The Inverse of a Square Matrix
7.6 The Inverse of a Square Matrix Copyright Cengage Learning. All rights reserved. What You Should Learn Verify that two matrices are inverses of each other. Use Gauss-Jordan elimination to find inverses
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationORIE 6300 Mathematical Programming I August 25, Recitation 1
ORIE 6300 Mathematical Programming I August 25, 2016 Lecturer: Calvin Wylie Recitation 1 Scribe: Mateo Díaz 1 Linear Algebra Review 1 1.1 Independence, Spanning, and Dimension Definition 1 A (usually infinite)
More informationGAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511)
GAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511) D. ARAPURA Gaussian elimination is the go to method for all basic linear classes including this one. We go summarize the main ideas. 1.
More informationMath Matrix Theory - Spring 2012
Math 440 - Matrix Theory - Spring 202 HW #2 Solutions Which of the following are true? Why? If not true, give an example to show that If true, give your reasoning (a) Inverse of an elementary matrix is
More informationChapter 2 Notes, Linear Algebra 5e Lay
Contents.1 Operations with Matrices..................................1.1 Addition and Subtraction.............................1. Multiplication by a scalar............................ 3.1.3 Multiplication
More information4 Elementary matrices, continued
4 Elementary matrices, continued We have identified 3 types of row operations and their corresponding elementary matrices. To repeat the recipe: These matrices are constructed by performing the given row
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University February 6, 2018 Linear Algebra (MTH
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 7 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 7 1 / 8 Properties of the matrix product Let us show that the matrix product we
More informationWe 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
Week 22 Equations, Matrices and Transformations Coefficient Matrix and Vector Forms of a Linear System Suppose we have a system of m linear equations in n unknowns a 11 x 1 + a 12 x 2 + + a 1n x n b 1
More informationn n matrices The system of m linear equations in n variables x 1, x 2,..., x n can be written as a matrix equation by Ax = b, or in full
n n matrices Matrices Definitions Diagonal, Identity, and zero matrices Addition Multiplication Transpose and inverse The system of m linear equations in n variables x 1, x 2,..., x n a 11 x 1 + a 12 x
More informationE k E k 1 E 2 E 1 A = B
Theorem.5. suggests that reducing a matrix A to (reduced) row echelon form is tha same as multiplying A from left by the appropriate elementary matrices. Hence if B is a matrix obtained from a matrix A
More informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
More informationMatrices Gaussian elimination Determinants. Graphics 2009/2010, period 1. Lecture 4: matrices
Graphics 2009/2010, period 1 Lecture 4 Matrices m n matrices Matrices Definitions Diagonal, Identity, and zero matrices Addition Multiplication Transpose and inverse The system of m linear equations in
More informationLinear Algebra and Matrix Inversion
Jim Lambers MAT 46/56 Spring Semester 29- Lecture 2 Notes These notes correspond to Section 63 in the text Linear Algebra and Matrix Inversion Vector Spaces and Linear Transformations Matrices are much
More informationMAT 2037 LINEAR ALGEBRA I web:
MAT 237 LINEAR ALGEBRA I 2625 Dokuz Eylül University, Faculty of Science, Department of Mathematics web: Instructor: Engin Mermut http://kisideuedutr/enginmermut/ HOMEWORK 2 MATRIX ALGEBRA Textbook: Linear
More informationCS100: DISCRETE STRUCTURES. Lecture 3 Matrices Ch 3 Pages:
CS100: DISCRETE STRUCTURES Lecture 3 Matrices Ch 3 Pages: 246-262 Matrices 2 Introduction DEFINITION 1: A matrix is a rectangular array of numbers. A matrix with m rows and n columns is called an m x n
More informationMATH 2030: MATRICES. Example 0.2. Q:Define A 1 =, A. 3 4 A: We wish to find c 1, c 2, and c 3 such that. c 1 + c c
MATH 2030: MATRICES Matrix Algebra As with vectors, we may use the algebra of matrices to simplify calculations. However, matrices have operations that vectors do not possess, and so it will be of interest
More informationMatrix Algebra. Matrix Algebra. Chapter 8 - S&B
Chapter 8 - S&B Algebraic operations Matrix: The size of a matrix is indicated by the number of its rows and the number of its columns. A matrix with k rows and n columns is called a k n matrix. The number
More informationElementary Matrices. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Elementary Matrices MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Outline Today s discussion will focus on: elementary matrices and their properties, using elementary
More informationA FIRST COURSE IN LINEAR ALGEBRA. An Open Text by Ken Kuttler. Matrix Arithmetic
A FIRST COURSE IN LINEAR ALGEBRA An Open Text by Ken Kuttler Matrix Arithmetic Lecture Notes by Karen Seyffarth Adapted by LYRYX SERVICE COURSE SOLUTION Attribution-NonCommercial-ShareAlike (CC BY-NC-SA)
More informationMatrix operations Linear Algebra with Computer Science Application
Linear Algebra with Computer Science Application February 14, 2018 1 Matrix operations 11 Matrix operations If A is an m n matrix that is, a matrix with m rows and n columns then the scalar entry in the
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationCSL361 Problem set 4: Basic linear algebra
CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J Olver 3 Review of Matrix Algebra Vectors and matrices are essential for modern analysis of systems of equations algebrai, differential, functional, etc In this
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More informationMATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.
MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. Elementary matrices Theorem 1 Any elementary row operation σ on matrices with n rows can be simulated as left multiplication
More information4 Elementary matrices, continued
4 Elementary matrices, continued We have identified 3 types of row operations and their corresponding elementary matrices. If you check the previous examples, you ll find that these matrices are constructed
More informationMatrices and systems of linear equations
Matrices and systems of linear equations Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T.
More information. =. 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
Vectors and Matrices Continued Remember that our goal is to write a system of algebraic equations as a matrix equation. Suppose we have the n linear algebraic equations a x + a 2 x 2 + a n x n = b a 2
More informationElementary matrices, continued. To summarize, we have identified 3 types of row operations and their corresponding
Elementary matrices, continued To summarize, we have identified 3 types of row operations and their corresponding elementary matrices. If you check the previous examples, you ll find that these matrices
More informationICS 6N Computational Linear Algebra Matrix Algebra
ICS 6N Computational Linear Algebra Matrix Algebra Xiaohui Xie University of California, Irvine xhx@uci.edu February 2, 2017 Xiaohui Xie (UCI) ICS 6N February 2, 2017 1 / 24 Matrix Consider an m n matrix
More informationMethods for Solving Linear Systems Part 2
Methods for Solving Linear Systems Part 2 We have studied the properties of matrices and found out that there are more ways that we can solve Linear Systems. In Section 7.3, we learned that we can use
More informationMatrix & Linear Algebra
Matrix & Linear Algebra Jamie Monogan University of Georgia For more information: http://monogan.myweb.uga.edu/teaching/mm/ Jamie Monogan (UGA) Matrix & Linear Algebra 1 / 84 Vectors Vectors Vector: A
More informationInverses and Elementary Matrices
Inverses and Elementary Matrices 1-12-2013 Matrix inversion gives a method for solving some systems of equations Suppose a 11 x 1 +a 12 x 2 + +a 1n x n = b 1 a 21 x 1 +a 22 x 2 + +a 2n x n = b 2 a n1 x
More informationLinear Algebra: Lecture notes from Kolman and Hill 9th edition.
Linear Algebra: Lecture notes from Kolman and Hill 9th edition Taylan Şengül March 20, 2019 Please let me know of any mistakes in these notes Contents Week 1 1 11 Systems of Linear Equations 1 12 Matrices
More informationThis lecture is a review for the exam. The majority of the exam is on what we ve learned about rectangular matrices.
Exam review This lecture is a review for the exam. The majority of the exam is on what we ve learned about rectangular matrices. Sample question Suppose u, v and w are non-zero vectors in R 7. They span
More informationMath x + 3y 5z = 14 3x 2y + 3z = 17 4x + 3y 2z = 1
Math 210 1. Solve the system: x + y + z = 1 2x + 3y + 4z = 5 (a z = 2, y = 1 and x = 0 (b z =any value, y = 3 2z and x = z 2 (c z =any value, y = 3 2z and x = z + 2 (d z =any value, y = 3 + 2z and x =
More informationOHSx XM511 Linear Algebra: Solutions to Online True/False Exercises
This document gives the solutions to all of the online exercises for OHSx XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Answers are in square brackets [. Lecture 02 ( 1.1)
More informationMAC Module 2 Systems of Linear Equations and Matrices II. Learning Objectives. Upon completing this module, you should be able to :
MAC 0 Module Systems of Linear Equations and Matrices II Learning Objectives Upon completing this module, you should be able to :. Find the inverse of a square matrix.. Determine whether a matrix is invertible..
More informationCHAPTER 8: Matrices and Determinants
(Exercises for Chapter 8: Matrices and Determinants) E.8.1 CHAPTER 8: Matrices and Determinants (A) means refer to Part A, (B) means refer to Part B, etc. Most of these exercises can be done without a
More informationChapter 2. Square matrices
Chapter 2. Square matrices Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/18 Invertible matrices Definition 2.1 Invertible matrices An n n matrix A is said to be invertible, if there is a
More informationChapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in
Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column
More informationReview for Exam Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions.
Review for Exam. Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions. x + y z = 2 x + 2y + z = 3 x + y + (a 2 5)z = a 2 The augmented matrix for
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationLecture Notes in Linear Algebra
Lecture Notes in Linear Algebra Dr. Abdullah Al-Azemi Mathematics Department Kuwait University February 4, 2017 Contents 1 Linear Equations and Matrices 1 1.2 Matrices............................................
More informationMatrices. Chapter Definitions and Notations
Chapter 3 Matrices 3. Definitions and Notations Matrices are yet another mathematical object. Learning about matrices means learning what they are, how they are represented, the types of operations which
More information3 Matrix Algebra. 3.1 Operations on matrices
3 Matrix Algebra A matrix is a rectangular array of numbers; it is of size m n if it has m rows and n columns. A 1 n matrix is a row vector; an m 1 matrix is a column vector. For example: 1 5 3 5 3 5 8
More informationElementary Linear Algebra
Matrices J MUSCAT Elementary Linear Algebra Matrices Definition Dr J Muscat 2002 A matrix is a rectangular array of numbers, arranged in rows and columns a a 2 a 3 a n a 2 a 22 a 23 a 2n A = a m a mn We
More informationMath 313 Chapter 1 Review
Math 313 Chapter 1 Review Howard Anton, 9th Edition May 2010 Do NOT write on me! Contents 1 1.1 Introduction to Systems of Linear Equations 2 2 1.2 Gaussian Elimination 3 3 1.3 Matrices and Matrix Operations
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationChapter 1: Systems of Linear Equations and Matrices
: Systems of Linear Equations and Matrices Multiple Choice Questions. Which of the following equations is linear? (A) x + 3x 3 + 4x 4 3 = 5 (B) 3x x + x 3 = 5 (C) 5x + 5 x x 3 = x + cos (x ) + 4x 3 = 7.
More informationLinear Algebra, Summer 2011, pt. 2
Linear Algebra, Summer 2, pt. 2 June 8, 2 Contents Inverses. 2 Vector Spaces. 3 2. Examples of vector spaces..................... 3 2.2 The column space......................... 6 2.3 The null space...........................
More informationLecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013
Lecture 6 & 7 Shuanglin Shao September 16th and 18th, 2013 1 Elementary matrices 2 Equivalence Theorem 3 A method of inverting matrices Def An n n matrice is called an elementary matrix if it can be obtained
More informationFormula for the inverse matrix. Cramer s rule. Review: 3 3 determinants can be computed expanding by any row or column
Math 20F Linear Algebra Lecture 18 1 Determinants, n n Review: The 3 3 case Slide 1 Determinants n n (Expansions by rows and columns Relation with Gauss elimination matrices: Properties) Formula for the
More informationLinear Algebra: Lecture Notes. Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway
Linear Algebra: Lecture Notes Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway November 6, 23 Contents Systems of Linear Equations 2 Introduction 2 2 Elementary Row
More informationLinear Equations and Matrix
1/60 Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Gaussian Elimination 2/60 Alpha Go Linear algebra begins with a system of linear
More information22A-2 SUMMER 2014 LECTURE 5
A- SUMMER 0 LECTURE 5 NATHANIEL GALLUP Agenda Elimination to the identity matrix Inverse matrices LU factorization Elimination to the identity matrix Previously, we have used elimination to get a system
More informationMath 344 Lecture # Linear Systems
Math 344 Lecture #12 2.7 Linear Systems Through a choice of bases S and T for finite dimensional vector spaces V (with dimension n) and W (with dimension m), a linear equation L(v) = w becomes the linear
More informationMATRICES. a m,1 a m,n A =
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
More informationElementary Row Operations on Matrices
King Saud University September 17, 018 Table of contents 1 Definition A real matrix is a rectangular array whose entries are real numbers. These numbers are organized on rows and columns. An m n matrix
More information1300 Linear Algebra and Vector Geometry
1300 Linear Algebra and Vector Geometry R. Craigen Office: MH 523 Email: craigenr@umanitoba.ca May-June 2017 Matrix Inversion Algorithm One payoff from this theorem: It gives us a way to invert matrices.
More informationOffline Exercises for Linear Algebra XM511 Lectures 1 12
This document lists the offline exercises for Lectures 1 12 of XM511, which correspond to Chapter 1 of the textbook. These exercises should be be done in the traditional paper and pencil format. The section
More informationVectors and matrices: matrices (Version 2) This is a very brief summary of my lecture notes.
Vectors and matrices: matrices (Version 2) This is a very brief summary of my lecture notes Matrices and linear equations A matrix is an m-by-n array of numbers A = a 11 a 12 a 13 a 1n a 21 a 22 a 23 a
More informationMIT Final Exam Solutions, Spring 2017
MIT 8.6 Final Exam Solutions, Spring 7 Problem : For some real matrix A, the following vectors form a basis for its column space and null space: C(A) = span,, N(A) = span,,. (a) What is the size m n of
More informationLinear Algebra. Solving Linear Systems. Copyright 2005, W.R. Winfrey
Copyright 2005, W.R. Winfrey Topics Preliminaries Echelon Form of a Matrix Elementary Matrices; Finding A -1 Equivalent Matrices LU-Factorization Topics Preliminaries Echelon Form of a Matrix Elementary
More informationComponents and change of basis
Math 20F Linear Algebra Lecture 16 1 Components and change of basis Slide 1 Review: Isomorphism Review: Components in a basis Unique representation in a basis Change of basis Review: Isomorphism Definition
More informationReview Solutions for Exam 1
Definitions Basic Theorems. Finish the definition: Review Solutions for Exam (a) A linear combination of vectors {v,..., v n } is: any vector of the form c v + c v + + c n v n (b) A set of vectors {v,...,
More informationINSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW MATRICES
1 CHAPTER 4 MATRICES 1 INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW MATRICES 1 Matrices Matrices are of fundamental importance in 2-dimensional and 3-dimensional graphics programming
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationReview Questions REVIEW QUESTIONS 71
REVIEW QUESTIONS 71 MATLAB, is [42]. For a comprehensive treatment of error analysis and perturbation theory for linear systems and many other problems in linear algebra, see [126, 241]. An overview of
More informationLinear Algebra I Lecture 8
Linear Algebra I Lecture 8 Xi Chen 1 1 University of Alberta January 25, 2019 Outline 1 2 Gauss-Jordan Elimination Given a system of linear equations f 1 (x 1, x 2,..., x n ) = 0 f 2 (x 1, x 2,..., x n
More informationLinear Systems. Math A Bianca Santoro. September 23, 2016
Linear Systems Math A4600 - Bianca Santoro September 3, 06 Goal: Understand how to solve Ax = b. Toy Model: Let s study the following system There are two nice ways of thinking about this system: x + y
More informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
More informationMatrices. 1 a a2 1 b b 2 1 c c π
Matrices 2-3-207 A matrix is a rectangular array of numbers: 2 π 4 37 42 0 3 a a2 b b 2 c c 2 Actually, the entries can be more general than numbers, but you can think of the entries as numbers to start
More informationMon Feb Matrix algebra and matrix inverses. Announcements: Warm-up Exercise:
Math 2270-004 Week 5 notes We will not necessarily finish the material from a given day's notes on that day We may also add or subtract some material as the week progresses, but these notes represent an
More informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
More informationMTH 215: Introduction to Linear Algebra
MTH 215: Introduction to Linear Algebra Lecture 5 Jonathan A. Chávez Casillas 1 1 University of Rhode Island Department of Mathematics September 20, 2017 1 LU Factorization 2 3 4 Triangular Matrices Definition
More informationMath 54 HW 4 solutions
Math 54 HW 4 solutions 2.2. Section 2.2 (a) False: Recall that performing a series of elementary row operations A is equivalent to multiplying A by a series of elementary matrices. Suppose that E,...,
More informationNumerical Methods Lecture 2 Simultaneous Equations
CGN 42 - Computer Methods Numerical Methods Lecture 2 Simultaneous Equations Topics: matrix operations solving systems of equations Matrix operations: Adding / subtracting Transpose Multiplication Adding
More informationChapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations
Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS
More informationMath 308 Midterm Answers and Comments July 18, Part A. Short answer questions
Math 308 Midterm Answers and Comments July 18, 2011 Part A. Short answer questions (1) Compute the determinant of the matrix a 3 3 1 1 2. 1 a 3 The determinant is 2a 2 12. Comments: Everyone seemed to
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Corrected Version, 7th April 013 Comments to the author at keithmatt@gmail.com Chapter 1 LINEAR EQUATIONS 1.1
More informationLecture 2 Systems of Linear Equations and Matrices, Continued
Lecture 2 Systems of Linear Equations and Matrices, Continued Math 19620 Outline of Lecture Algorithm for putting a matrix in row reduced echelon form - i.e. Gauss-Jordan Elimination Number of Solutions
More informationEigenvalues and Eigenvectors: An Introduction
Eigenvalues and Eigenvectors: An Introduction The eigenvalue problem is a problem of considerable theoretical interest and wide-ranging application. For example, this problem is crucial in solving systems
More informationIntroduction to Determinants
Introduction to Determinants For any square matrix of order 2, we have found a necessary and sufficient condition for invertibility. Indeed, consider the matrix The matrix A is invertible if and only if.
More informationBasics. A VECTOR is a quantity with a specified magnitude and direction. A MATRIX is a rectangular array of quantities
Some Linear Algebra Basics A VECTOR is a quantity with a specified magnitude and direction Vectors can exist in multidimensional space, with each element of the vector representing a quantity in a different
More informationSolution to Homework 1
Solution to Homework Sec 2 (a) Yes It is condition (VS 3) (b) No If x, y are both zero vectors Then by condition (VS 3) x = x + y = y (c) No Let e be the zero vector We have e = 2e (d) No It will be false
More informationLINEAR ALGEBRA WITH APPLICATIONS
SEVENTH EDITION LINEAR ALGEBRA WITH APPLICATIONS Instructor s Solutions Manual Steven J. Leon PREFACE This solutions manual is designed to accompany the seventh edition of Linear Algebra with Applications
More informationMATH10212 Linear Algebra B Homework Week 5
MATH Linear Algebra B Homework Week 5 Students are strongly advised to acquire a copy of the Textbook: D C Lay Linear Algebra its Applications Pearson 6 (or other editions) Normally homework assignments
More informationMath 320, spring 2011 before the first midterm
Math 320, spring 2011 before the first midterm Typical Exam Problems 1 Consider the linear system of equations 2x 1 + 3x 2 2x 3 + x 4 = y 1 x 1 + 3x 2 2x 3 + 2x 4 = y 2 x 1 + 2x 3 x 4 = y 3 where x 1,,
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 998 Comments to the author at krm@mathsuqeduau All contents copyright c 99 Keith
More informationTopic 15 Notes Jeremy Orloff
Topic 5 Notes Jeremy Orloff 5 Transpose, Inverse, Determinant 5. Goals. Know the definition and be able to compute the inverse of any square matrix using row operations. 2. Know the properties of inverses.
More informationNext topics: Solving systems of linear equations
Next topics: Solving systems of linear equations 1 Gaussian elimination (today) 2 Gaussian elimination with partial pivoting (Week 9) 3 The method of LU-decomposition (Week 10) 4 Iterative techniques:
More informationLesson 3. Inverse of Matrices by Determinants and Gauss-Jordan Method
Module 1: Matrices and Linear Algebra Lesson 3 Inverse of Matrices by Determinants and Gauss-Jordan Method 3.1 Introduction In lecture 1 we have seen addition and multiplication of matrices. Here we shall
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
More informationMath 343 Midterm I Fall 2006 sections 002 and 003 Instructor: Scott Glasgow
Math 343 Midterm I Fall 006 sections 00 003 Instructor: Scott Glasgow 1 Assuming A B are invertible matrices of the same size, prove that ( ) 1 1 AB B A 1 = (11) B A 1 1 is the inverse of AB if only if
More information